摘要: 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. shown exhibit an error-rate versus average-computational-complexity behavior that much superior the Viterbi and also improves on M-algorithm. maintains variable number paths as its computation adapts channel noise actually encountered. Buffering received samples required support this. Bounds are evaluated by search produced error event rate average survivors. Performance with conventional binary convolutional codes over both binary-synchronous-communication (BSC) additive-white-Gaussian-noise (AWGN) channels. found multilevel AM phase-shift-keying (PSK) simple intersymbol interference responses AWGN channel. At lower signal-to-noise ratio Monte Carlo simulations used improve bounds investigate decoder dynamics. >
harvard.edu
sci-hub.se 参考文章(13)
Tor Aulin, Carl-Erik Sundberg, John B. Anderson, Digital Phase Modulation ,(1986)
Andrew J. Viterbi, James K. Omura, Principles of digital communication and coding ,(1979)
S.J. Simmons, A nonsorting VLSI structure for implementing the (M, L) algorithm IEEE Journal on Selected Areas in Communications. ,vol. 6, pp. 538- 546 ,(1988) , 10.1109/49.1922
K. Matis, J. Modestino, Reduced-search soft-decision trellis coding of linear block codes (Corresp.) IEEE Transactions on Information Theory. ,vol. 28, pp. 349- 355 ,(1982) , 10.1109/TIT.1982.1056468
J. Massey, Variable-length codes and the Fano metric IEEE Transactions on Information Theory. ,vol. 18, pp. 196- 198 ,(1972) , 10.1109/TIT.1972.1054750
S. Simmons, P. Wittke, Low Complexity Decoders for Constant Envelope Digital Modulations IEEE Transactions on Communications. ,vol. 31, pp. 1273- 1280 ,(1983) , 10.1109/TCOM.1983.1095778
G. Foschini, A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios IEEE Transactions on Information Theory. ,vol. 23, pp. 605- 609 ,(1977) , 10.1109/TIT.1977.1055770
G.D. Forney, The viterbi algorithm Proceedings of the IEEE. ,vol. 61, pp. 268- 278 ,(1973) , 10.1109/PROC.1973.9030
E. Zehavi, J. Wolf, On the performance evaluation of trellis codes IEEE Transactions on Information Theory. ,vol. 33, pp. 196- 202 ,(1987) , 10.1109/TIT.1987.1057292
J. Anderson, S. Mohan, Sequential Coding Algorithms: A Survey and Cost Analysis IEEE Transactions on Communications. ,vol. 32, pp. 169- 176 ,(1984) , 10.1109/TCOM.1984.1096023