Decoding architecture for low density parity check codes

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S803000

Reexamination Certificate

active

10234059

ABSTRACT:
Architectures for decoding low density parity check codes permit varying degrees of hardware sharing to balance throughput, power consumption and area requirements. The LDPC decoding architectures may be useful in a variety of communication systems in which throughput, power consumption, and area are significant concerns. The decoding architectures implement an approximation of the standard message passing algorithm used for LDPC decoding, thereby reducing computational complexity. Instead of a fully parallel structure, this approximation permits at least a portion of the message passing structure between check and bit nodes to be implemented in a block-serial mode, providing reduced area without substantial added latency.

REFERENCES:
patent: 4295218 (1981-10-01), Tanner
patent: 6396871 (2002-05-01), Gelblum et al.
patent: 6512739 (2003-01-01), Heidari et al.
patent: 6857097 (2005-02-01), Yedidia et al.
patent: 6895547 (2005-05-01), Eleftheriou et al.
patent: 6965652 (2005-11-01), Burd et al.
patent: 7000174 (2006-02-01), Mantha et al.
patent: 2002/0021770 (2002-02-01), Beerel et al.
patent: 2002/0042899 (2002-04-01), Tzannes et al.
“Low Density Parity Check Codes: Decoding Analysis” Henry D. Pfister and Paul H. Siegel, Signal Transmission and Recording (STAR) Group, University of California, San Diego, Jan. 25, 2000.
“Lecture Notes for Math 696 Coding Theory Iterative Decoding” Michael E. O'Sullivan, www.rohan.sdsu.edu/-mosulliv, Mar. 18, 2002.
“Reed-Solomon Codes” Martyn Riley Iain Richardson, 4i2i Communications Ltd. Mar. 31, 2000, http://www.4i2i.com/—reed—solomon—codes.htm.
“Low density parity check codes”, R. G. Gallager, IRE Trans. Information Theory, vol. IT-8, pp. 21-28, Jan. 1962.
“Low Density Generator Matrix Interpretation of Parallel Concatenated Single Bit Parity Codes”, Travis Oening and J. Moon, to appear in IEEE Trans. Magn.
“Constrained Coding and Soft Iterative Decoding For Storage”, John L. Fan, Stanford University, pp. 50-52, Dec. 1999.
“Reduced Complexity Iterative Decoding of Low-Density Parity Check Codes Based On Belief Propagation”, Marc P. C. Fossorier, M. Mihaljevic and H. Imai, IEEE Trans. On Communications, vol. 47, No. 5, May 1999.
“Low-Density Parity-Check (LDPC) Coded OFDM Systems” H. Futaki and T. Ohtsuki, IEEE Vehicular Technology Conference 54th, 2001 Fall, Aug. 2001, vol. 1, pp. 82-86.
“Efficient Implementations of the Sum-Product Algorithm for Decoding LDPC Codes” Xiao-Yu Hug, Evangelos Eleftheriou, Dieter-Michael Arnold and Ajay Dholakia, IEEE Global Telecommunications Conference, Sep. 2001, vol. 2, pp. 1036-1036E.
“VLSI Architectures for Iterative Decoders in Magnetic Recording Channels” Engling. Yeo, Payam Pakzak, Borivoje Nikolic and Venkat Anantharam, IEEE Transactions on Magnetics, Mar. 2001, vol. 37, Issue 2, Part 1, pp. 748-755.
“A 1-GHz Low-Power Transposition Memory Using New Pulse-Clocked D Flip-Flops” Po-Hui Yang, Jinn-Shyan Wang and Yi-Ming Wang, IEEE International Symposium on Circuits and Systems, May 2000, vol. 5, pp. 665-668.

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

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

Rate now

     

Profile ID: LFUS-PAI-O-3737018

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