Title
Design space exploration of hard-decision Viterbi decoding: algorithm and VLSI implementation
Abstract
Viterbi algorithm is widely used as a decoding technique for convolutional codes as well as a bit detection method in storage devices. The design space for VLSI implementation of Viterbi decoders is huge, involving choices of throughput, latency, area, and power. Even for a fixed set of parameters like constraint length, encoder polynomials and trace-back depth, the task of designing a Viterbi decoder is quite complex and requires significant effort. Sometimes, due to incomplete design space exploration or incorrect analysis, a suboptimal design is chosen. This work analyzes the design complexity by applying most of the known VLSI implementation techniques for hard-decision Viterbi decoding to a different set of code parameters. The conclusions are based on real designs for which actual synthesis and layouts were obtained. In authors' view, due to the depth covered, it is the most comprehensive analysis of the topic published so far.
Year
DOI
Venue
2010
10.1109/TVLSI.2009.2017024
VLSI) Systems, IEEE Transactions
Keywords
Field
DocType
design complexity,hard-decision viterbi,design space,real design,hard-decision viterbi decoding,suboptimal design,vlsi implementation technique,viterbi algorithm,incomplete design space exploration,vlsi implementation,viterbi decoder,viterbi decoding,convolutional codes,very large scale integration,vlsi,convolutional code,shift registers,decoding,difference set,space technology,polynomials,algorithm design and analysis,space exploration,cmos technology,vlsi design
Convolutional code,Sequential decoding,Algorithm design,Soft output Viterbi algorithm,Computer science,Algorithm,Electronic engineering,Viterbi decoder,Very-large-scale integration,Design space exploration,Viterbi algorithm
Journal
Volume
Issue
ISSN
18
5
1063-8210
Citations 
PageRank 
References 
9
0.68
23
Authors
3
Name
Order
Citations
PageRank
Irfan Habib1445.85
Özgün Paker2141.48
Sergei Sawitzki3325.79