TW200939198A - Method for storing gamma look-up table - Google Patents

Abstract

The present invention relates to a method for storing gamma look-up table. A storing format is as follows: gamma values which have 1 bit, 2 bits, 3 bits, or 4 bits are stored in 4 bits; gamma values which have 5 bits or 6 bits are stored in 6 bits; gamma values which have 7 bits or 8 bits are stored in 8 bits; gamma values which have 9 bits or 10 bits are stored in 10 bits.

Description

200939198. Nine, invention description: [Technical field to which the invention pertains] The present invention relates to a method for storing a gamma lookup table. [Prior Art] In order to improve the display effect of the liquid crystal display device, the gamma correction is a widely used method. To achieve the correction of the horse, the Jamaican lookup table is indispensable. Please refer to Figure 1' for a schematic diagram of a conventional gamma lookup table storage scheme. In the gamma lookup table, no matter how many bits (bits) each gamma value actually has, it is stored in the form of 10 bits. For example, the lower eight bits of the i-th gamma value bitO(l)~bit7(l) are stored in bitO to bit7 of the byte of the address 〇, respectively, and the upper two bits bit8(l), bit9( l) Stored in bitO and bitl of the byte with address 4 respectively; the lower eight bits of bit 2 (bit 2) to bit 7 (2) of the second gamma value are stored in the bit of address byte 1. • In bit7, the upper two bits of bit8(2) and bit9(2) are stored in bits 2 and 3 of the address of address 4; the lower eight bits of the third added value are bit0(3) to bit7 ( 3) Stored in bit 〇 to bit 7 of the byte of address 2, respectively, and bit 2 (8) and bit 9 (3) of bit 2 are stored in bit 4 and bit 5 of the byte of address 4; The lower eight bits of the gamma value 〇(4)~bit7(4) are stored in the 〇 to Mt7 of the byte of the address 3, respectively, and the upper two bits bU8(4) and Mt9(4) are respectively stored in Bh6 and middle of the byte of address 4. That is, the first to fourth gamma values are stored in the byte of address 0 to 4, and the four gamma values occupy the storage space of 5 bytes. The 5th to 200939198 256th gamma storage method can be deduced by analogy, so 256 gamma ‘values occupy 32 位 bytes of storage space. • For cost considerations, the industry wants to store the Gamma lookup table and OSD parameters in a memory of 1〇24 bytes. The 〇SD parameter needs to occupy about 180 bytes of storage space, so the remaining storage space of the memory is 844 bits. In the liquid crystal display device, there are three gamma lookup tables, respectively corresponding to red, green and blue, and each lookup table & two takes up 320 bytes of storage space, so three gamma lookup tables ^ occupy 960 bits The storage space of the tuple. Therefore, the memory cannot simultaneously have the three gamma lookup tables and the 〇SD parameters. [Summary of the Invention] The lookup table saves the health side = need to provide a Jiamao 3 or 4 & /, - lookup table storage method that can reduce the storage space, wherein the number of bits is 1, 2 ^ 4 plus The horse value is stored in the form of 4 bits; the gamma value is stored as a 6-bit report 彳am called von 5 or a value; the number of bits is 7 or 8 plus. Value storage; number of bits Stored in the form of 9:10 digits. 』加马值j

