Close category search window
 

A generalised design technique for traceback survivor memory management in 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
$31 $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

2 Author(s)

There are number of algorithms available for the design of traceback survivor memory units in Viterbi (1967) decoders. Perhaps the best description of the traceback algorithms was given by Feygin et al. (1993), where four separate algorithms were presented. These four algorithms, however, can all be encapsulated in the description of two broader algorithms. In addition a new implementation technique is presented for one family of algorithms. As a result a host of new, low complexity implementations of survivor memory units become possible

Published in:
Communications and Signal Processing, 1997. COMSIG '97., Proceedings of the 1997 South African Symposium on

Date of Conference: 9-10 Sep 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.