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...

2004-07-22

2009-08-04

Wang, Ted (Department: 2611)

Pulse or digital communications

Systems using alternating or pulsating current

Plural channels for transmission of a single pulse train

C375S341000, C714S701000, C714S746000, C714S755000

Reexamination Certificate

active

07570700

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-Solomon 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: 6427214 (2002-07-01), Li et al.
patent: 6601214 (2003-07-01), Hammons, Jr.
patent: 6712908 (2004-03-01), Wang et al.
patent: 6944235 (2005-09-01), Ophir
patent: 2001/0028690 (2001-10-01), Ebel, Sr.
patent: 0 702 476 (1996-03-01), None
patent: 0 843 437 (1998-05-01), None
patent: 0891656 (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: 1 030 457 (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 99/63703 (1999-12-01), None
patent: WO 00/27064 (2000-05-01), None
patent: WO 00/35103 (2000-06-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
Agrawal, Dakshi, et al.; “On the Phase Trajectories of the Turbo-Decoding Algorithm”; 1999 IMA Summer Program Codes, Systems and Graphical Models; http://www.comm.csl.uiuc.edu/˜dakshi; Aug. 3, 1999; pp. 1-22; XP-002207488.
Buckley, Michael E., et al.; “The Design and Performance of a Neural Network for Predicting Turbo Decoding Error with Application to Hybrid ARQ Protocols”; IEEE Transactions on Communications; Apr. 2000, pp. 566-576; vol. 48., No. 4; XP-00932188; IEEE.
Ebel, William J.; “Turbo Code Implementation on the C6x”, Texas Instruments DSPS Fest '99; Aug. 1999; pp. 1-13; XP002207490; Houston, TX.
Rajashekhara, T.M.; “Signature Analyzers in Built-In-Self-Test Circuits: A Perspective”; Proceedings of the 1990 IEEE Southern Tier Technical Conference ; Apr. 25, 1990; pp. 275-281; XP-010010765.
Shao, Rose Y., et al.; “Two Simple Stopping Criteria for Turbo Decoding” IEEE Transactions on Communications; Aug. 8, 1999; pp. 1117-1120; vol. 47, No. 8; XP-000848102; IEEE.
Wu, Yufei, et al.; “A Simple Stopping Criterion for Turbo Decoding”; IEEE Communications Letters; Aug. 2000; pp. 258-260; vol. 4, No. 8; XP-000959692; IEEE.
Internet Papers: “Codes, Systems and Graphical Models”; 1999 IMA Summer Program; http://www.ima.umn.edu/csg/; Aug. 2-13, 1999; pp. 1-6; XP-002207489.
Schurgers C. et al.: “Energy Efficient Data Transfer and Storage Organization for a MAP Turbo Decoder Module”; XP010355952; Aug. 16, 1999, pp. 76-81, ISBN: 1-58113-133-X.
Collins O. M. et al.: “Iterative Decoding of Non-Systematic Turbo-Codes”; 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, Jun. 25-30, 2000, p. 172, ISBN: 0-7803-5857-0.
Morlet C. et al.: “A Carrier Phase Estimator For Multi-media Satellite Payloads Suited to RSC Coding Schemes”; IEEE 2000, Jun. 18, 2000, pp. 455-459, vol. 1; ISBN: 0-7803-6283-7.
Proakis J.G.: “Digital Communications” 1991, Modulation and Demodulation for the Additive Gaussian Noise Channel, McGraw-Hill, New York; XP002193198 181370, pp. 234-271.
Benedetto, S., et al., “Parallel Concatenated Trellis Coded Modulation,” Jet Propulsion Laboratory, California Institute of Technology, 5 pages.
Ramsey, John L., “Realization of Optimum Interleavers,”IEEE Transactions on Information Theory, May 1970, pp. 338-345, vol. IT-16, No. 3.
Ungerboeck, Gottfried, “Channel Coding with Multilevel/Phase Signals,”IEEE Transactions on Information Theory, Jan. 1982, pp. 55-66, vol. IT-28, No.1.
Battail, Gërard, et al., “Suboptimum Decoding Using Kullback Principle,” inLecture 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.
Dolinar, S., et al., “Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations,” TDA Progress Report 42-122, Jet Propulsion Laboratory, Aug. 1995, pp. 56-65.
Fazel, K., et al., “Combined Multilevel Turbo-Code with 8PSK Modulation,”Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, Globecom 95. IEEESingapore, Nov. 13, 1995, pp. 649-653.
Divsalar, D., et al., “Effective Free Distance of Turbo Codes,”Electronics Letters, Feb. 29, 1996, pp. 445-446, vol. 32, No. 5.
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.
Berrou, Claude, “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,”IEEE Transactions on Communications, Oct. 1996, pp. 1261-1271, vol. 44, No. 10.
Pietrobon, Steven S., “Implementation and Performance of a Turbo/MAP Decoder,” a paper submitted to theInternational Journal of Satellite Communications, Feb. 21, 1997, rev. Dec. 4, 1997 and Apr. 2, 1998, 45 pages.
Robertson, Patrick,

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-4084825