| 摘要 |
<P>PROBLEM TO BE SOLVED: To accelerate LUT data writing for LUT (look up table) formation and to reduce the required data amount of an LUT. <P>SOLUTION: The number (a) of bits constituting data Di to be converted is defined as a=b+c, c is defined as the number of low-order bits (c≥1), and d is defined as the number of high-order bits (b≥1). A b-bit is defined as address data, and in each address, an LUT in which each converted data Dm[7: 0] of 2<SP>C</SP>data Di[7: 0] to be converted, wherein a high-order b-bit Di[7: 1] indicates the same value. When performing data conversion, 2<SP>C</SP>converted data of an address indicated by the high-order b-bit Di[7: 1] of converted data = input data Di[7: 0] is read from the LUT, and one piece of converted data designated by a low-order c-bit Di[0] of the input data Di in the read converted data is selectively outputted. Otherwise, storage data of one address are defined as converted data of ≥1 and differential data of ≥1, and the read differential data is restored to converted data. <P>COPYRIGHT: (C)2006,JPO&NCIPI |
