Breadth-first maximum likelihood sequence detection: basics

IEEE Transactions on Communications

Volumn 47, Issue 2, 1999, Pages 208-216

  Aulin, Tor M ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; RECURSIVE FUNCTIONS; SIGNAL TO NOISE RATIO; TRELLIS CODES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; MAXIMUM LIKELIHOOD SEQUENCE DETECTION; VECTOR EUCLIDEAN DISTANCE; VITERBI ALGORITHM;

SIGNAL DETECTION;

EID: 0032653082     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.752126     Document Type: Article

References (31)

1. G. D. Forney, Jr. "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
2. J. K. Omura "Optimum receiver design for convolutional codes and channels with memory via control theoretical concepts," Inform. Sei., vol. 3, pp. 243-266, 1971.
3. J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965.
4. F. Jelinek A fast sequential decoding algorithm using a stack," IBM J. Res. Develop., vol. 13, pp. 675-685 Nov. 1969.
5. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Rockville, MD: Computer Sei. Press, 1978.
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. T. Aulin Breadth first maximum likelihood sequence detection," Chalmers Univ. Technol., Comput. Eng., Telecommun. Theory, Göteborg, Sweden, Oct. 1992, Tech. Rep., Apr. 1992.
8. F. L. Vermeulen Low complexity decoders for channels with intersymbol interference," Ph.D. dissertation, Dep. Elect. Eng., Stanford Univ., Aug. 1975.
9. F. L. Vermeulen and M. E. Hellman Reduced state Viterbi decoders for channels with intersymbol interference,' in IEEE Int. Conf. Communications Conf. Rec. ICC'74, Minneapolis, MM, June 1974,
10. R. R. Anderson and G. J. Foschini The minimum distance for MLSE digital data systems of limited complexity," IEEE Trans. Inform. Theory, vol. IT-21, pp. 544-551, Sept. 1975.
11. S. J. Simmons and P. H. Wittke Low complexity decoders for constant envelope digital modulations," IEEE Trans. Commun., vol. COM-31, pp. 1273-1280, Dec. 1983
12. T. Aulin Study of a new trellis decoding algorithm and its applications," Final Rep., ESTEC Contract 6039/84/NL/DG, European Space Agency, Noordwijk, The Netherlands, Dec. 1985.
13. A fractional Viterbi-type trellis decoding algorithm," in IEEE Int. Symp. Information Theory, ISIT'86, Ann Arbor, MI, Oct. 6-9, 1986, Abstracts of Papers, p. 41.
14. T. Hashimoto A list-type reduced-constraint generalization of the Viterbi algorithm," IEEE Trans. Inform. Theory, vol. IT-33, pp. 866-876, Nov. 1987.
15. M. V. Eyuboglu and S. U. Qureshi Reduced-state sequence estimation with set partitioning and decision feedback," IEEE Trans. Commun., vol. 36, pp. 13-20, Jan. 1988.
16. A. Duel-Hallen and C. Heegard Delayed decision-feedback sequence estimation," IEEE Trans. Commun., vol. 37, pp. 428136, May 1989.
17. P. R. Chevillât and E. Eleftheriou Decoding of trellis-encoded signals in the presence of intersymbol interference and noise," IEEE Trans. Commun., vol. 37, pp. 669-676, July 1989.
18. J. B. Anderson Limited search trellis decoding of convolutional codes," IEEE Trans. Inform. Theory, vol. IT-35, pp. 944-955, Sept. 1989.
19. T. Larsson A trellis partitioning technique for reduced-state sequence detection," in IEEE Int. Symp. Information Theory, ISIT'90, San Diego, CA, Jan. 14-19, 1990, p. 22.
20. S. J. Simmons Breadth-first trellis decoding with adaptive effort," IEEE Trans. Commun., vol. 38, pp. 3-12, Jan. 1990.
21. T. Aulin An efficiency evaluation of different simplified sequence detection algorithms," Tech. Rep. no. 106, Dept. Telecommun. Theory, Chalmers Univ. Technol., Göteborg, Sweden, Mar. 1991.
22. T. Larsson and T. Aulin Structural optimization of reduced-state detectors for trellis coded modulation," in Proc. IEEE Int. Symp. Inform. a Theory, ISIT'9I, Budapest, Hungary, June 24-28, 1991, p. 147.
23. T. Aulin Asymptotically optimal joint channel equalization, demodulation and channel decoding with minimal complexity and delay," in Proc. 5th Tirrenia Int. Workshop on Digital Communications, Coded Modulation and Bandwidth-Efficient Transmission, Tirrenia, Pisa, Italy, Sept. 8-12, 1991, pp. 42336.
24. T. Larsson A state-space partitioning approach to trellis decoding," Ph.D. dissertation, Chalmers Univ. Technol., Göteborg, Sweden, Dec. 5, 1991.
25. T. Aulin Application of the SA(B) detection algorithm to coded-PSK modulation," Final Report, ESTEC Contract 7108/87/NL/PR, European Space Agency, Noordwijk, The Netherlands, Dec. 1991.
26. T. Larsson Optimal design of CPM decoders based on state-space partitioning," in Proc. IEEE Int. Conf. Communications, ICC'93, Geneva, Switzerland, May 1993, pp. 123-127.
27. T. Aulin Optimal trellis decoding at given complexity," in Proc. IEEE Int. Symp. Information Theory, ISIT'93, San Antonio, TX, Jan. 17-22, 1993, p. 272.
28. T. Aulin and C.-E. Sundberg Continuous phase modulation, Part I: Full response signaling," IEEE Trans. Commun., vol. COM-29, pp. 196-209, Mar. 1981.
29. T. Aulin, N. Rydbeck, and C.-E. Sundberg Continuous phase modulation, Part II: Partial response signaling," IEEE Trans. Commun., vol. COM-29, pp. 210-225, Mar. 1981.
30. N. Seshadri and C.-E. Sundberg List Viterbi decoding algorithms with applications," IEEE Trans. Commun., vol. 42, pp. 313-323, Feb./Mar./Apr. 1994.
31. K. R. Narayanan and G. L. Stüber List decoding of turbo codes," IEEE Trans. Commun., vol. 46, pp. 754-762, June 1998.