The value phase narration of the gamma lookup table storage method 'is categorized according to the gamma-to-push, the number of bits, and the storage format is the maximum value of the gamma I value. In the class, the 凄 horse value ratio, the storage method of the gamma lookup table of the present invention has a painful memory storage space.仃Storage, thus effective section 200939198 [Embodiment] ^ Please refer to FIG. 2, which is a schematic diagram of the storage scheme of the gamma lookup table of the present invention. The original gamma lookup table using the gamma lookup table storage method of the present invention needs to satisfy the following relationship: the gamma value of the number of bits of 1, 2, 3 or 4 is Kl (Kl=2k, k is a natural number), The gamma value of the number of bits 5 or 6 is K2 (K2=4m, m is a natural number), and the gamma value of the number of bits 7 or 8 is Κ3 (Κ3=η, η is a natural number) The gamma value of the number of bits 9 or 10 is K4 (K4=4t, t is a natural number), and 〇K4/4+K3+K2/4+K1/2+4S280. The binary values of ΚΙ, K2, K3, and K4 are stored in the byte of address 0 to 3 (ie, M0 block). The specific storage format is: K1 binary value bitO(Kl)~bit7(Kl) is stored in In bit 0 to bit 7 of the byte of address 0, the binary value bitO(K2) to bit7(K2) of K2 is stored in bitO to bit7 of the byte of address 1, and the binary value bitO(K3) of K3~ Bit 7 (K3) is stored in bit 0 to bit 7 of the byte of address 2, and the binary value bitO (K4) to bit 7 (K4) of K4 are stored in bit 0 to bit 7 of the byte of address 3. The gamma value with the number of bits 1, 2, 3 or 4 is stored in the form of 4 bits in the byte of address 4 to K1/2 + 3 (ie, M1 block), the specific storage format For example, the first digits bitO(l) to bit3(l) are stored in bitO to bit3 of the byte of address 4, and the second digits 〇(2) to bit3(2) are stored at address 4. In bit 4 to bit 7 of the byte, the third bit 0 (3) to bit 3 (3) are stored in bit 〇 to bit 3 of the byte of address 5, and the fourth number bit 0 (4) to bit 3 (4) Stored in bits 4 to 7 of the byte of address 5, the storage format of the 5th to K1th numbers can be deduced by analogy. 200939198 The gamma value with 5 or 6 bits is stored in 6-bit form * in the byte with address K1/2+4 to K2/4+K1/2+3 (ie M2 area) Block), the specific storage format is: the first number bitO(l)~bit5(l) is stored in bitO to bit5 of the byte of address K1/2+4; the second number bit0(2)~bit5 (2) Stored in bitO to bit5 of the byte of address K1/2+5; the third number bit0(3)~bit5(3) is stored in bitO of the byte of address K1/2+6 To bit5; the lower two bits of bit 4 (4) and bitl (4) of the fourth number are stored in bits 6 and 7 of the byte of address K1/2+4, and the middle two bits bit 2 (4), Bit3 (4) is stored in bit 6 and bit 7 of the byte of address K1/2+5. 'The upper two bits of bit 4 (4) and bit 5 (4) are stored in bit 6 of the bit of address K1/2+6. , bit7; the storage format of the 5th to K2th numbers can be deduced by analogy. The gamma values of the number of bits 7 or 8 are stored in the form of octets in the byte of address K2/4+K1/2+4 to K3 + K2/4+K1/2+3. (ie, M3 block), the specific storage format is: the first number of bits 〇(1)~bit7(1) are stored in bitO to bit7 of the byte of address K2/4 + K1/2+4, The second number bit0(2) to bit7(2) are stored in bitO to bit7 of the byte of address Κ2/4 + Κ1/2+5, and the third number bit0(3) to bit7(3) are stored. At address is

