Breadth-first maximum likelihood sequence detection: basics
作者： T.M. Aulin
DOI: 10.1109/26.752126
关键词:
摘要: The problem of performing breadth-first maximum likelihood sequence detection (MLSD) under given structural and complexity constraints is solved results in a family optimal detectors. Given trellis with S states, these are partitioned into C classes where B paths each class selected recursively symbol interval. derived result to retain only those which closest the received signal Euclidean (Hamming) distance sense. Each member SA(B, C) detectors (SA denotes search algorithm) performs constrained MLSD for additive white Gaussian noise (AWGN) (BSC) channel. unconstrained solution Viterbi algorithm (VA). Analysis tools developed asymptotic (SNR) probability losing correct path associated new measure AWGN case, vector (VED). traditional scalar special case this, termed (SED). generality this VED pointed out. Some general reductions exemplify VA approach.
sci-hub.se 参考文章(23)
Torbjörn Larsson, A state-space partitioning approach to trellis decoding Chalmers University of Technology. ,(1991)
Sartaj Sahni, Ellis Horowitz, Fundamentals of Computer Algorithms ,(1983)
I. M. Jacobs, J. M. Wozencraft, Principles of Communication Engineering ,(1965)
T. Aulin, Optimal Trellis Decoding at Given Complexity international symposium on information theory. pp. 272- 272 ,(1993) , 10.1109/ISIT.1993.748586
A. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm IEEE Transactions on Information Theory. ,vol. 13, pp. 260- 269 ,(1967) , 10.1109/TIT.1967.1054010
F. Jelinek, Fast sequential decoding algorithm using a stack Ibm Journal of Research and Development. ,vol. 13, pp. 675- 685 ,(1969) , 10.1147/RD.136.0675
T. Hashimoto, A list-type reduced-constraint generalization of the Viterbi algorithm IEEE Transactions on Information Theory. ,vol. 33, pp. 866- 876 ,(1987) , 10.1109/TIT.1987.1057377
A. Duel-Hallen, C. Heegard, Delayed decision-feedback sequence estimation IEEE Transactions on Communications. ,vol. 37, pp. 428- 436 ,(1989) , 10.1109/26.24594
K.R. Narayanan, G.L. Stuber, List decoding of turbo codes IEEE Transactions on Communications. ,vol. 46, pp. 754- 762 ,(1998) , 10.1109/26.681410
J.B. Anderson, Limited search trellis decoding of convolutional codes IEEE Transactions on Information Theory. ,vol. 35, pp. 944- 955 ,(1989) , 10.1109/18.42212