• DocumentCode
    883071
  • Title

    Condensed table of Huffman coding, a new approach to efficient decoding

  • Author

    Hashemian, Reza

  • Author_Institution
    Dept. of Electr. Eng., Northern Illinois Univ., DeKalb, IL, USA
  • Volume
    52
  • Issue
    1
  • fYear
    2004
  • Firstpage
    6
  • Lastpage
    8
  • Abstract
    This letter introduces a new technique for designing and decoding Huffman codes. The key idea is to define a condensed Huffman table (CHT) that is smaller than the ordinary Huffman table and which leads to fast decoding. For example, the new approach has been shown to reduce the memory consumption by a factor of eight, compared with the single-side grown Huffman table.
  • Keywords
    Huffman codes; decoding; variable length codes; Huffman coding; code design; condensed Huffman table; efficient decoding; fast decoding; memory consumption; Added delay; Binary trees; Data compression; Decoding; Encoding; Entropy; Huffman coding; Information theory; Life members; Tree data structures;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2003.822145
  • Filename
    1264185