By Topic

New path history management circuits for Viterbi decoders

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ming-Bo Lin ; Dept. of Electron. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan

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.

Published in:

IEEE Transactions on Communications  (Volume:48 ,  Issue: 10 )