High-Speed VLSI Architectures for Huffman and Viterbi Decoders

Research output: Contribution to journalArticle

24 Citations (Scopus)

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 - Jan 1 1992

Fingerprint

Hardware
Parallel architectures
Communication systems
Decomposition

Cite this

@article{9d6303f6d3c64e70837dde857b8abed9,
title = "High-Speed VLSI Architectures for Huffman and Viterbi Decoders",
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.",
author = "Parhi, {Keshab K}",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/82.145297",
language = "English (US)",
volume = "39",
pages = "385--391",
journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - High-Speed VLSI Architectures for Huffman and Viterbi Decoders

AU - Parhi, Keshab K

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026877653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026877653&partnerID=8YFLogxK

U2 - 10.1109/82.145297

DO - 10.1109/82.145297

M3 - Article

VL - 39

SP - 385

EP - 391

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1549-8328

IS - 6

ER -