New path history management circuits for Viterbi decoders

Up until now the trace back technique and the register-exchange approaches are two major techniques used for the path history management in the chip designs of Viterbi decoders. The former takes up less area but requires much more time than the latter, since it needs to search the trace of the survi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2000-10, Vol.48 (10), p.1605-1608
Main Author: Lin, Ming-Bo
Format: Article
Language:English
Subjects:
Chip scale packaging
Circuits
Convolutional codes
Costs
Decoding
Delay
History
Management
Networks
Permutations
Registers
Routing
Stores
Viterbi algorithm
Viterbi decoders
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Up until now the trace back technique and the register-exchange approaches are two major techniques used for the path history management in the chip designs of Viterbi decoders. The former takes up less area but requires much more time than the latter, since it needs to search the trace of the survivor path back sequentially. We propose an alternate approach that is based on the concept of a permutation network and implements directly the trellis diagram of a given convolutional code. Instead of using registers to store the survivor path data, all information is recorded in a permutation network, and the resulting circuit has a smaller routing area than the register-exchange technique and has faster decoding speed than the trace-back method regardless of the constraint length. In addition, it is more straightforward to realize the permutation networks path history unit than the trace-forward unit.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.871381