In bit 0 to bit 7 of the K2/4+K1/2+6 byte, the 4th bit 0(4) to bit7(4) are stored in the byte of the address K2/4+K1/2+7. In bitO to bit 7, the storage format of the 5th to K3th numbers can be deduced by analogy. The gamma value of the number of bits 9 or 1 存储 is stored in the form of a bit at the address K3+K2/4+K1/2+4 to K4/4+K3+K2/4+K1/2+ 3 bytes (ie M4 block), the specific storage format is: the [number of low 200939198 octet bitO (l) ~ bit7 (l) stored at the address is K3 + K2 / 4 + K1/2 + In the bit-to-bit 7 of the bit-group of 4, the upper two bits bit8(l) and bit9(l) are stored in bitO and bitl of the byte of the address K3+K2/4+K1/2+8; The lower eight bits of the two digits bit0(2)~bit7(2) are stored in bitO to bit7 of the byte at address K3+K2/4+K1/2+5, and the upper two bits are bit8(2), bit9 (2) Stored in bit 2 and bit 3 of the byte of address K3+K2/4+K1/2 + 8; the lower eight bits of bit 3 (3) to bit 7 (3) of the third number are stored at address K3 In bitO to bit7 of the +K2/4+K1/2+6 byte, the upper two bits 〇bit8(3) and bit9(3) are stored in the address of K3+K2/4 + K1/2+8. In the bit 4 and bit 5 of the tuple; the lower eight bits of the fourth number bit 0 (4) to bit 7 (4) are stored in bits 0 to 7 of the byte of the address K3+K2/4+K1/2+7, The upper two bits of bit8(4) and bit9(4) are stored in bits 6 and 7 of the byte of address K3+K2/4+K1/2+8; The storage format of the 5th to K3th numbers can be deduced by analogy. Please refer to FIG. 3, which is a flowchart of the gamma lookup table storage scheme of the present invention. The encoding process includes the following steps: Step S0: Start. Step S1: Calculate κι, K2, K3, and K4. The specific process of calculating ΚΙ, K2, K3 and K4 is shown in Fig. 4. Step S2: The binary values of ΚΙ, K2, K3, and K4 are stored in the M0 block. First convert ΚΙ, K2, K3, and K4 into binary numbers, and then store them according to the following rules: The binary value of K1 bitO(Kl)~bit7(Kl) is stored in bitO to bit7 of the byte with address 0, K2 The binary value 200939198 bitO(K2)~bit7(K2) is stored in bitO to bit7 of the byte of address 1, and the binary value bitO(K3)~bit7(K3) of K3 is stored in the *bit of address 2. In bitO to bit 7, the binary value bitO(K4)~bit7(K4) of K4 is stored in bitO to bit7 of the byte of address 3. Step S3: Encoding the gamma value of the number of bits of 1, 2, 3 or 4 according to the rule of storing data of the M1 block. Step S4: The gamma value of the number of bits 1, 2, 3 or 4 is stored in the Μ1 block. 〇 Step S5: Encoding the gamma value of the number of bits of 5 or 6 according to the rule of storing data of the M2 block. Step S6: The gamma value of the number of bits 5 or 6 is stored in the M2 block. Step S7: The gamma value of the number of bits of 7 or 8 is encoded according to the rule of storing data of the M3 block. Step S8: storing the gamma value of the number of bits 7 or 8 in the M3 block 〇❹ Step S9: encoding the gamma value of the number of bits 9 or 10 according to the rule of storing data of the Μ4 block . Step S10: The gamma value of the number of bits 9 or 10 is stored in the Μ4 block. Step S11: End. Please refer to FIG. 4, which is a flow chart for calculating ΚΙ, Κ2, Κ3, and Κ4 in FIG. The calculation process includes the following steps: Step S101: Initialize the variable i such that i=0. 11 200939198 Step S102: Judging Gamma(i)$16? If yes, go to step 5103; if no, go to step S107. * Step S103: Judge MOD((i+l)/2) = 0? If yes, go to step 5104; if no, go to step S105. Step S104: Kl=i+1. Step S105: Add i to 1. Step S106: Judgment 匕255? If yes, go to step S102; if no, go to step S107. 〇 Step S107: i=Kl + l. Step S108: Judging Gamma(i)S64? If yes, executing step S109; if not, executing step S113. Step S109: judge MOD((i + l-Kl) / 4) = 0? If yes, execute step S110; if no, execute step S111. Step S110: K2=i + 1-Kl. Step S111: Add i to 1. Step S112: Judgment 匕 255 ? If yes, go to step S108; if no, go to step S113. Step S113: i=255. Step S114: Judging Gamma(i)S256? If yes, executing step S115; if not, executing step S116. Step S115: judge MOD ((i + l) / 4) = 0? If yes, go to step S118a; if no, go to step S116. Step S116: Decrease i by 1. Step S117: J0 is judged. If yes, step S118 is performed; if 12200939198 is no, step S114 is performed. Step S118: K4=0, and then step S119 is performed. • Step S118a: K4=255-i+1, and then step S119 is performed. * Step S119: K3 = 256-K1-K2-K4 ° Step S120: End. Please refer to FIG. 5, which is a decoding flowchart of the gamma lookup table storage scheme of the present invention. The decoding process includes the following steps: Step SO: Start. 〇 Step S1: Initialize the variable i so that i=0. Step S2: Reading K1, that is, reading data in a byte of address 0 in the memory. Step S3: Calculate the address range of the M1 block. Step S4: Convert data according to the encoding rule of the M1 block. Step S5: Add i to 1. Step S6: Judging i < Kl / 2 + 4 ? If yes, executing step S4; if _ no, executing step S7. Step S7: Calculate the address range of the M2 block. Step S8: Convert data according to the encoding rule of the M2 block. Step S9: Add i to 1. Step S10: Judging i < K2 / 4 + Kl / 2 + 4 ? If yes, executing step S8; if not, executing step S11. Step S11: Calculate the address range of the M3 block. Step S12: Convert data according to an encoding rule of the M3 block. Step S13: Add i to 1. 13 200939198 Step S14: Judgment i < K3 + K2 / 4 + Kl / 2 + 4 ? If yes, go to step S12; if no, go to step S15. Step S15: Calculate the address range of the M4 block. Step S16: Convert data according to the encoding rule of the M4 block. Step S17: Add i to 1. Step S18: Judging i<K4/4+K3+K2/4+Kl/2+4? If yes, executing step S16; if not, executing step S19. Step S19: Is it determined that the specified standard is added? If yes, go to step S20; if no, go to step S21. Step S20: Perform a gamma standard conversion calculation, and then perform step S21. Step S21: Find in the corresponding gamma lookup table. Step S22: Correct the output. Step S23: End. Compared with the prior art, the gamma lookup table storage method of the present invention stores data according to different classifications of binary value digits of the gamma value, thereby effectively saving the storage space of the memory. And the total storage capacity of each of the gamma lookup tables is ◎ no more than 280 bytes, so the present invention can store the three gamma lookup tables and the OSD parameters together in a memory of 1024 bytes, thereby Achieve cost savings. The classification storage of the gamma value in the gamma lookup table storage method of the present invention is not limited to the above embodiment, and various embodiments are possible, and two more examples will be described below. The gamma value of the number of bits 1, 2, 3, 4, 5, 6, 7, or 8 is stored in the form of 8 bits; the gamma value of the number of bits is 9 or 10 is 10 bits 14 200939198 The form of storage. The number of bits with i or 2 yuan is 3 or 4, and the value is stored as 2 bits; the value of 5 or 6 is stored as 6 bits_bit; The gamma value of the number 8 is stored in the form of octet ^°, the number of bits is 7 or the value of the horse is stored in the form of 10 bits; the total number of bits is 9 or 10.

The horse value is classified and stored, and the gamma value of the largest number of bits in the storage m class is the standard. The invention is in accordance with the invention patent application. However, as described above, (4) the method & output, ... is only a preferred embodiment of the present invention, and the scope of the present month is not limited to the above-mentioned Shen Shi Gu Dao's person + 4 real type Equivalent modifications or variations made by the skilled person in the spirit of the invention are intended to be included within the scope of the following claims. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a schematic diagram of a conventional gamma lookup table storage scheme. Q Figure 2 is a schematic diagram of a storage arrangement of the gamma lookup table of the present invention. 3 is a coding flow diagram of a gamma lookup table storage scheme of the present invention. 4 is a flow chart for calculating ΚΙ, K2, K3, and K4 in FIG. FIG. 5 is a decoding flowchart of the gamma lookup table storage scheme of the present invention. [Main component symbol description] None 15

Claims (1)

200939198 X. Patent application scope 1. A method for storing a gamma lookup table, wherein the gamma value of the number of bits 1, 2, 3 or 4 is stored in the form of 4 bits; the number of bits is 5 or 6 The gamma value is stored in the form of 6 bits; the gamma value of the number of bits 7 or 8 is stored in the form of 8 bits; the gamma value of the number of bits 9 or 10 is in the form of 10 bits. storage. 2. The method for storing a gamma lookup table according to claim 1, wherein the gamma value of the number of bits 1, 2, 3 or 4 is K1, Kl=2k, and k is a natural number; The number of bits with 5 or 6 is K2, K2=4m, m is a natural number; the number of bits with 7 or 8 is K3, and Κ3=η' η is a natural number; The number of bits with a number of 9 or 10 is Κ4, K4=4t, and t is a natural number; ΚΙ, Κ2, Κ3, and Κ4 satisfy: K4/4+K3 + K2/4 + K1/2+4S280 〇 3. The method for storing a gamma lookup table according to item 2 of the patent application scope, wherein binary values of ΚΙ, K2, K3, and K4 are respectively stored in a byte of addresses 0 to 3; the number of bits is The gamma value of 1, 2, 3 or 4 is stored in a byte of address 4 to K1/2+3; the gamma value of the number of bits 5 or 6 is stored at the address K1/2+4 to In the byte of K2/4+K1/2 + 3; the gamma value of the number of bits 7 or 8 is stored at the address K2/4 + K1/2 + 4 to K3+K2/4 + K1/2 +3 bytes; gamma with 9 or 10 bits stored at address K3+K2/4+K1/2+4 to K4/4+K3+K2/4+K1/2+ 3 in the byte. 4. The method for storing a gamma lookup table as described in claim 3, wherein the storage format of the binary values of 'ΚΙ, K2, K3, and K4 is: 16 200939198 The binary value of K1 is stored in the bit with address 0. In the bito to bit7 of the group, the binary value of K2 is stored in bitO to bit7 of the byte of address 1, and the binary value of K3 is stored in bitO to bit7 of the byte of address 2, the binary value of K4 Stored in bitO to bit7 of the byte of address 3. 5. The method for storing a gamma lookup table according to claim 3, wherein the storage format of the gamma value of the number of bits of 1, 2, 3 or 4 is: the first number is stored at the address In bit 0 to bit 3 of the byte of 4, the second number is stored in bit 4 to bit 7 of the byte of address 4, and the third number is stored in bit 0 to bit 3 of the byte of address 5, The fourth number is stored in bits 4 to 7 of the byte of address 5, and the storage format of the 5th to K1th numbers is deduced by analogy. 6. The method for storing a gamma lookup table according to claim 3, wherein the storage format of the gamma having the number of bits of 5 or 6 is: the first number is stored at the address K1/2+ Bits 4 to 5 of the byte of 4; the second number is stored in bit 0 to bit 5 of the byte of address K1/2+5; the third number is stored in the bit of address K1/2+6 The bit 2 to bit 5 of the group; the lower two bits of the fourth number are stored in bits 6 and 7 of the byte of the address K1/2+4, and the middle two bits are stored in the bit of the address K1/2+5. In the bit 6 and bit 7 of the group, the upper two bits are stored in bits 6 and 7 of the bit address K1/2 + 6; the storage format of the 5th to K2th numbers can be deduced by analogy. 7. The method for storing a gamma lookup table according to item 3 of the patent application scope, wherein the storage format of the gamma value of the number of bits of 7 or 8 is: the first 17 200939198 number is stored at the address K2/ In bitO to bit7 of the 4+K1/2+4 byte, the second number is stored in bitO • to bit7 of the bit of address K2/4+K1/2+5, and the third number is stored. In bitO to bit7 of the byte of address K2/4+K1/2+6, the fourth number is stored in bitO to bit7 of the byte of address K2/4+K1/2+7, The storage format of 5 to K3 numbers is the same. 8. The method for storing a gamma lookup table according to item 3 of the patent application scope, wherein the storage format of the gamma value of the number of bits of 9 or 10 is: the lower eight bits of the 1st number are stored at the address In bitO to bit7 of the byte of K3 + K2/4 + K1/2+4, the upper two bits are stored in bitO and bitl of the byte of address K3 + K2/4 + K1/2+8; The lower eight bits of the second number are stored in bitO to bit7 of the byte at address K3+K2/4+K1/2+5, and the upper two bits are stored at the address K3+K2/4+K1/2+ Bits 8 and 3 of the byte of 8; the lower eight bits of the third number are stored in bitO to bit 7 of the byte of address K3 + K2/4 + K1/2+6, and the upper two bits are stored in the address Bits 4 and 〇 bit 5 of the byte of K3+K2/4+K1/2+8; the lower eight bits of the fourth number are stored in the byte of address K3 + K2/4 + K1/2+7 In bitO to bit7, the upper two bits are stored in bits 6 and 7 of the bit address K3+K2/4+K1/2+8; the storage format of the fifth to K3th numbers is equivalent. 9. A method for storing a gamma lookup table, which is classified and stored according to a binary value of a gamma value, and the storage format is a gamma value having the largest number of bits in each class. 10. In the method of storing the gamma lookup table described in claim 9 of the patent application, in 18 200939198, the number of bits is j, 2, 3a, • stored; the number of bits is 5 or 4 The value is in the form of 4 bits. The added gamma value of the number of bits is 7 or 8 is stored in the form of 6 bits. The number of bits is 9 or _ plus horses are stored in the wrong form; bit 11 For example, if you apply for the patent, you will be in the form of a file. In the middle, the number of bits is the storage method of the gamma lookup table, which is stored in the form of Ο8 bits; the gamma value of the bit 2 is 5 2, or 8 is stored in the form of a bit. The gamma value of or 10 is 10 12. As in the patent application ninth, the number of bits is i · 2, the second gamma lookup table storage method, and the brother of 2, the 2 The gamma value of 3 or 4 is stored in the form of =; the gamma value of 5 or 6 is stored in the form of 7°; the gamma value of the 7 or 8 is stored as octet; The number of bits or the gamma of 1〇 stores the number of bits in the form of bits. 19