An efficient Huffman decoding method based on pattern partition and look-up table

5th Asia-Pacific Conference Communications and 4th Optoloelectronics Communications Conference: The Conference-Vitality to New Century, APCC/OECC 1999

Volumn 2, Issue , 1998, Pages 904-907

  Jiang, Ji Han ^a   Chang, Chin Chen ^a   Chen, Tung Shou ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; DISTANCE MEASUREMENT; FORESTRY; MOBILE DEVICES;

BIT PATTERNS; CODE-WORDS; HUFFMAN DECODING; HUFFMAN TREES; LOOK UP TABLE; PATTERN PARTITION; SUBTREES;

TABLE LOOKUP;

EID: 33744798069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APCC.1999.820409     Document Type: Conference Paper

References (7)

1. T. C. Bell, J. G. Cleary, and I. H. Witten, Text CompressidH, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. S. B. Choi and M. H..Lee, "High-Speed Pattern Matching for a Fast Huffman Decoder," IEEE Transactions on Consumer Electronics, VOL.41, No. 1, Feb. 1995, pp. 97-103.
3. R. Hashemian, "Memory Efficient and High-speed Search Huffman Coding," IEEE Transactions on Communications, Vo1.43, No. 10
4. D. A. Huffman, "A Method for the Construction of Minimum Redundancy Codes," Proc. IRE, Vol. 40, No. 10, Sept. 1952, pp. 1098-1101.
5. A. K. Jain, "Image Data Compression: A Review," Proc. IEEE. Vol. 69, NO. 3, Mar. 1981, pp. 349-389.
6. M. Kawahara, Y. J. Chiu, and T. Berger, "High-speed Software Implementation of Huffman Coding," Proceedings of rhe Datu Compression Conference '98, Mar. 1998, p. 553.
7. A. Siegel, "On Universal Classes of Fast High Performance Hash Functions, Their Time-space Tradeoff, and Their Applications," Proceedings of IEEE 36Ih Annual Foundations of Computer Science, Oct. 1995, pp. 2576-2581. NC, USA, 1989, pp. 20-25.