Breadth-first trellis decoding with adaptive effort

A breadth-first trellis decoding algorithm is introduced for application to sequence estimation in digital data transmission. The high degree of inherent parallelism makes a parallel-processing implementation attractive. The algorithm is shown to exhibit an error-rate versus average-computational-complexity behavior that is much superior to the Viterbi algorithm and also improves on the M-algorithm. The decoding algorithm maintains a variable number of paths as its computation adapts to the channel noise actually encountered. Buffering of received samples is required to support this. Bounds that are evaluated by trellis search are produced for the error event rate and average number of survivors. Performance is evaluated with conventional binary convolutional codes over both binary-synchronous-communication (BSC) and additive-white-Gaussian-noise (AWGN) channels. Performance is also found for multilevel AM and phase-shift-keying (PSK) codes and simple intersymbol interference responses over an AWGN channel. At lower signal-to-noise ratio Monte Carlo simulations are used to improve on the bounds and to investigate decoder dynamics. >

[1]  Stanley J. Simmons.  A nonsorting VLSI structure for implementing the (M, L ) algorithm , 1988, IEEE J. Sel. Areas Commun..

[2]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[3]  Gerard J. Foschini,et al.  A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios , 1977, IEEE Trans. Inf. Theory.

[4]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[5]  P. Glenn Gulak,et al.  VLSI Structures for Viterbi Receivers: Part I-General Theory and Applications , 1986, IEEE J. Sel. Areas Commun..

[6]  S. J. Simmons,et al.  Low Complexity Decoders for Constant Envelope Digital Modulations , 1983, IEEE Trans. Commun..

[7]  James L. Massey.  Variable-length codes and the Fano metric , 1972, IEEE Trans. Inf. Theory.

[8]  Jack K. Wolf,et al.  On the performance evaluation of trellis codes , 1987, IEEE Trans. Inf. Theory.

[9]  J. Modestino,et al.  Reduced-search soft-decision trellis coding of linear block codes , 1982, IEEE Trans. Inf. Theory.

[10]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[11]  John B. Anderson,et al.  Sequential Coding Algorithms , 1991 .

[12]  Arun K. Sood,et al.  A Multiprocessor Architecture for the (M, L)-Algorithm Suitable for VLSI Implementation , 1986, IEEE Trans. Commun..

[13]  Tor Aulin,et al.  Digital Phase Modulation , 1986, Applications of Communications Theory.