LOOKUP TABLE AND DATA ACQUISITION METHOD

摘要

Input data is divided into a plurality of blocks which are correlated with respective addresses of a lookup table. Each of the blocks is divided into a plurality of sections according to the output data change. Position information indicating a section boundary and output data at each section are stored in an address corresponding to each block. Thus, it is possible to reduce the memory capacity required for the lookup table. Moreover, it is possible to further reduce the memory capacity by deciding the block according to the output data change state. Moreover, when some of the output data at each section is made representative information while the other data is made relative information, it is possible to further reduce the memory capacity if the difference between the relative information and the representative information is smaller than the number of bits required for the relative information.