Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2011-06-07
2011-06-07
Baderman, Scott T (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
Reexamination Certificate
active
07958425
ABSTRACT:
The present invention relates to methods, apparatuses, and systems for performing data encoding involving encoding data bits according to an outer convolutional code to produce outer encoded bits processing the outer encoded bits using an interleaver and a logical unit to produce intermediate bits, wherein the logical unit receives a first number of input bits and produces a second number of corresponding output bits, the second number being less than the first number, and wherein the logical unit takes each of the first number of input bits into account in producing the second number of output bits, encoding the intermediate bits according to an inner convolutional code to produce inner encoded bits, wherein the inner convolutional code is characterized by at least two states, and combining the data bits and the inner encoded bits to produce encoded outputs.
REFERENCES:
patent: 4713817 (1987-12-01), Wei
patent: 4888775 (1989-12-01), Karabed et al.
patent: 5214672 (1993-05-01), Eyuboglu et al.
patent: 5392299 (1995-02-01), Rhines et al.
patent: 6016568 (2000-01-01), Wolf et al.
patent: 6023783 (2000-02-01), Divsalar et al.
patent: 6029264 (2000-02-01), Kobayashi et al.
patent: 6031874 (2000-02-01), Chennakeshu et al.
patent: 6081919 (2000-06-01), Fujiwara et al.
patent: 6166667 (2000-12-01), Park
patent: 6202189 (2001-03-01), Hinedi et al.
patent: 6266795 (2001-07-01), Wei
patent: 6289486 (2001-09-01), Lee et al.
patent: 6351832 (2002-02-01), Wei
patent: 6353900 (2002-03-01), Sindhushayana et al.
patent: 6377610 (2002-04-01), Hagenauer et al.
patent: 6473878 (2002-10-01), Wei
patent: 6484283 (2002-11-01), Stephen et al.
patent: 6625775 (2003-09-01), Kim
patent: 6690739 (2004-02-01), Mui
patent: 7010051 (2006-03-01), Murayama et al.
patent: 7093179 (2006-08-01), Shea
patent: 7185260 (2007-02-01), Coombs et al.
patent: 7673213 (2010-03-01), Chugg et al.
patent: 2002/0061071 (2002-05-01), Cameron et al.
patent: 2003/0221156 (2003-11-01), Berger et al.
patent: 2006/0031737 (2006-02-01), Chugg et al.
Benedetto, S, Analysis, design, and Iterative decoding of double serially concatenated codes with interleavers, 1998, IEEE, vol. 16, pp. 232-242.
Chugg, Keith M. A new Class of Turbo-Like Codes with Desirable Practical Properties, Comm. Theory Workshop May 6, 2004.
Flexicodes: A Highly Flexible FEC Solution. Whitepaper Trellisware Technologies. Inc. Apr. 6, 2004.
Aji, Srinivas M. et al., “The generalized distributive law”, IEEE Transactions on Information Theory, 46(2):325-43, Mar. 2000.
Bahl, L.R. et al., “Optimal decoding of linear codes for minimizing symbol error rate”, IEEE Transactions on Information Theory, Mar. 1974, pp. 284-287.
Gallager, R.G., “Low-density parity-check Codes”, IRE Transactions on Information Theory, Jan. 1962, pp. 21-28.
Kschischang, Frank R. et al., “Factor graphs and the sum-product algorithm”, IEEE Transactions on Information Theory, 47(2):498-519, Feb. 2001.
MacKay, D.J.C. et al., “Near Shannon limit performance of low density parity check codes”, Electronics Letters, 32(18):1645-46, Aug. 29, 1996.
Richardson, Thomas J. et al., “Design of capacity-approaching irregular low-density parity-check codes”, IEEE Transactions on Information Theory, 47(2):619-37, Feb. 2001.
Abbasfar et al.“Accumulate repeat accumulate codes,” proceedings of the IEEE International Symposium on Information Theory (ISIT), p. 505 (Jul. 2004).
Abbasfar et al.“Accumulate repeat accumulate codes,” proceedings of the IEEE Communications Society, Blobcon 2004, pp. 509-513 (Dec. 2004).
Chugg et. al. “A New Class of Turbo-like Codes with Universally Good Performance and High-Speed Decoding”, Proc. IEEE Military Comm. Conf. (Oct. 2005).
Jin et al. “Irregular repeat accumulate codes,” In Turbo Code Conf., Brest, France, (Sep. 2000).
Ping “The SPC technique and low complexity turbo codes,” Proc. Globecom Conf., Rio de Janeiro, Brazil, pp. 2592-2596 (Dec. 1999).
U.S. Appl. No. 11/203,683, Office Action dated Oct. 8, 2008, 10 pages.
U.S. Appl. No. 11/203,683, Final Office Action dated Jan. 13, 2009, 20 pages.
U.S. Appl. No. 11/203,683, Office Action dated Aug. 26, 2009, 12 pages.
U.S. Appl. No. 11/203,683, Notice of Allowance dated Dec. 31, 2009, 4 pages.
Chugg Keith Michael
Dimou Georgios Dimitrios
Gray Paul Kingsley
Thiennviboon Phunsak
Ahmed Enam
Baderman Scott T
Kilpatrick Townsend & Stockton LLP
Trelliware Technologies, Inc.
LandOfFree
Method and apparatus for communications using turbo like codes does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for communications using turbo like codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for communications using turbo like codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2630841