Architectural tradeoffs for survivor sequence memory management in Viterbi decoders

In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1993-03, Vol.41 (3), p.425-429
Main Authors: Feygin, G., Gulak, P.
Format: Article
Language:English
Subjects:
Applied sciences
Coding, codes
Decoding
Delay
Design methodology
Energy consumption
Exact sciences and technology
Information retrieval
Information, signal and communications theory
Memory management
Read-write memory
Registers
Signal and communications theory
Telecommunications and information theory
Very large scale integration
Viterbi algorithm
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:In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency, and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders. A new, one-pointer traceback method is shown to be better than previously known traceback methods.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.221067