Survivor memory reduction in the viterbi algorithm

IEEE Communications Letters

Volumn 9, Issue 4, 2005, Pages 352-354

  Abbasfar, Aliazam ^a   Yao, Kung ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Convolutional code; Survivor memory; Trace back method; Viterbi algorithm

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; DECODING; DIGITAL COMMUNICATION SYSTEMS; ERROR CORRECTION; PROBABILITY;

SURVIVOR MEMORY; TRACE BACK METHOD; VITERBI ALGORITHM;

ENCODING (SYMBOLS);

EID: 17744372282     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2005.1413631     Document Type: Article

References (6)

1. A. J. Viterbi, "Error bounds for convolutional coding and asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. 13, pp. 260-269, Apr. 1967.
2. A. J. Omura, "On the Viterbi decoding algorithm," IEEE Trans. Inform. Theory, vol. 15, pp. 177-179, Jan. 1969.
3. G. D. Forney, "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
4. C. Rader, "Memory management in a Viterbi decoder," IEEE Trans. Commun., vol. 29, pp. 1399-1401, Sept. 1981.
5. R. Cypher and B. Shung, "Generalized trace-back techniques for survivor memory management in the Viterbi algorithm," IEEE Globecom, vol. 2, Dec. 1990, pp. 1318-1322.
6. G. Feygin and P.G. Gulak, "Architectural tradeoffs for survivor sequence memory management in Viterbi decoders," IEEE Trans. Commun. vol. 41, pp. 425-429, Mar. 1993.