Patent 6023783 Issued on February 8, 2000. Estimated Expiration Date: May 15, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
Several improved turbo code apparatuses and methods. The invention encompasses several classes: (1) A data source is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each encoder outputs a code element which may be transmitted or stored. A parallel decoder provides the ability to decode the code elements to derive the original source information d without use of a received data signal corresponding to d. The output may be coupled to a multilevel trellis-coded modulator (TCM). (2) A data source d is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each of the encoders outputs a code element. In addition, the original data source d is output from the encoder. All of the output elements are coupled to a TCM. (3) At least two data sources are applied to two or more encoders with an interleaver between each source and each of the second and subsequent encoders. The output may be coupled to a TCM. (4) At least two data sources are applied to two or more encoders with at least two interleavers between each source and each of the second and subsequent encoders. (5) At least one data source is applied to one or more serially linked encoders through at least one interleaver. The output may be coupled to a TCM. The invention includes a novel way of terminating a turbo coder.
Other References
Divsalar, D., et al. "Multiple Turbo Codes for Deep-Space Communications", The Telecommunications and Data Acquisition Progress Report 42-121 for NASA and California Institute of Technology Jet Propulsion Laboratory, Joseph H. Yuen, ed., pp. 60-77, May 15, 1995
Divsalar, D., et al. "On the Design of Turbo Codes", The Telecommunications and Data Acquisition Progress Report 42-123 for NASA and California Institute of Technology Jet Propulsion Laboratory, Joseph H. Yuen, ed., pp. 99-121, Nov. 15, 1995
Divsalar, D., et al., "Low-Rate Turbo Codes for Deep Space Communications", Proceedings from the 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, Canada, p. 35, Sep. 17-22, 1995
Divsalar, D., et al., "Turbo Codes for PCS Applications", IEEE ICC '95, Seattle, WA, pp. 54-59, Jun. 1995
Divsalar, D., et al., "Multiple Turbo Codes", MILCOM '95, San Diego, CA, pp. 279-285, Nov. 5-6, 1995
Benedetto, S., et al. "Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes", The Telecommunications and Data Acquisition Progress Report 42-124 for NASA and California Institute of Technology Jet Propulsion Laboratory, Joseph H. Yuen, ed., pp. 63-87, Feb. 15, 1996
Divsalar, D., et al., "Effective free distance of turbo codes", Electronic Letters, vol. 32, No. 5, pp. 445-446, Feb. 29, 1996
Benedetto, S., et al. "Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding", The Telecommunications and Data Acquisition Progress Report 42-126 for NASA and California Institute of Technology Jet Propulsion Laboratory, Joseph H. Yuen, ed., pp. 1-26, Aug. 15, 996
Benedetto, S., et al. "A Soft-Input Soft-Output Maximum A Posteriori (MAP) Module to Decode Parallel and Serial Concatenated Codes", The Telecommunications and Data Acquisition Progress Report 42-127 for NASA and California Institute of Technology Jet Propulsion Laboratory, Joseph H. Yuen, ed., pp. 1-20, Nov. 15, 1996
Benedetto, S., et al., "Parallel Concatenated Trellis Coded Modulation", ICC '96, pp. 974-978, Jun. 1996
Benedetto, S., et al., "A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes", IEEE Communication Letters, vol. 1, No. 1, pp. 22-24, Jan. 1997
Divsalar, D., et al., "Hybrid Concatenated Codes and Iterative Decoding", Proceedings from the IEEE 1997 International Symposium on Information Theory, Ulm, Germany, p. 10, Jun. 29-Jul. 4, 1997
Benedetto, S., et al., "Serial Concatenation of interleaved codes: performance analysis, design, and iterative decoding", Proceedings from the IEEE 1997 International Symposium on Information Theory, Ulm, Germany, p. 106, Jun. 29-Jul. 4, 1997
Benedetto, S., et al., "Serial Concatenated Trellis Coded Modulation with Iterative Decoding", Proceedings from the IEEE 1997 International Symposium on Information Theory, Ulm, Germany, p. 8, Jun. 29-Jul. 4, 1997
Benedetto, S., et al., "Design of Serially Concatenated Interleaved Codes", ICC '97, Montreal, Canada, pp. 710-714, Jun. 1997
Hagenauer et al., "A Viterbi Algorithm with Soft-Decision Outputs and its Applications", GLOBECOM '89, pp. 47.1.1-47.1.7, Nov. 1989
Berrou et al., "Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes", ICC '93, pp. 1064-1070, May 1993
Le Goff et al., "Turbo-Codes and High Spectral Efficiency Modulation", ICC '94, pp. 645-649, May 1994
Hagenauer et al., "Decoding "Turbo"-Codes with the Soft Output Viterbi Algorithm (SOVA)", 1994 International Symposium on Information Theory, p. 164, Jul. 1994
Anderson, "`Turbo` Coding for Deep Space Applications", 1995 International Symposium on Information Theory, p. 36, Sep. 1995
Siala et al., "An Iterative Decoding Scheme for Serially Concatenated Convolutional Codes", 1995 International Symposium on Information Theory, p. 473, Sep. 1995
Fazel et al., "Combined Multilevel Turbo-Code with 8PSK Modulation", GLOBECOM '95, pp. 649-652, Nov. 1995
Thitimajshima, "Recursive Systematic Convolutional Codes and Application to Parallel Concatenation", GLOBECOM '95, pp. 2267-2272, Nov. 1995
Hagenauer et al., "Iterative Decoding of Binary Block and Convolutional Codes", IEEE Trans. on Information Theory, vol. 42, No. 2, Mar. 1996, pp. 429-445, Mar. 1996
Lee, "Convolutional Coding: Fundamentals and Applications", Artech House, 1997, p. 38, Oct. 199
May 15, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
