Parallel concatenated code with soft-in soft-out interactive...

Details Parallel concatenated code with soft-in soft-out interactive... Parallel concatenated code with soft-in soft-out interactive...

2008-09-02

2008-09-02

Wang, Ted (Department: 2611)

Pulse or digital communications

Systems using alternating or pulsating current

Plural channels for transmission of a single pulse train

C375S262000, C375S295000, C375S341000, C714S701000, C714S746000, C714S755000

Reexamination Certificate

active

10843606

ABSTRACT:
A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Soloman encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo-N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel.

REFERENCES:
patent: 4677625 (1987-06-01), Betts et al.
patent: 4677626 (1987-06-01), Betts et al.
patent: 4979175 (1990-12-01), Porter
patent: 5181209 (1993-01-01), Hagenauer et al.
patent: 5349608 (1994-09-01), Graham et al.
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5666378 (1997-09-01), Marchetto et al.
patent: 5675585 (1997-10-01), Bonnot et al.
patent: 5703911 (1997-12-01), Lin et al.
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5734962 (1998-03-01), Hladik et al.
patent: 5742612 (1998-04-01), Gourgue et al.
patent: 5761248 (1998-06-01), Hagenauer et al.
patent: 5784300 (1998-07-01), Neumeier et al.
patent: 5841818 (1998-11-01), Lin et al.
patent: 5907582 (1999-05-01), Yi
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 5970085 (1999-10-01), Yi
patent: 5970098 (1999-10-01), Herzberg
patent: 5978365 (1999-11-01), Yi
patent: 5983384 (1999-11-01), Ross
patent: 5983385 (1999-11-01), Khayrallah et al.
patent: 5996104 (1999-11-01), Herzberg
patent: 6016568 (2000-01-01), Wolf et al.
patent: 6065147 (2000-05-01), Pyndiah et al.
patent: 6119264 (2000-09-01), Berrou et al.
patent: 6122763 (2000-09-01), Pyndiah et al.
patent: 6182261 (2001-01-01), Haller et al.
patent: 6202189 (2001-03-01), Hinedi et al.
patent: 6304996 (2001-10-01), Van Stralen et al.
patent: 6339834 (2002-01-01), Crozier et al.
patent: 6427214 (2002-07-01), Li et al.
patent: 6744744 (2004-06-01), Tong et al.
patent: 6857087 (2005-02-01), Crozier et al.
patent: 7180955 (2007-02-01), Onggosanusi et al.
patent: 2001/0028690 (2001-10-01), Ebel, Sr.
patent: 0 843 437 (1998-05-01), None
patent: 0 891 656 (1999-09-01), None
patent: 0940957 (1999-09-01), None
patent: 0973292 (2000-01-01), None
patent: 0986181 (2000-03-01), None
patent: 1 009 098 (2000-06-01), None
patent: 1030457 (2000-08-01), None
patent: 2724522 (1996-03-01), None
patent: 2346782 (2000-08-01), None
patent: WO-99/19994 (1999-04-01), None
patent: WO-01/43310 (2001-06-01), None
patent: WO-01/43384 (2001-06-01), None
patent: WO-02/19552 (2002-03-01), None
patent: WO-02/21702 (2002-03-01), None
patent: WO-02/23738 (2002-03-01), None
patent: WO-02/23739 (2002-03-01), None
patent: WO-02/37691 (2002-05-01), None
patent: WO-02/41563 (2002-05-01), None
T. Richardson—“The geometry of turboing dynamics,” IEEE Trans. On Information Theory, vol. 46, Jan. 2000, pp. 9-23.
S. Benedetto, et al., “Parallel Concatenated Trellis Coded Modulation”, Jet Propulsion Laboratory, California Institute of Technology, 5 pages.—, Jun. 1996.
W.J. Gross, et al., “Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders”, Electronics Letters, vol. 34, No. 16, Aug. 6, 1998, pp. 1577-1578.
Gottfried Ungerboeck, “Channel Coding with Multilevel/Phase Signals”, IEEE Transactions on Information Theory, vol. 28, No. 1, Jan. 1982, pp. 55-66.
Andrew J. Viterbi, “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolution Codes”, IEEE Journal on Selected Areas in Communications, vol. 16, No. 2 Feb. 1998, pp. 260-264.
Claude Berrou, et al., Near Optimum Error Correcting Coding and Decoding: Turbo-Codes, IEEE Transactions on Communications, vol. 44, No. 10, Oct. 1996, pp. 1261-1272.
Steven S. Pietrobon, “Implementation and Performance of a Turbo/MAP Decoder”, International Journal of Satellite Communications, Feb. 21, 1997, rev. Dec. 4, 1997 and Apr. 2, 1998, 45 pages.
D. Divsalar, et al., “Effective Free Distance of Turbo Codes”, Electronics Letters, Feb. 29, 1996, vol. 32, No. 5, pp. 445-446.
S. Dolinar, et al., Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations, TDA Progress Report 42-121, JPL, Aug. 1995, pp. 56-65.
T. Richardson—“The Geometry of Turbo-Decoding Dynamics”, IEEE Trans. On Information Theory, vol. 46, Jan. 2000, pp. 9-23.
Ramsey, John L., “Realization of Optimum Interleavers,” IEEE Transactions on Information Theory, May 1970, pp. 338-345, vol. IT-16, No. 3.
Battail, Gerard, et al., “Suboptimum Decoding Using Kullback Principle,” in Lecture Notes in Computer Science, 1988, pp. 93-101, No. 313, B. Bouchon, et al. Eds.
Berrou, Claude, et al., “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes,”IEEE International Conference on Communications 93, Geneva Switzerland, May 23, 1993, pp. 1064-1070, Technical Program, Conference Record, vol. 2/3.
Moher, Michael, “Decoding Via Cross-Entropy Minimization,”Proceedings IEEE GLOBECOM Conference, Houston, TX, Dec. 1993, pp. 809-813.
Fazel, K., et al., “Combined Multilevel Turbo-Code with 8PSK Modulation,”Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, GLOBECOM 95. IEEE Singapore, Nov. 13, 1995, pp. 649-653.
Hagenauer, Joachim, et al., “Iterative Decoding of Binary Block and Convolutional Codes,”IEEE Transactions on Information Theory, Mar. 1996, pp. 429-445, vol. 42, No. 2.
Robertson, Patrick, et al., “Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes,”IEEE Journal on Selected Areas in Communications, Feb. 1998, pp. 206-218, vol. 16, No. 2.
Hsu, Jah-Ming, et al., “A Parallel Decoding Scheme for Turbo Codes,”ISCAS 98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, Monterey, CA, May 31, 1998, pp. 445-448.
Yue, Chung-Wai, et al., “On the FER Performance and Decoding Complexity of Turbo Codes,”1999 IEEE 49thVehicular Technology Conference, Houston, TX, May 16, 1999, pp. 2214-2218.
Langlais, Charlotte, et al., “Synchronisation in the Carrier Recovery of a Satellite Link Using Turbo-Codes with the Help of Tentative Decisions,”IEE Colloquium. Turbo Codes in Digital Broadcasting—Could It Double Capacity?, Nov. 22, 1999, pp. 5/1-7.
Kim, Bonghoe, et al., “Reduction of the Number of Iterations in Turbo Decoding Using Extrinsic Information,”IEEE TENCON, 1999, pp. 494-497.
Richardson, Tom, “The Geometry of Turbo-Decoding Dynamics,”IEEE Transactions on Information Theory, Jan. 2000, pp. 9-23, vol. 46, No. 1.
Schlegel, Christian,Trellis Coding, 1997, IEEE Press, Piscataway, New Jersey (entire book).
Heegard, Chris, et al.,Turbo Coding, 1999, Kluwer Academic Publishers, Norwell, Massachusetts (entire book).
Vucetic, Branka, et al.,Turbo Codes Principles and Applications, 2000, Kluwer Academic Publishers, Norwell, Massachusetts (entire book).
Sklar, Bernard,Digital Communications Fundamentals and Applications, Second Edition, 2001, Prentice Hall PTR, Upper Saddle River, New Jers

Affiliated with

Also associated with

Rating

Parallel concatenated code with soft-in soft-out interactive... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel concatenated code with soft-in soft-out interactive..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel concatenated code with soft-in soft-out interactive... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3958499