High-Speed VLSI Architectures for Huffman and Viterbi Decoders

Research output: Contribution to journalArticle

24 Scopus citations

Abstract

This paper presents pipelined and parallel architectures for high-speed implementation of Huffman and Viterbi decoders (both of which belong to the class of tree-based decoders). Huffman decoders are used for lossless compression. The Viterbi decoder is commonly used in communications systems. The achievable speed in these decoders is Inherently limited due to their sequential nature of computation. This speed limitation is overcome using our previously proposed technique of look-ahead computation. The incremental computation technique is used to obtain efficient parallel (or block) implementations. The decomposition technique is exploited to reduce the hardware complexity in pipelined Viterbi decoders, but not in Huffman decoders. Logic minimization is used to reduce the hardware overhead complexity in pipelined Huffman decoders.

Original languageEnglish (US)
Pages (from-to)385-391
Number of pages7
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume39
Issue number6
DOIs
StatePublished - Jun 1992

Fingerprint Dive into the research topics of 'High-Speed VLSI Architectures for Huffman and Viterbi Decoders'. Together they form a unique fingerprint.

  • Cite this