Method and apparatus for performing low-density parity-check...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S757000, C714S761000

Reexamination Certificate

active

06957375

ABSTRACT:
Methods and apparatus of the present invention can be used to implement a communications system wherein different devices using the same LDPC code can be implemented using different levels of parallelism. The use of a novel class of LDPC codes makes such differences in parallelism possible. Use of a factorable permuter in various embodiments of the invention make LDPC devices with different levels of parallelism in the encoder and decoder relatively easy to implement when using the codes in the class of LDPC codes discussed herein. The factorable permuter may be implemented as a controllable multi-stage switching devices which performs none, one, or multiple sequential reordering operations on a Z element vector passed between memory and a Z element vector processor, with the switching one individual vectors being controlled in accordance with the graph structure of the code being implemented.

REFERENCES:
patent: 3542756 (1970-11-01), Gallager
patent: 3665396 (1972-05-01), Forney, Jr.
patent: 4295218 (1981-10-01), Tanner
patent: 5157671 (1992-10-01), Karplus
patent: 5271042 (1993-12-01), Borth et al.
patent: 5293489 (1994-03-01), Furui et al.
patent: 5313609 (1994-05-01), Baylor et al.
patent: 5396518 (1995-03-01), How
patent: 5457704 (1995-10-01), Hoeher et al.
patent: 5526501 (1996-06-01), Shams
patent: 5615298 (1997-03-01), Chen
patent: 5671221 (1997-09-01), Yang
patent: 5860085 (1999-01-01), Stormon et al.
patent: 5864703 (1999-01-01), van Hook et al.
patent: 5867538 (1999-02-01), Liu
patent: 5892962 (1999-04-01), Cloutier
patent: 5933650 (1999-08-01), van Hook et al.
patent: 5968198 (1999-10-01), Hassan
patent: 6002881 (1999-12-01), York et al.
patent: 6073250 (2000-06-01), Luby et al.
patent: 6195777 (2001-02-01), Luby et al.
patent: 6247158 (2001-06-01), Smallcomb
patent: 6266758 (2001-07-01), van Hook et al.
patent: 6298438 (2001-10-01), Thayer et al.
patent: 6339834 (2002-01-01), Crozier et al.
patent: 6397240 (2002-05-01), Fernando et al.
patent: 6438180 (2002-08-01), Kavcic et al.
patent: 6473010 (2002-10-01), Viyaev et al.
patent: 6484284 (2002-11-01), Smallcomb
patent: 6526538 (2003-02-01), Hewitt
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6718504 (2004-04-01), Coombs et al.
patent: 6731700 (2004-05-01), Yakhnich et al.
patent: 6754804 (2004-06-01), Hudepohl et al.
patent: 2004/0034828 (2004-02-01), Hocevar
Peterson et al, “Error-Correcting Codes”, MIT Press, 1972, pp. 212, 213, 261-263, 362.
Blahut, “Theory and Practice of Error Control Codes”, Addison-Wesley Publishing, pp. 47-49.
PCT International Search Report, for International Application No. PCT/US04/05783, Feb. 26, 2004.
Richardson et al. “The capacity of low-density parity-check codes under message-passing Decoding”, IEEE Transactions on Information Theory; pp.: 599-618, Feb. 2001, (same inventor) whole document.
Paranchych et al. “Performance of a digital symbol synchronizer in cochannel interference and noise”, IEEE Transactions on Communications, pp.: 1945-1954; Nov. 2000, whole document.
Sorokine, V. et al. “Innovative coding scheme for spread-spectrum communications”, The Ninth IEEE International Symposium on Indoor and Mobile Radio Communications, pp.: 1491-1495, vol. 3; Sep. 1998, whole document.
NN77112415. “Digital Encoding of Wide Range Dynamic Analog Signals”, IBM Tech. Disclosure Bulletin, Nov. 1, 1997, vol. No. 20; Issue No. 6; pp. 2415-2417, whole document.
NN9210335. “Hierarchical Coded Modulation of Data with Fast Decaying Probability Distributions”, IBM Tech. Disclosure Bulletin, Oct. 1992, vol. No. 35; Issue No. 5; pp. 335-336, whole document.
T. Richardson and R. Urbanke, “An Introduction to the Analysis of Iterative Coding Systems”, pp. 1-36.
T. Richardson, A. Shokrollahi, R. Urbanke, “Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes”, pp. 1-43 (Mar. 2001).
T. Moors and M. Veeraraghavan, “Preliminary specification and explanation of Zing: An end-to-end protocol for transporting bulk data over optical circuits”, pp. 1-55 (May 2001).
Wolfram Research, “Group Ring”, downloaded from http://mathworld.wolfram.com/GroupRing.html on Dec. 30, 2004, p. 1 of 1.
Wolfram Research, “Group Algebra”, downloaded from http://mathworld.wolfram.com/GroupAlgebra.html on Dec. 30, 2004, p. 1 of 2.
Mohammad M. Mansour, Naresh R. Shanbhag, Session 11: Low-power VLSI decoder architectures for LDPC codes, Proceedings of the 2002 international symposium on Low power electronics and design Aug. 2002, pp.: 284-289.
Saied Hemati, Amir H. Banihashemi, VLSI circuits: Iterative decoding in analog CMOS, Proceedings of the 13thACM Great Lakes Symposium on VLSI Apr. 2003, pp.: 15-20.
T. Richardson and R. Urbanke, “The Capacity of Low-Density Parity-Check Codes under Message-Passing Decoding”, pp. 1-44 (Mar. 2001).
W. W. Peterson and E.J. Weldon, Jr., “Error-Correcting Codes”, Second Edition, The Massachusetts Institute of Technology, pp 212-213,261-263, 263, (1986).
R. Blahut, “Theory and Practice of Error Control Codes”, Library of Congress Cataloging in Publication Data, pp-47-49, (May 1984).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for performing low-density parity-check... 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 performing low-density parity-check..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for performing low-density parity-check... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3466532

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.