High throughput reconstruction of Huffman-coded images
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The Huffman code is an efficient noiseless coding method for images, video, and other applications. For applications in graphic computers, high-definition televisions (HDTV), and optical fiber networks, Huffman-coded images need to be reconstructed at a high throughput rate. Due to the recursion within the reconstruction algorithm, the achievable throughput rate in a given IC technology is limited by the iteration bound. Methods of relaxing the iteration bound of the reconstruction process, thus increasing the concurrency in the decoding process, are proposed. These methods are simple, effective, and flexible. Unlimited concurrency can be achieved at the expense of additional latency. The incurred overhead is very low, and the complexity increases only linearly with the achieved throughput improvement.Keywords
This publication has 3 references indexed in Scilit:
- Improving the iteration bound of finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms and architectures for concurrent Viterbi decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Concurrent cellular VLSI adaptive filter architecturesIEEE Transactions on Circuits and Systems, 1987