By Topic

Algebraic survivor memory management for Viterbi detectors

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)
Fettweis, G. ; IBM Almaden Res. Center, San Jose, CA, USA

An algebraic formulation of the survivor memory management of Viterbi detectors is introduced. This reveals the fact that the problem of survivor memory implementation is analogous to the realization of look-ahead in parallelized linear feedback loops. Hence, next to finding new solutions, a wide range of solutions can be transferred and adapted from this well-known problem. They mainly present novel approaches for survivor memory realization. VLSI case studies of novel algorithms and architectures have shown that more than 50% savings are possible in hardware complexity as well as power consumption. The algebraic formulation can also lead to simplified software implementation

Published in:

Communications, 1992. ICC '92, Conference record, SUPERCOMM/ICC '92, Discovering a New World of Communications., IEEE International Conference on

Date of Conference:

14-18 Jun 1992