CN101546531B - Gamma lookup table storage method - Google Patents
Gamma lookup table storage method Download PDFInfo
- Publication number
- CN101546531B CN101546531B CN2008100663540A CN200810066354A CN101546531B CN 101546531 B CN101546531 B CN 101546531B CN 2008100663540 A CN2008100663540 A CN 2008100663540A CN 200810066354 A CN200810066354 A CN 200810066354A CN 101546531 B CN101546531 B CN 101546531B
- Authority
- CN
- China
- Prior art keywords
- stored
- address
- byte
- bit0
- place
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Picture Signal Circuits (AREA)
Abstract
The invention provides a gamma lookup table storage method. Gamma value of which a digit is 1, 2, 3 or 4 is stored in a four-bit mode; gamma value of which a digit is 5 or 6 is stored in a six-bit mode; gamma value of which a digit is 7 or 8 is stored in an eight-bit mode; and gamma value of which a digit is 9 or 10 is stored in a ten-bit mode. The gamma lookup table storage method can effectively save storage space of a memory.
Description
Technical field
The present invention relates to a kind of gamma lookup table storage method.
Background technology
In order to improve the display effect of liquid crystal indicator, gamma correction is a kind of widely used method.Realize gamma correction, gamma lookup table is indispensable.
See also Fig. 1, it is a kind of synoptic diagram of traditional gamma lookup table storage scheme.In this gamma lookup table, no matter each gamma value is actual for how many positions (Bit), all is the form storage with 10.For example: low eight bit0 (1)～bit7 (1) of the 1st gamma value is stored in respectively among the bit0 to bit7 that the address is 0 byte (Byte), and its Senior Two position bit8 (1), bit9 (1) are stored in respectively among the bit0 and bit1 that the address is 4 byte; Low eight bit0 (2)～bit7 (2) of the 2nd gamma value is stored in respectively among the bit0 to bit7 that the address is 1 byte, and its Senior Two position bit8 (2), bit9 (2) are stored in respectively among the bit2 and bit3 that the address is 4 byte; Low eight bit0 (3)～bit7 (3) of the 3rd gamma value is stored in respectively among the bit0 to bit7 that the address is 2 byte, and its Senior Two position bit8 (3), bit9 (3) are stored in respectively among the bit4 and bit5 that the address is 4 byte; Low eight bit0 (4)～bit7 (4) of the 4th gamma value is stored in respectively among the bit0 to bit7 that the address is 3 byte, and its Senior Two position bit8 (4), bit9 (4) are stored in respectively among the bit6 and bit7 that the address is 4 byte.Promptly to be stored in the address be that 4 gamma values take 5 bytes of memory spaces in 0 to 4 the byte for the 1st to the 4th gamma value.The 5th to the 256th gamma value storage means can the rest may be inferred, therefore 256 gamma values take 320 bytes of memory spaces.
For considering of cost, industry wishes that it is in the internal memory of 1024 bytes that gamma lookup table and OSD parameter are kept at a capacity together.The OSD parameter need take about 180 bytes of memory spaces, so the residual memory space of this internal memory is 844 bytes.In liquid crystal indicator, gamma lookup table has three, and corresponding respectively red, green and blue, each look-up table all needs to take 320 bytes of memory spaces, and therefore 3 gamma lookup tables need take 960 bytes of memory spaces.Therefore this internal memory can't be stored this 3 gamma lookup tables and OSD parameter simultaneously.
Summary of the invention
Gamma lookup table takies the bigger problem of storage space in the prior art in order to solve, and the invention provides a kind of gamma lookup table storage method that can reduce storage space.
A kind of gamma lookup table storage method, wherein, figure place is 1,2,3 or 4 gamma value with 4 form storage; Figure place is 5 or 6 gamma value with 6 form storage; Figure place is 7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
A kind of gamma lookup table storage method, its binary numeral figure place according to gamma value is carried out classification and storage, and storage format is to be standard with the maximum gamma value of each class median.
Compared with prior art, gamma lookup table storage method of the present invention is stored according to the difference classification of the binary numeral figure place of gamma value, thereby has effectively saved the storage space of internal memory.
Description of drawings
Fig. 1 is a kind of synoptic diagram of traditional gamma lookup table storage scheme.
Fig. 2 is the synoptic diagram of gamma lookup table storage scheme of the present invention.
Fig. 3 is the coding process flow diagram of gamma lookup table storage scheme of the present invention.
Fig. 4 is the process flow diagram that calculates K1, K2, K3 and K4 among Fig. 3.
Fig. 5 is the decoding process figure of gamma lookup table storage scheme of the present invention.
Embodiment
See also Fig. 2, it is the synoptic diagram of gamma lookup table storage scheme of the present invention.Adopt the original gamma lookup table of gamma lookup table storage method of the present invention need satisfy following relation: figure place is that 1,2,3 or 4 gamma value is K1 (K1=2k, k is a natural number) individual, figure place is that 5 or 6 gamma value is K2 (K2=4m, m is a natural number) individual, figure place is that 7 or 8 gamma value is that K3 (K3=n, n are natural number) is individual, and figure place is that 9 or 10 gamma value is K4 (K4=4t, t is a natural number) individual, and K4/4+K3+K2/4+K1/2+4≤280.K1, K2, it is (being the M0 block) in 0 to 3 the byte that the binary numeral of K3 and K4 is stored in the address respectively, concrete storage format is: the binary numeral bit0 (K1) of K1～bit7 (K1) is stored among the bit0 to bit7 that the address is 0 byte, the binary numeral bit0 (K2) of K2～bit7 (K2) is stored among the bit0 to bit7 that the address is 1 byte, the binary numeral bit0 (K3) of K3～bit7 (K3) is stored among the bit0 to bit7 that the address is 2 byte, and the binary numeral bit0 (K4) of K4～bit7 (K4) is stored among the bit0 to bit7 that the address is 3 byte.
Figure place is 1,2,3 or 4 gamma value all is that to be stored in the address with 4 form be in 4 to K1/2+3 the byte (being the M1 block), concrete storage format is: the 1st number bit0 (1)～bit3 (1) is stored among the bit0 to bit3 that the address is 4 byte, the 2nd number bit0 (2)～bit3 (2) is stored among the bit4 to bit7 that the address is 4 byte, the 3rd number bit0 (3)～bit3 (3) is stored among the bit0 to bit3 that the address is 5 byte, the 4th number bit0 (4)～bit3 (4) is stored among the bit4 to bit7 that the address is 5 byte, the 5th to the K1 number storage format can the rest may be inferred.
Figure place is that 5 or 6 gamma value all is that 6 form is stored in (being the M2 block) in the byte that the address is K1/2+4 to K2/4+K1/2+3, and concrete storage format is: the 1st number bit0 (1)～bit5 (1) is stored among the bit0 to bit5 of byte that the address is K1/2+4; The 2nd number bit0 (2)～bit5 (2) is stored among the bit0 to bit5 of byte that the address is K1/2+5; The 3rd number bit0 (3)～bit5 (3) is stored among the bit0 to bit5 of byte that the address is K1/2+6; Low two bit0 (4), the bit1 (4) of the 4th number are stored among bit6, the bit7 that the address is the byte of K1/2+4, two bit2 (4), bit3 (4) are stored among bit6, the bit7 that the address is the byte of K1/2+5 in the middle of it, and its Senior Two position bit4 (4), bit5 (4) are stored among bit6, the bit7 that the address is the byte of K 1/2+6; The 5th to the K2 number storage format can the rest may be inferred.
Figure place is that 7 or 8 gamma value all is to be stored in (being the M3 block) in the byte that the address is K2/4+K1/2+4 to K3+K2/4+K1/2+3 with 8 form, concrete storage format is: the 1st number bit0 (1)～bit7 (1) is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+4, the 2nd number bit0 (2)～bit7 (2) is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+5, the 3rd number bit0 (3)～bit7 (3) is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+6, the 4th number bit0 (4)～bit7 (4) is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+7, the 5th to the K3 number storage format can the rest may be inferred.
Figure place is that 9 or 10 gamma value all is to be stored in (being the M4 block) in the byte that the address is K3+K2/4+K1/2+4 to K4/4+K3+K2/4+K1/2+3 with 10 form, concrete storage format is: low eight bit0 (1)～bit7 (1) of the 1st number is stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+4, and its Senior Two position bit8 (1), bit9 (1) are stored among the bit0 and bit1 of byte that the address is K3+K2/4+K1/2+8; Low eight bit0 (2)～bit7 (2) of the 2nd number is stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+5, and its Senior Two position bit8 (2), bit9 (2) are stored among the bit2 and bit3 of byte that the address is K3+K2/4+K1/2+8; Low eight bit0 (3)～bit7 (3) of the 3rd number is stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+6, and its Senior Two position bit8 (3), bit9 (3) are stored among the bit4 and bit5 of byte that the address is K3+K2/4+K1/2+8; Low eight bit0 (4)～bit7 (4) of the 4th number is stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+7, and its Senior Two position bit8 (4), bit9 (4) are stored among the bit6 and bit7 of byte that the address is K3+K2/4+K1/2+8; The 5th to the K4 number storage format can the rest may be inferred.
See also Fig. 3, it is the coding process flow diagram of gamma lookup table storage scheme of the present invention.This coding flow process may further comprise the steps:
Step S0: beginning.
Step S1: calculating K 1, K2, K3 and K4.
The idiographic flow of calculating K 1, K2, K3 and K4 as shown in Figure 4.
Step S2: the binary numeral of K1, K2, K3 and K4 is deposited in the M0 block.
Earlier K1, K2, K3 and K4 are converted to binary number, storage according to the following rules then: the binary numeral bit0 (K1) of K1～bit7 (K1) is stored among the bit0 to bit7 that the address is 0 byte, the binary numeral bit0 (K2) of K2～bit7 (K2) is stored among the bit0 to bit7 that the address is 1 byte, the binary numeral bit0 (K3) of K3～bit7 (K3) is stored among the bit0 to bit7 that the address is 2 byte, and the binary numeral bit0 (K4) of K4～bit7 (K4) is stored among the bit0 to bit7 that the address is 3 byte.
Step S3: according to the regular number of bits of M1 block stores data is that 1,2,3 or 4 gamma value is encoded.
Step S4: with figure place is that 1,2,3 or 4 gamma value deposits in the M1 block.
Step S5: according to the regular number of bits of M2 block stores data is that 5 or 6 gamma value is encoded.
Step S6: with figure place is that 5 or 6 gamma value deposits in the M2 block.
Step S7: according to the regular number of bits of M3 block stores data is that 7 or 8 gamma value is encoded.
Step S8: with figure place is that 7 or 8 gamma value deposits in the M3 block.
Step S9: according to the regular number of bits of M4 block stores data is that 9 or 10 gamma value is encoded.
Step S10: with figure place is that 9 or 10 gamma value deposits in the M4 block.
Step S11: finish.
See also Fig. 4, it is the process flow diagram that calculates K1, K2, K3 and K4 among Fig. 3.This calculation process may further comprise the steps:
Step S101: initializing variable i makes i=0.
Step S102: judge Gamma (i)≤16? if, execution in step S103; If not, execution in step S107.
Step S103: judge MOD ((i+1)/2)=0? if, execution in step S104; If not, execution in step S105.
Step S104:K1=i+1.
Step S105: make i add 1.
Step S106: judge i≤255? if, execution in step S102; If not, execution in step S107.
Step S107:i=K1+1.
Step S108: judge Gamma (i)≤64? if, execution in step S109; If not, execution in step S113.
Step S109: judge MOD ((i+1-K1)/4)=0? if, execution in step S110; If not, execution in step S111.
Step S110:K2=i+1-K1.
Step S111: make i add 1.
Step S112: judge i≤255? if, execution in step S108; If not, execution in step S113.
Step S113:i=255.
Step S114: judge Gamma (i)≤256? if, execution in step S115; If not, execution in step S116.
Step S115: judge MOD ((i+1)/4)=0? if, execution in step S118a; If not, execution in step S116.
Step S116: make i subtract 1.
Step S117: judge i≤0? if, execution in step S118; If not, execution in step S114.
Step S118:K4=0, execution in step S119 then.
Step S118a:K4=255-i+1, execution in step S119 then.
Step S119:K3=256-K1-K2-K4.
Step S120: finish.
See also Fig. 5, it is the decoding process figure of gamma lookup table storage scheme of the present invention.This decoding flow process may further comprise the steps:
Step S0: beginning.
Step S1: initializing variable i makes i=0.
Step S2: read K1, promptly read address in the internal memory and be the data in 0 the byte.
Step S3: the address realm that calculates the M1 block.
Step S4: according to the coding rule translation data of M1 block.
Step S5: make i add 1.
Step S6: judge i＜K1/2+4? if, execution in step S4; If not, execution in step S7.
Step S7: the address realm that calculates the M2 block.
Step S8: according to the coding rule translation data of M2 block.
Step S9: make i add 1.
Step S10: judge i＜K2/4+K1/2+4? if, execution in step S8; If not, execution in step S11.
Step S11: the address realm that calculates the M3 block.
Step S12: according to the coding rule translation data of M3 block.
Step S13: make i add 1.
Step S14: judge i＜K3+K2/4+K1/2+4? if, execution in step S12; If not, execution in step S15.
Step S15: the address realm that calculates the M4 block.
Step S16: according to the coding rule translation data of M4 block.
Step S17: make i add 1.
Step S18: judge i＜K4/4+K3+K2/4+K1/2+4? if, execution in step S16; If not, execution in step S19.
Step S19: judge whether gamma standard into appointment? if, execution in step S20; If not, execution in step S21.
Step S20: carry out the gamma standard handovers and calculate, then execution in step S21.
Step S21: in the gamma lookup table of correspondence, search.
Step S22: proofread and correct output.
Step S23: finish.
Compared with prior art, gamma lookup table storage method of the present invention is stored according to the difference classification of the binary numeral figure place of gamma value, thereby has effectively saved the storage space of internal memory.And the total memory capacity of each gamma lookup table is not more than 280 bytes, thus the present invention these 3 gamma lookup tables and OSD parameter can be kept at a capacity together be in the internal memory of 1024 bytes, thereby reach cost-effective purpose.
It is described that gamma lookup table storage method of the present invention is not limited to above-mentioned embodiment to the classification and storage of gamma value, and numerous embodiments can be arranged, and lifts two examples below again and describe.
Figure place is 1,2,3,4,5,6,7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
Figure place is 1 or 2 gamma value with 2 form storage; Figure place is 3 or 4 gamma value with 4 form storage; Figure place is 5 or 6 gamma value with 6 form storage; Figure place is 7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
In a word, when gamma value was carried out classification and storage, storage format was to be standard with the maximum gamma value of each class median.
Claims (8)
1. gamma lookup table storage method is characterized in that: figure place is 1,2,3 or 4 gamma value with 4 form storage; Figure place is 5 or 6 gamma value with 6 form storage; Figure place is 7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
2. gamma lookup table storage method as claimed in claim 1 is characterized in that: figure place is that 1,2,3 or 4 gamma value is K1, and K1=2k, k are natural number; Figure place is that 5 or 6 gamma value is K2, and K2=4m, m are natural number; Figure place is that 7 or 8 gamma value is K3, and K3=n, n are natural number; Figure place is that 9 or 10 gamma value is K4, and K4=4t, t are natural number; K1, K2, K3 and K4 satisfy: K4/4+K3+K2/4+K1/2+4≤280.
3. gamma lookup table storage method as claimed in claim 1 is characterized in that: it is in 0 to 3 the byte that the binary numeral of K1, K2, K3 and K4 is stored in the address respectively; Figure place is that 1,2,3 or 4 gamma value is stored in the byte that the address is 4 to K 1/2+3; Figure place is that 5 or 6 gamma value is stored in the byte that the address is K1/2+4 to K2/4+K 1/2+3; Figure place is that 7 or 8 gamma value is stored in the byte that the address is K2/4+K1/2+4 to K3+K2/4+K1/2+3; Figure place is that 9 or 10 gamma value is stored in the byte that the address is K3+K2/4+K1/2+4 to K4/4+K3+K2/4+K1/2+3.
4. gamma lookup table storage method as claimed in claim 1, it is characterized in that: the storage format of the binary numeral of K1, K2, K3 and K4 is: the binary numeral of K1 is stored among the bit0 to bit7 that the address is 0 byte, the binary numeral of K2 is stored among the bit0 to bit7 that the address is 1 byte, the binary numeral of K3 is stored among the bit0 to bit7 that the address is 2 byte, and the binary numeral of K4 is stored among the bit0 to bit7 that the address is 3 byte; Figure place is that the storage format of 1,2,3 or 4 gamma value is: the 1st number is stored among the bit0 to bit3 that the address is 4 byte, the 2nd number is stored among the bit4 to bit7 that the address is 4 byte, the 3rd number is stored among the bit0 to bit3 that the address is 5 byte, the 4th number is stored among the bit4 to bit7 that the address is 5 byte, the 5th to the storage format of K1 number the rest may be inferred; Figure place is that the storage format of 5 or 6 gamma value is: the 1st number is stored among the bit0 to bit5 of byte that the address is K1/2+4, the 2nd number is stored among the bit0 to bit5 of byte that the address is K1/2+5, the 3rd number is stored among the bit0 to bit5 of byte that the address is K1/2+6, low two of the 4th number are stored in the bit6 that the address is the byte of K 1/2+4, among the bit7, two are stored in the bit6 that the address is the byte of K1/2+5 in the middle of it, among the bit7, its Senior Two position is stored in the bit6 that the address is the byte of K1/2+6, among the bit7, the 5th to the K2 number storage format can the rest may be inferred; Figure place is that the storage format of 7 or 8 gamma value is: the 1st number is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+4, the 2nd number is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+5, the 3rd number is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+6, the 4th number is stored among the bit0 to bit7 of byte that the address is K2/4+K1/2+7, the 5th to the storage format of K3 number the rest may be inferred; Figure place is that the storage format of 9 or 10 gamma value is: low eight of the 1st number are stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+4, its Senior Two position is stored among the bit0 and bit1 of byte that the address is K3+K2/4+K1/2+8, low eight of the 2nd number are stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+5, its Senior Two position is stored among the bit2 and bit3 of byte that the address is K3+K2/4+K1/2+8, low eight of the 3rd number are stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+6, its Senior Two position is stored among the bit4 and bit5 of byte that the address is K3+K2/4+K1/2+8, low eight of the 4th number are stored among the bit0 to bit7 of byte that the address is K3+K2/4+K1/2+7, its Senior Two position is stored among the bit6 and bit7 of byte that the address is K3+K2/4+K1/2+8, the 5th to the storage format of K4 number the rest may be inferred.
5. gamma lookup table storage method, it is characterized in that: the binary numeral figure place according to gamma value is carried out classification and storage, and storage format is to be standard with the maximum gamma value of each class median.
6. gamma lookup table storage method as claimed in claim 5 is characterized in that: figure place is 1,2,3 or 4 gamma value with 4 form storage; Figure place is 5 or 6 gamma value with 6 form storage; Figure place is 7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
7. gamma lookup table storage method as claimed in claim 5 is characterized in that: figure place is 1,2,3,4,5,6,7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
8. gamma lookup table storage method as claimed in claim 5 is characterized in that: figure place is 1 or 2 gamma value with 2 form storage; Figure place is 3 or 4 gamma value with 4 form storage; Figure place is 5 or 6 gamma value with 6 form storage; Figure place is 7 or 8 gamma value with 8 form storage; Figure place is 9 or 10 gamma value with 10 form storage.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100663540A CN101546531B (en) | 2008-03-28 | 2008-03-28 | Gamma lookup table storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100663540A CN101546531B (en) | 2008-03-28 | 2008-03-28 | Gamma lookup table storage method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101546531A CN101546531A (en) | 2009-09-30 |
| CN101546531B true CN101546531B (en) | 2011-12-07 |
Family
ID=41193627
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100663540A Expired - Fee Related CN101546531B (en) | 2008-03-28 | 2008-03-28 | Gamma lookup table storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101546531B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102411616B (en) * | 2011-10-28 | 2014-11-19 | 北京地拓科技发展有限公司 | Method and system for storing data and data management method |
| CN104464623B (en) * | 2014-12-05 | 2017-06-20 | 西安诺瓦电子科技有限公司 | A kind of method and device for adjusting the low GTG of light emitting diode |
| CN111222306A (en) * | 2020-01-06 | 2020-06-02 | 广州虎牙科技有限公司 | Data processing method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1763825A (en) * | 2004-10-22 | 2006-04-26 | 三星电子株式会社 | Display device and drive unit thereof |
| CN1889694A (en) * | 2006-07-14 | 2007-01-03 | 华为技术有限公司 | Gamma correcting method, circuit and video-frequency processor |
-
2008
- 2008-03-28 CN CN2008100663540A patent/CN101546531B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1763825A (en) * | 2004-10-22 | 2006-04-26 | 三星电子株式会社 | Display device and drive unit thereof |
| CN1889694A (en) * | 2006-07-14 | 2007-01-03 | 华为技术有限公司 | Gamma correcting method, circuit and video-frequency processor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101546531A (en) | 2009-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101546531B (en) | Gamma lookup table storage method | |
| US20170230061A1 (en) | Interleaving and mapping method and deinterleaving and demapping method for ldpc codeword | |
| US20080273804A1 (en) | Image Transformation | |
| CN102244784B (en) | Method for compressing and displaying picture including transparent information | |
| CN105574572A (en) | Color quick response code and generation method thereof | |
| CN109740023A (en) | Sparse matrix compression storage method based on bidirectional bitmap | |
| CN110048727A (en) | The Polar code encoding method of any code length | |
| CN103348675A (en) | 2d signal encoding device | |
| CN109660527A (en) | A kind of compression transmitting method of printer data | |
| EP2782413A1 (en) | Traffic indicator map encoding method and beacon frame | |
| CN105281777A (en) | Compression method of remote controller learning data, system and remote controller | |
| CN101546530B (en) | Gamma lookup table storage method | |
| CN103428502B (en) | Decoding method and decoding system | |
| CN104918049A (en) | Binary arithmetic coding module suitable for HEVC (high efficiency video coding) standards | |
| JP5022954B2 (en) | Filter device and digital broadcast receiving device | |
| CN103024122B (en) | A kind of storage means by mobile terminal memory mobile phone number and mobile terminal | |
| CN101093998B (en) | Decoding method and device | |
| US9872035B2 (en) | System and method for transcoding data | |
| TWI393089B (en) | Method of storing gamma look-up table | |
| TW200939198A (en) | Method for storing gamma look-up table | |
| CN104021579A (en) | Method and device for changing colors of image | |
| CN100507944C (en) | Image format conversion method, image processing method and system | |
| CN102064916B (en) | CMMB standard-based byte interleaving method | |
| CN110290391A (en) | A kind of Exp- Golomb coding/decoding method, system and electronic equipment and storage medium | |
| CN102456327A (en) | Encoding and decoding method, device and system based on LVDS (Low Voltage Differential Signaling) interface |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111207 Termination date: 20210328 |