Optimum Soft-Output Detection for Channels with Intersymbol Interference

IEEE Transactions on Information Theory

Volumn 41, Issue 3, 1995, Pages 704-713

  Sato, Yoichi ^b   Vucetic, Branka ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

^b TOHO UNIVERSITY   (Japan)

Author keywords

equalization; soft decision decoding; Soft output detection; Viterbi algorithm

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONVOLUTIONAL CODES; DETECTORS; INTERSYMBOL INTERFERENCE; PROBABILITY; WHITE NOISE;

CHANNEL MEMORY; EQUALIZATION; SOFT DECISION DECODING; SOFT OUTPUT DETECTION; VITERBI ALGORITHMS;

SIGNAL DETECTION;

EID: 0029308612     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.382016     Document Type: Article

References (30)

1. G. Ungerboeck, “Adaptive maximum-likelihood receiver for carrier-modulated data-transmission systems,” IEEE Trans. Commun., vol. COM-22, no. 5, pp. 624–636, May 1974.
2. G. D. Forney, Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, no. 3, pp. 363–378, May 1972.
3. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, no. 2, pp. 260–269, Apr. 1967.
4. J. A. Heller and I. M. Jacobs, “Viterbi decoding for satellite and space communication,” IEEE Trans. Commun., vol. COM-19, no. 5, pp. 835–848, Oct. 1971.
5. J. Hagenauer, “Viterbi decoding of convolutional codes for fading- and burst-channels,” in Proc. Zurich Seminar on Digital Communication, Mar. 1980, pp. G2.1–G2.7.
6. G. D. Forney, Jr., “The Viterbi algorithm,” Proc. IEEE, vol. 61, no. 3, pp. 268–278, Mar. 1973.
7. R. W. Chang and J. C. Hancock, “On receiver structures for channels having memory,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 463–468, Oct. 1966.
8. K. Abend and B. D. Fritchman, “Statistical detection for communication channels with intersymbol interference,” Proc. IEEE, vol. 58, no. 5, pp. 779–785, May 1970.
9. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, Mar. 1974.
10. J. Raviv, “Decision making in Markov chains applied to the problem of pattern recognition,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 536–551, Oct. 1967.
11. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
12. W. Koch and A. Baier, “Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference,” in Proc. Globecom '90 (San Diego, CA, Dec. 1990), pp. 1679–1684.
13. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: M.I.T. Press, 1966.
14. L. Lee, “Concatenated coding systems employing a unit-memory convolutional code and a byte-oriented decoding algorithm,” IEEE Trans. Commun., vol. COM-25, no. 10, pp. 1064–1074, Oct. 1977.
15. B. Vucetic, “Bandwidth efficient concatenated coding schemes for fading channels,” IEEE Trans. Commun., vol. 41, no. 1, pp. 50–61, Jan. 1993.
16. J. Hagenauer, E. Offer, and L. Papke, “Improving the standard coding system for deep space missions,” in Proc. ICC'93 (Geneva, Switzerland, May 1993), pp. 1092–1097.
17. P. Hoeher, “TCM on frequency-selective fading channels: A comparison of soft-output probabilistic equalizers,” in Proc. Globecom '90 (San Diego, CA, Dec. 1990), pp. 401.4.1–401.4.6.
18. R. H. Deng and D. J. Costello, Jr., “High rate concatenated coding systems using bandwidth efficient trellis inner codes,” IEEE Trans. Commun., vol. 37, no. 5, pp. 420–427, May 1989.
19. T. Schaub and J. W. Modestino, “An erasure declaring Viterbi decoder and its applications to concatenated coding systems,” in Proc. ICC'86 (Toronto, Ont., Canada, June 1986), pp. 1612–1616.
20. N. Seshadri and C-E. W. Sundberg, “Generalized Viterbi algorithms for error detection with convolutional codes,” in Proc. Globecom '89 (Dallas, TX, Nov. 1981), vol. 3, pp. 43.3.1–43.3.5.
21. H. Yamamoto and K. Itoh, “Viterbi decoding algorithm for convolutional codes with repeat request,” IEEE Trans. Inform. Theory, vol. IT-26, no. 5, pp. 540–547, Sept. 1980.
22. T. Hashimoto, “A list-type reduced-constraint generalization of the Viterbi algorithm,” IEEE Trans. Inform. Theory, vol. IT-33, no. 6, pp 866–876, Nov. 1987.
23. J. Hagenauer and P. Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” in Proc. Globecom '89 (Dallas, TX, Nov. 1989), vol. 3, pp. 47.1.1–47.1.7.
24. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes(1),” in Proc. ICC'93 (Geneva, Switzerland, May 1993), pp. 1064–1070.
25. J. G. Proakis, Digital Communications, 2nd ed. Singapore: McGraw-Hill, 1989.
26. J. L. Massey, “The how and why of channel coding,” in Proc. Zurich Seminar on Digital Communication, Mar. 1984, pp. 67–73.
27. K. J. Larsen, “Short convolutional codes with maximal free distance for rates 1/2, 1/3 and 1/4,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 371–372, May 1973.
28. IS-54, “Dual-Mode Mobile Station—Base Station Compatibility Standard,” EIA/TIA PN 2215.
29. IS-55, “Recommended Minimum Performance Standards for 800 MHz Dual-Mode Mobile Stations,” EIA/TIA PN 2216.
30. IS-56, “Recommended Minimum Performance Standards for 800 MHz Base Stations Supporting Dual-Mode Mobile Stations,” EIA/TIA PN 2217.