Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2006-12-12
2006-12-12
Chase, Shelly (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S801000
Reexamination Certificate
active
07149953
ABSTRACT:
Efficient LDPC code decoding with new minus operator in a finite precision radix system. A new mathematical operator is introduced and applied to the decoding of LDPC coded signals. This new operator is referred to as the min†− (min-dagger minus) operator herein. This min†− processing is appropriately applied during the updating of the edge messages with respect to the variable nodes. In a bit level decoding approach to decoding LDPC coded signals, the updating of the edge messages with respect to the bit nodes is performed using the new min†− operator. This approach provides very comparable performance to min** processing as also applied to updating of the edge messages with respect to the bit nodes and may also provide for a significant savings in hardware. Also, within finite precision radix systems, the new min†− operator provides a means by which always meaningful results may be achieved during the decoding processing.
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: 2003/0104788 (2003-06-01), Kim
Mao et al., A new schedule for decoding low density parity check codes, 2001, IEEE, p. 1007-1010.
Xiao-Yu et al., Efficient implementations of the sum-product algorithm for decoding LDPC codes, 2001, IEEE, p. 1036-1036E.
Achilleas Anastasopoulos, A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution, 2001, IEEE, p. 1021-1025.
Xiao-Yu et al., Progressive edge-growth Tannar graph, 2001, IEEE, p. 995-1001.
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-2/02, IEEE, 2002, pp. 1752-1757.
J. Hagenauer, E. Offer and L. Papke, “Iterative 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
Chase Shelly
Garlick & Harrison & Markison
Short Shayne X.
LandOfFree
Efficient LDPC code decoding with new minus operator in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient LDPC code decoding with new minus operator in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient LDPC code decoding with new minus operator in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3674050