Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2011-03-15
2011-03-15
Alphonse, Fritz (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S755000, C714S804000
Reexamination Certificate
active
07908539
ABSTRACT:
A method that allows the easy generation of low-density parity-check codes that can realize superior error-correcting characteristics. A processor (50) of a transmission line encoder constructs parity check matrix H from partial matrix H1of m rows and k columns on the left side and partial matrix H2of m rows and m columns on the right side. The processor (50) generates partial matrix H2as a unit matrix. The processor (50) generates partial matrix H1to satisfy the conditions that, when any two rows contained in partial matrix H1are selected, the two rows have periods that are relatively prime, or when the periods are identical, the two rows have different phases. The processor (50) then joins partial matrix H1and partial matrix H2to generate parity check matrix H.
REFERENCES:
patent: 6718508 (2004-04-01), Lodge et al.
patent: 6789227 (2004-09-01), De Souza et al.
patent: 6850936 (2005-02-01), Oyanagi et al.
patent: 7298785 (2007-11-01), Suzuki
patent: 7395484 (2008-07-01), Matsumoto
patent: 7516388 (2009-04-01), Matsumoto
patent: 2001-168733 (2001-06-01), None
patent: 2003-115768 (2003-04-01), None
patent: 2003-198383 (2003-07-01), None
patent: 2003-244109 (2003-08-01), None
patent: 2003-296302 (2003-10-01), None
patent: 01/97387 (2001-12-01), None
Matsumoto et al. “Irregular Low-Density Parity-Check Code Design Based on Euclidean Geometries” IEICE Transactions on Fundamentals. Jul. 2003, pp. 1820-1834, vol. E86-A, No. 7, Tokyo, Japan.
Matsumoto et al. “Irregular low-density parity-check code design based on integer lattices” Proceedings 2003 IEEE International., Jun. 29-Jul. 4, 2003, p. 3, New York, NY XP010657031.
Lehmann et al. “Distance properties of irregular ldpc codes” Proceedings 2003 IEEE.
Tian et al. “Construction of irregular LDPC codes with low error floors” IC 2003. 2003 IEEE International, May 11-15, 2003, New York, NY, vol. 4 pp. 3125-3129 XP010643022.
Yang et al. “Design of efficiently encodable moderate-length high-rate irregular LDPC codes” Proceedings of the annual conference on communication, control and computing, Oct. 2002 pp. 1415-1424 XP 009042018.
Luby et al. “Improved low-density parity-check codes using irregular graphs and belief propagation” information theory, 1998. Proceedings. Cambridge, MA, p. 117 XP 010297081.
Rosenthal et al. “Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from margulis” Proceedings of the 2001 IEEE International Symposium on information theory. Jun. 2001 p. 4 New York, NY XP 010552621.
Mannoai et al. “Optimized irregular gallager codes for OFDM transmission” Personal, indoor and mobile radio communications, 2002. vol. 1 pp. 222-226 XP010614219.
Echard et al. “Irregular/spl pi/-rotation LDPC codes” Globecom 02. IEEE Global Telecommunications Conference, New York, NY vol. 2, Nov. 2002 pp. 1274-1278 XP010636350.
Jeongseok et al. “Optimal puncturing of irregular low-density parity-check codes” IEEE International Conference on Communications, New York, NY vol. 5 May 2003 pp. 3110-3114 XP010643019.
Kasai et al. “Detailed representation of irregular Idpc code ensembles and density evolution” IEEE International Symposium on Information Theory, New York, NY Jun. 2003 p. 121 XP010657149.
Yang et al. “Lowering the error-rate floors of moderate-length high-rate irregular Idpc codes” IEEE international symposium on information theory, New York, NY Jun. 2003 p. 237 XP010657265.
Rashidpour et al. “Low-density parity-check codes with simple irregular semi-random parity-check matrix for finite-length applications” Personal, indoor and mobile radio communications, 2003. PIMRC 2003. 14th IEEE Proceedings, Sep. 2003 pp. 439-443.
Liuguo et al. “Modified belief-propagation algorithm for decoding of irregular low-density parity-check codes” Electronics letters, vol. 38, No. 24, Nov. 2002 pp. 1551-1553 XP 006019345.
Johnson et al. “A family of irregular Idpc codes with low encoding complexity” IEEE Communications letters, IEEE Service Center, Piscataway, NJ vol. 7, No. 2, Feb. 2003 XP011066488.
Michael G. Luby et al. “Efficient Erasure Correcting Codes” IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, pp. 569-584.
Thomas J. Richardson et al. “Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes” IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, pp. 619-637.
David J.C. Mackay “Good Error-Correcting Codes Based on Very Sparse Matrices” IEEE Transactions on Information Theory, vol. 45, No. 2, Mar. 2, 1999, pp. 399-431.
Alphonse Fritz
NEC Corporation
Sughrue & Mion, PLLC
LandOfFree
Parity check matrix generation method, data transmission... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Parity check matrix generation method, data transmission..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parity check matrix generation method, data transmission... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2704668