Bidirectional Breadth-First Algorithms for the Decoding of Convolutional Codes

IEEE Transactions on Communications

Volumn 41, Issue 2, 1993, Pages 370-380

  Belzile, Jean ^a   Haccoun, David ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; PROBABILITY; TREES (MATHEMATICS);

BIDIRECTIONAL ALGORITHMS; BREADTH-FIRST ALGORITHMS; CODE MEMORY; CONVOLUTIONAL CODES; TREE SEARCHING; VITERBI DECODERS;

CODES (SYMBOLS);

EID: 0027545735     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.216512     Document Type: Article

References (18)

1. V.K. Bhargava, D. Haccoun, R. Matyas, and P.P. Nuspl, Digital Communications by Satellite. New York: Wiley, 1981.
2. W. Wu, D. Haccoun, R. Peile, and Y. Hirata, “Coding for satellite communication,” IEEE J. Select. Areas Commun., vol. SAC-5, pp. 724–748, 1987.
3. A.J. Viterbi, “Convolutional codes and their performance on communication systems,” IEEE Trans. Commun., vol. COM-19, pp. 751–772, Oct. 1971.
4. R. Fano, “A heuristic discussion of probabilistic decoding,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 64–74, Apr. 1963.
5. F. Jelinek, “Fast sequential decoding algorithm using a stack,” IBM J. Res. Develop., vol. 13, pp. 675–685, Nov. 1969.
6. A.J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
7. K.S. Zigangirov, “Some sequential decoding procedures,” Problemy Peredachi Informatsii, vol. 2, no. 4, pp. 13–25, 1966.
8. D. Haccoun and M. Ferguson, “Generalized stack algorithms for decoding convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 638–651, Nov. 1975.
9. F. Jelinek and J.B. Anderson, “Instrumental tree encoding of information sources,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 118–119, Jan. 1971.
10. C. Lin, “A truncated Viterbi algorithm approach to trellis codes,” Ph.D. dissertation, Dep. ECSE, Rensselaer Polytechnic Inst., Troy, NY, Sept. 1986.
11. S.J. Simmons, “A reduced-computation trellis decoder with inherent parallelism,” Ph.D. dissertation, Queen's Univ., Kingston, Ont., Canada, June 1986.
12. J. Belzile, “Algorithmes et architectures de décodeur séquentiel,” Master's thesis, École Polytechnique, Montréal, P.Q., Canada, Aug. 1990.
13. M. Chalifoux, M. Nguyen, S. Thiffault, J. Belzile, Y. Savaria, and D. Haccoun, “VLSI design of a bit serial parallel processing 4 extender chip for.M-path convolutional decoding,” in CCECE/CCGEI, Sept. 1991.
14. J.B. Anderson and C.F. Lin, “M-algorithm decoding of channel convolutional codes,” in Conf. Proc, 20th Annu. Conf. Inform. Sci. Syst., Princeton, NJ, Mar. 1986.
15. R. Johannesson and E. Paaske, “Further results on binary convolutional codes with an optimum distance profile,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 264–268, Mar. 1978.
16. R. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
17. J. Belzile and D. Haccoun, “Complete path weight distribution of convolutional codes,” Tech. Rep., EPM/RT-91/10, Ecole Polytechnique de Montréal, Canada, May 1991.
18. D. Haccoun and J. Belzile, “Bidirectional algorithms for the decoding of convolutional codes,” Book of Abstracts IEEE Int. Symp. Inform. Theory, San Diego, CA, Jan. 1990, p. 177.