Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2004-12-20
2008-03-25
Chaudry, Mujtaba K. (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S804000, C714S801000
Reexamination Certificate
active
07350130
ABSTRACT:
Decoding LDPC (Low Density Parity Check) code with new operators based on min* operator. New approximate operators are provided that may be employed to assist in calculating one or a minimum value (or a maximum value) when decoding various coded signals. In the context of LDPC decoding that involves both bit node processing and check node processing, either of these new operators (i.e., the min† (min-dagger) operator or the min′ (min-prime) operator) may be employed to perform the check node processing that involves updating the edge messages with respect to the check nodes. Either of these new operators, min† operator or min′ operator, is shown herein to be a better approximate operator to the min** operator.
REFERENCES:
patent: 3542756 (1970-11-01), Gallager
patent: 3665396 (1972-05-01), Forney, Jr.
patent: 4295218 (1981-10-01), Tanner
patent: 6430233 (2002-08-01), Dillon et al.
patent: 6473010 (2002-10-01), Vityaev et al.
patent: 6567465 (2003-05-01), Goldstein et al.
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6725409 (2004-04-01), Wolf
patent: 6789227 (2004-09-01), De Souza et al.
patent: 6895547 (2005-05-01), Eleftheriou et al.
patent: 7116732 (2006-10-01), Worm et al.
patent: 7209527 (2007-04-01), Smith et al.
patent: 2002/0051501 (2002-05-01), Demjaneko et al.
patent: 2003/0104788 (2003-06-01), Kim
Anastasopoulos, Achilleas, A Comparison Between the Sum-Product and the Min-Sum Iterative Detection Algorithms based on Density Evolution, 2001, IEEE, pp. 1021-1025.
Al-Rawi et. al., Optimizing the Mapping of Low-Density Parity-Check Codes on Parallel Decoding Architectures, 2001, IEEE, pp. 578-586.
Zarkeshvari et. al., On Implementation of Min-Sum Algorithm for Decoding Low-Density Parity-Check Codes, 2002, IEEE, pp. 1349-1353.
R. Gallager, Low-Density Parity-Check Codes, Cambridge, MA: MIT Press, 1963.
M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, “Practical loss-resilient codes,” 1997.
T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check code under message-passing decoding,” IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
E. Eleftheriou and S. Olcer, “Low-Density Parity-Check Codes for Digital Subscriber Lines,” 0-7803-7400-Feb. 2002, IEEE, 2002, pp. 1752-1757.
Draft ETSI EN 302 307 V1.1.1 (Jun. 2004), Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for Broadcasting, Interactive Services, News Gathering and other broadband satellite applications.
J. Hagenauer, E. Offer and L. Papke, “Interative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol. 42, No. 2 Mar. 1996, pp. 429-445.
E. Eleftheriou, T. Mittelholzer and A. Dholakia, “Reduced-complexity decoding algorithm for low-density parity-check codes,” IEE Electronic Letters, vol. 37, pp. 102-104, Jan. 2001.
Cameron Kelly Brian
Shen Ba-Zhong
Tran Hau Thien
Broadcom Corporation
Chaudry Mujtaba K.
Garlick & Harrison & Markison
Short Shayne X.
LandOfFree
Decoding LDPC (low density parity check) code with new... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Decoding LDPC (low density parity check) code with new..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding LDPC (low density parity check) code with new... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3960319