Bidirectional breadth-first algorithms for the decoding of convolutional codes

  title={Bidirectional breadth-first algorithms for the decoding of convolutional codes},
  author={Jean Belzile and David Haccoun},
  journal={IEEE Trans. Communications},
New bidirectional multiple-path tree searching algorithms for the decoding of convolutional codes are presented. These suboptimal decoding algorithms use a multiple-path breadth-first bidirectional tree exploration procedure and longmemory (v > 20) convolutional codes. Compared to the usual M-algorithm, we show that the bidirectional exploration considerably reduces the bit error propagation due to correct path loss. Computer simulations using rate 1 /2 codes over binary symmetric channels have… CONTINUE READING
12 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 12 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

p.177. Jean Belzile (S’89) received the B.Sc (CS) degree from the University of New Brunswick, N B., Canada in 1987, and the M.Sc.A

  • Theory, CA San Diego, Jan
  • Ecole Polytechnique de MontrCal,
  • 1990

Ai - algorithm decoding of channel convolutional codes

  • J. B. Anderson, C. F. Lin
  • 1986


  • June
  • Belzile, “Algorithmes et architectures de…
  • 1986


  • NJ Princeton, Mar.
  • Johannesson and E. Paaske, “Further results on…
  • 1986

A Japanese translation of the hook

  • York Wiley
  • He was Treasurer of the 1983 IEEE International…
  • 1981

Information Theory and Reliable Communication

  • R. Gallager
  • New York: Wiley,
  • 1968

Fast sequential decoding algorithm using a stack,

  • F. Jelinek
  • vol. IT-9,
  • 1963

Instrumental tree encoding of information sources

  • J. B. Anderson
  • IEEE Trans . Inform . Theory

Similar Papers

Loading similar papers…