Check matrix generation method and check matrix generation...

Details Check matrix generation method and check matrix generation... Check matrix generation method and check matrix generation...

2008-07-01

2008-07-01

Lamarre, Guy (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

Reexamination Certificate

active

07395484

ABSTRACT:
A method of generating a check matrix for a LDPC code includes determining a code length and a coding rate, and a basic matrix; selecting a maximum value of the weight of the column; searching an ensemble of the weights of the row and the column weights; deleting the rows sequentially from a bottom of the basic matrix; searching an ensemble of the weights of the row and the column using the set of the weights of the row as a fixed parameter, to determine an optimum set of the weights of the column; searching an optimal ensemble of the weights of the row and the column using the set of the weights of the row and the column as a fixed parameter; and dividing at random the weights of the row and the column of the basic matrix after deleting the rows in a predetermined procedure based on a final ensemble.

REFERENCES:
patent: 4862463 (1989-08-01), Chen
patent: 6715121 (2004-03-01), Laurent
patent: 6789227 (2004-09-01), De Souza et al.
patent: 6961888 (2005-11-01), Jin et al.
patent: 6968491 (2005-11-01), Yang et al.
patent: 2002/0163892 (2002-11-01), Hassibi et al.
patent: 2002/0188906 (2002-12-01), Kurtas et al.
patent: 0 611 054 (1994-08-01), None
patent: 6-223095 (1994-08-01), None
patent: 6-223096 (1994-08-01), None
patent: 2001-168733 (2001-06-01), None
Low Density parity Check codes based on sparse matrices with no small cycles, Bond et al. Springer Berlin/Heidelberg, 1997, pp. 46-58.
R.G. Gallager., “Low-Density Parity-Check Codes”, Cambridge, MA: MIT Press, 1963.
Y. Kou et al., “Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery,” ISIT 2000, pp. 200, Sorrento, Italy, Jun. 25 to 30, 2000.
Ludy et al., “Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation”, Proceedings of 1998 IEEE International Symposium of INformation Theory, pp. 171, Cambridge, Mass., Aug. 16 to 21, 1998.
Richardson et al., “The capacity of low-density parity-check codes under message-passing decoding”, IEEE Trans. Inform. Theory, vol. 47, No. 2, pp. 599 to 618, Feb. 2001.
Chung et al., “Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approxiamation”, IEEE Tans. Inform. Theory, vol. 47, No. 2, pp. 657 to 670, Feb. 2001.
J. Rosenthal, P.O. Vontobel, “Construction of LDPC codes using Ramnujan graphs and ideas from Margulis”, in Proc. of the 38th Allerton Conference on Communication, Control, Computing, 2000, pp. 248-257.
Matsumoto W et al: “Deterministic irregular low-density parity-check codes design scheme” Proc , Kiso Kyokai Society Meeting. vol. A-6-12, Sep. 10, 2002, p. 126, XP002903378.
Rosenthal J et al: “Constructions of regular and irregular LDPC codes using Remanujan graphs and ideas from margulis” Proc., IEEE International Symposium on Information Theory, ISIT 2001, Washington, WA, US, Jun. 24, 2001 p. 4, XP010552621 ISBN 0-7803-7123-2.
Vontobel P.O. et al: “Irregular codes from regular graphs” Proc , IEEE International Symposium on Information Theory, ISIT 02, Lausanna, Switzerland, Jun. 30, 2003-Jul. 5, 2002 p. 284, XP010601995 ISBN 0-7803-7501-7.
Chiani M et al: “Design and performance evaluation of some high-rate irregular low-density parity-check codes” Proc , IEEE Global Telecommunications Conference, Globecom 2001, San Antonio, TX, vol. vol. 2 of 6, Nov. 25, 2001 (Nov. 29, 2001) pp. 990-994, XP001099253 ISBN 0-7803-7206-9.
Luby M.G et al: “Analysis of low density codes and improved designs using irregular graphs” Proc., 30th Annual ACM Symposium on Theory of Computing Dallas, TX, May 23, 1998, pp. 249-258, XP000970907 ISBN 0-89791-962-9.
Luby M G. et al: “Improved Low-Density Parity-Check Codes Using Irregular Graphs” IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, XP011027875 ISSN 0018-9448.
Yu Kuo et al: “Low-Density Parity-Check Codes Based on Finite Geometrics: A Rediscovery and New Results” IEEE Transactions on Information Theory, IEEE Service Center, Piscataway, NJ, US, vol. 47, No. 7, Nov. 2001, XP011028087 ISSN 0018-9448.
Rosenthal J and Vontobel P.O : “Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis” Proc , 38th Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, Oct. 4, 2000-Oct. 6, 2000 pp. 1-10, XP002416895 Retrieved from the Internet: URL: http://www.hpl.hp.com/personal/Pascal—Vontobel/publications/papers/pcto-00-3.pdf.
Matsumoto W et al: “Irregular extended Euclidean geometry low-density parity-check codes” Proc., International Symposium on Communication Systems Networks and Digital Signal Processing, CSNDSP 2002, Stafford, UK, Jul. 15, 2002, pp. 148-151, XP002370884.
Chung, S Y et al: “Analysis pf Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation” IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, pp. 657-670, XP011027864 ISSN 0018-9448.

Affiliated with

Also associated with

Rating

Check matrix generation method and check matrix generation... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Check matrix generation method and check matrix generation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Check matrix generation method and check matrix generation... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2744843