GB201101178D0 - Huffman code table transform for parallel decoding - Google Patents

Huffman code table transform for parallel decoding

Info

Publication number
GB201101178D0
GB201101178D0 GBGB1101178.0A GB201101178A GB201101178D0 GB 201101178 D0 GB201101178 D0 GB 201101178D0 GB 201101178 A GB201101178 A GB 201101178A GB 201101178 D0 GB201101178 D0 GB 201101178D0
Authority
GB
United Kingdom
Prior art keywords
code table
huffman code
parallel decoding
table transform
transform
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.)
Withdrawn
Application number
GBGB1101178.0A
Other versions
GB2483319A (en
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of GB201101178D0 publication Critical patent/GB201101178D0/en
Publication of GB2483319A publication Critical patent/GB2483319A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4031—Fixed length to variable length coding
    • H03M7/4037—Prefix coding
    • H03M7/4043—Adaptive prefix coding
    • H03M7/4062—Coding table adaptation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • H03M7/425—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory for the decoding process only
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6017—Methods or arrangements to increase the throughput
    • H03M7/6023—Parallelization

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
GB201101178A 2010-08-28 2011-01-24 Huffman decoder using modified Huffman Code Table Withdrawn GB2483319A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GBGB1014347.7A GB201014347D0 (en) 2010-08-28 2010-08-28 Huffman code table transform and parrallel Huffman decoding

Publications (2)

Publication Number Publication Date
GB201101178D0 true GB201101178D0 (en) 2011-03-09
GB2483319A GB2483319A (en) 2012-03-07

Family

ID=43013374

Family Applications (2)

Application Number Title Priority Date Filing Date
GBGB1014347.7A Ceased GB201014347D0 (en) 2010-08-28 2010-08-28 Huffman code table transform and parrallel Huffman decoding
GB201101178A Withdrawn GB2483319A (en) 2010-08-28 2011-01-24 Huffman decoder using modified Huffman Code Table

Family Applications Before (1)

Application Number Title Priority Date Filing Date
GBGB1014347.7A Ceased GB201014347D0 (en) 2010-08-28 2010-08-28 Huffman code table transform and parrallel Huffman decoding

Country Status (1)

Country Link
GB (2) GB201014347D0 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101843087B1 (en) 2012-03-05 2018-03-28 삼성전자주식회사 Apparatus and method for decoding
US9819359B1 (en) * 2016-12-11 2017-11-14 Microsoft Technology Licensing, Llc Multi-symbol, multi-format, parallel symbol decoder for hardware decompression engines

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3565147B2 (en) * 2000-08-07 2004-09-15 日本ビクター株式会社 Decryption device
US6373412B1 (en) * 2000-12-15 2002-04-16 International Business Machines Corporation Fast JPEG huffman encoding and decoding
TWI343192B (en) * 2009-06-12 2011-06-01 Ind Tech Res Inst Decoding method

Also Published As

Publication number Publication date
GB2483319A (en) 2012-03-07
GB201014347D0 (en) 2010-10-13

Similar Documents

Publication Publication Date Title
HRP20171316T8 (en) Apparatus for entropy decoding a transform coefficient
HK1259972A1 (en) Entropy encoding and decoding scheme
SI2600613T1 (en) Intra-prediction decoding device
HUE039299T2 (en) Entropy encoding and decoding scheme
DK2556671T3 (en) Low Complexity CABAC Entropy Encoding / Decoding Method
EP2561680A4 (en) Methods and devices for reordered parallel entropy coding and decoding
GB201222466D0 (en) Decoding of LDPC code
GB201101178D0 (en) Huffman code table transform for parallel decoding
DK3886434T3 (en) Low complexity entropy encoder / decoder

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)