Share Email Print

Proceedings Paper

Concurrent Viterbi Algorithm With Trace-Back
Author(s): Fabrizio Pollara
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

It is shown how the Viterbi algorithm and the Fast Fourier Transform can be described in terms of the same graph topology and different algebraic kernels. This similarity is exploited to show how a network of 2n processors, interconnected as an n-dimensional cube and with no shared memory, can be efficiently used to implement a concurrent Viterbi algorithm. The modularity of this approach allows the decoding of large constraint length codes with multi-chip VLSI systems operating at different degrees of parallelism. The interprocessor communication overhead is minimized by using the trace-back method, which completely avoids any survivor exchange or any global memory operation. Results are presented on the efficiency achieved for codes with constraint length up to 15 on a general purpose hypercube computer, and comparisons are made with other parallel architectures.

Paper Details

Date Published: 4 April 1986
PDF: 6 pages
Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986);
Show Author Affiliations
Fabrizio Pollara, California Institute of Technology (United States)

Published in SPIE Proceedings Vol. 0696:
Advanced Algorithms and Architectures for Signal Processing I
Jeffrey M. Speiser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?