Soft information transfer for sequence detection with concatenated receivers

IEEE Transactions on Communications

Volumn 44, Issue 9, 1996, Pages 1086-1095

  Hansson, Ulf ^a   Aulin, Tor M ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ESTIMATION; HEURISTIC METHODS; PROBABILITY; SIGNAL RECEIVERS; SIGNAL TO NOISE RATIO; STATISTICS;

CASCADED ENCODERS; CONCATENATED CODES; FINITE STATE MACHINES; MAXIMUM LIKELIHOOD SEQUENCE DETECTOR; TRELLIS CODED MODULATION; VITERBI ALGORITHM;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0030244866     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.536915     Document Type: Article

References (22)

1. W. Koch A. Baier Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference Proc. GLOBECOM'90 1679 1684 1990 CA, San Diego 516 3389 116774
2. G. D. Forney Jr. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference IEEE Trans. Inform. Theory IT-18 363 378 May 1972
3. E. Biglieri D. Divsalar P.J. McLane M. K. Simon Introduction to Trellis-Coded Modulation with Applications. 1991 Maxwell Macmillan New York
4. K. J. Larsen Short Convolutional Codes with Maximal Free Distance for Rates 1/2, 1/3, 1/4 IEEE Trans. Inform. Theory IT-19 371 372 May 1973
5. G. D. Forney Jr. The Viterbi agorithm Proc. IEEE 61 3 268 278 Mar. 1973
6. T. M. Aulin Breadth first maximum likelihood sequence detection IEEE Trans. Inform. Theory
7. C. Berrou A. Glavieux P. Thitimajshima Near Shannon limit error-correcting coding and decoding: Turbo-codes (1) Proc. ICC'93 1064 1070 1993 Switzerland, Geneva 3171 8993 397441
8. T. Hashimoto A list-type reduced constraint generalization of the Viterbi algorithm IEEE Trans. Inform. Theory IT-33 866 876 Nov. 1987
9. C. Nill C.-E. Sundberg Viterbi algorithms with list and soft symbol output: Extensions and comparisons Proc. GLOBECOM'93 788 792 1993 TX, Houston 1047 7666 318188
10. J. Hagenauer P. Hoeher J. Huber Soft-output Viterbi and symbol-by-symbol MAP decoding: algorithms and applications IEEE Trans. Commun.
11. P. Hoeher TCM on frequency-selective fading channels: a Comparison of soft-output probabilistic equalizers Proc. GLOBECOM'90 401.4.1 401.4.6 1990 CA, San Diego 516 3389 116540
12. B. Rislo¨w T. Maseng O. Trandem Soft information in concatenated codes Proc. ISIT'91 1991 Hungary, Budapest 557 4025 695354
13. N. Seshadri P. Hoeher On post-decision symbol-reliability generation Proc. ICC'93 741 745 1993 Switzerland, Geneva 3171 8993 397372
14. G. D. Forney Jr. Concatenated Codes. 1966 M.I.T Press MA, Cambridge
15. L. R. Bahl J. Cocke F. Jelinek J. Raviv Optimal decoding of linear codes for minimizing symbol error rate IEEE Trans. Inform. Theory IT-20 284 287 Mar. 1974
16. R. W. Chang J. C. Hancock On receiver structures for channels having memory IEEE Trans. Inform. Theory IT-12 463 468 Oct. 1966
17. K. Abend B. D. Fritchman Statistical detection for communication channels with intersymbol interference Proc. IEEE 58 5 779 785 May 1970
18. J. F. Hayes T. M. Cover J. B. Riera Optimal sequence detection and optimal symbol-by-symbol detection: similar algorithms IEEE Trans. Commun. COM-30 1 152 157 Jan. 1982
19. Y. Li B. Vucetic Y. Sato Optimum soft-output detection for channels with intersymbol interference IEEE Trans. Inform. Theory 41 3 704 713 May 1995 18 8656 382016
20. J. Erfanian S. Pasupathy G. Gulak Reduced complexity symbol detectors with parallel structures for ISI channels IEEE Trans. Commun. 42 2/3/4 1661 1671 Feb./Mar./Apr. 1994 26 12645 582868
21. U. Hansson T. Aulin Theoretical performance evaluation of different soft-output algorithms Proc. ISITA'94 875 880 1994 Australia, Sydney
22. J. M. Wozencraft I. M. Jacobs Principles of Communication Engineering. 1965 Wiley New York