Algebraic Survivor Memory Management Design for Viterbi Detectors

IEEE Transactions on Communications

Volumn 43, Issue 9, 1995, Pages 2458-2463

  Fettweis, Gerhard ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

SURVIVOR MEMORY MANAGEMENT; VITERBI DETECTORS;

SIGNAL DETECTION;

EID: 0029376071     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.412720     Document Type: Article

References (15)

1. R. E. Bellman and S. E. Dreyfus, Applied Dynamic Programming. Princeton, NJ: Princeton University Press, 1962.
2. A. J. Omura, “On the Viterbi algorithm,” IEEE Trans. Inform. Theory, pp. 177–179, Jan. 1969.
3. A. J. Viterbi, “Error bounds for convolutional coding and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
4. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, Mar. 1973, vol. 61, pp. 268–278.
5. G. Fettweis, “Algebraic survivor memory management for Viterbi detectors,” IEEE Int. Conf. Commun. (ICC'92), Chicago, IL, June 1992, pp. 313. 4.1–313.4.5.
6. C. M. Rader, “Memory management in a Viterbi decoder,” IEEE Trans. Commun., vol. COM-29, pp. 1399–1401, Sept. 1981.
7. R. Cypher and B. Shung, “Generalized trace back techniques for survivor memory management in the Viterbi algorithm,” in IEEE GLOBECOM, San Diego, CA, Dec. 1990, vol. 2, pp. 1318–1322 (707A.1).
8. G. Feugin and P. G. Gulak, “Survivor memory management in Viterbi decoders,” IEEE Trans. Commun., vol. 39, 1991.
9. T. K. Truong, M.-T. Shih, I. S. Reed, and E. H. Satorius, “A VLSI design for a trace-back Viterbi decoder,” IEEE Trans. Commun., vol. 40, pp. 616–624, Mar. 1992.
10. G. Fettweis, L. Thiele, and H. Meyr, “Algorithm transformations for unlimited parallelism,” in Proc. IEEE Int. Symp. Circuits and Syst., New Orleans, LA, May 1990, vol. 2, pp. 1756–1759.
11. K. K. Parhi and D. G. Messerschmidt, “Block digital filtering via incremental block-state-structures,” in Proc. IEEE Int. Symp. Circuits and Syst., Philadelphia, PA, 1987, pp. 645–648.
12. K. K. Parhi and D. G. Messerschmidt, “Pipelined VLSI recursive composition,” in Proc. IEEE Int. Conf. Acoust., Speech and Signal Processing, New York, 1988, pp. 2120–2123.
13. L. Thiele and G. Fettweis, “Algorithm transformations for unlimited parallelism,” Electron, and Commun. (AEÜ), vol. 2, pp. 83–91, Apr. 1990.
14. G. Fettweis and H. Meyr, “High-speed Viterbi processor: A systolic array solution,” IEEE J. Select. Areas Commun., vol. 8 pp. 1520–1534, Oct. 1990.
15. G. Fettweis and H. Meyr, “High-speed parallel Viterbi decoding,” IEEE Commun. Mag., pp. 46–55, May 1991.