Time-invariant hybrid iterative decoders

Details Time-invariant hybrid iterative decoders Time-invariant hybrid iterative decoders

2007-07-17

2007-07-17

Lamarre, Guy J. (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S797000, C714S786000, C714S794000, C375S341000, C375S262000

Reexamination Certificate

active

10845262

ABSTRACT:
An iterative decoder for receiving a sequence of samples representing a series of symbols, and for decoding the received sequence to the series. The decoder includes a plurality of variable-nodes. Each node receives and stores a sample from the sequence, iteratively passes messages to, and receives messages from, at least two connected check-nodes in a plurality of check-nodes, sends each connected check-node a message determined in accordance with the stored sample and message received from the at least one other check-node segment, and provides as output a decoded symbol determined in accordance with the received messages from the connected check-nodes and the stored sample.

REFERENCES:
patent: 2005/0229090 (2005-10-01), Shen et al.
Ardakani et al., “Gear-shift decoding”,Proc. 21sf Bienn 1 Symp. Commun., (Jun. 2002), Kingston, ON, Canada, pp. 86-90.
Banihashemi et al. “Hybrid (Multistage) Decoding Of Low-Density Parity-Check”, (LDPC)codes. Proc. 40h Ann 1 Allerton Conf Commun.,&Computing, Oct. 2002, Allerton, IL, USA, pp. 1437-1438.
Bazzi (L.) et al., “Exact Thresholds And Optimal Codes For The Binary Symmetric Channel And Gallager's Decoding Algorithm A”,Proc. Int'l Symp. Inform. Theory, Jun. 2000, Sorrento, Italy, p. 203.
Bazzi L. et al. “Exact Thresholds And Optimal Codes For The Binary Symmetric Channel And Gallager's Decoding Alogrithm A”,IEEE Trans. Inform. Theory, accepted for publication, pp. 1-21.
Berrou et al., “Near Shannon Limit Error -Correcting Coding And Decoding: Turbo-Codes (I)”,Rec. IEEE Int'l Conf Commun.—ICC, May 1993, Geneva, Switzerland, pp. 1064-1070.
Burshtein et al., “Bounds On The Performance Of Belief Propagation Decoding”,IEEE Transactions of Information Theory, Jan. 2002, 48, No. 1, pp. 112-122.
Chung, “On The Construction Of Some Capacity-Approaching Coding Schemes”,MIT, MA, USA Sep. 2000.
Forney, Jr., “On Iterative Decoding And The Two-Way Algorithm”,Proc. JSt Int'l Symp. Turbo Codes&Related Topics, Sep. 1997, Brest, France, pp. 12-25.
Gallager, “Low-Density Parity-Check Codes”,Cambridge, MA: MIT Press, 1963, pp. 1-90.
Khandekar et al., “A Lower Bound On The Iterative Decoding Threshold Of Irregular LDPC Code Ensembles”,Proc. 36th Ann '1 Conf Information Sci.&Sys., Mar. 2002, Princeton U., Princeton, NJ, USA.
Luby, et al., “Efficient Erasure Correcting Codes”,IEEE Transactions of Information Theory, Feb. 2001, 47, No. 2, pp. 569-584.
Luby et al., “Improved Low-Density Partiy-Check Codes Using Irregular Graphs”,IEEE Transactions of Information Theory, Feb. 201, 47, No. 2, pp. 585-598.
Miladinovic et al., “Improved Bit Flipping Decoding Of Low-Density Parity Check Codes”,Proc. Int'l Symp. Information Theory, Jun.-Jul. 2002, Lausanne, Switzerland, p. 229.
Richardson et al., “Design Of Capacity-Approaching Irregular Low-Density Parity-Check Codes”,IEEE Transactions of Information Theory, Feb. 2001, 47, No. 2, pp. 619-637.
Richardson et al., “The Capacity Of Low-Density Parity-Check Codes Under Message-Passing Decoding”,IEEE Transactions of Information Theory, Feb. 2001, vol. 47, No. 2, pp. 599-618.
Sipser et al., “Expander Codes”,Proc. 35th IEEE Symp. Found. Comp. Sci., Nov. 1994, Santa Fe, NM, USA, pp. 566-576.
Tanner, “A Recursive Approach To Low Complexity Codes”,IEEE Transactions of Information Theory, Sep. 1981, 27, No. 5, pp. 533-547.
ten Brink, “Convergence Behavior Of Iteratively Decoded Parallel Concatenated Codes” ,IEEE Transactions on Communications, Oct. 2001, 49, pp. 1727-1737.
Wiberg et al., “Codes and iterative decoding on general graphs”.Euro. Trans. Telecomm., Sep.-Oct. 1995-6, No. 5, pp. 513-526.
Wiberg, “Codes And Decoding On General Graphs”,Linkoping Univ., Linkoping, Sweden, Oct. 1996.
Zarkeshvari et al., “On implementation of Min-Sum algorithm for decoding low-density parity-check (LDPC) codes”,Proc. IEEE Global Telecommun. Conf—GLOBECOM, Nov. 2002, Taipei, Taiwan, pp. 1349-1353.
Zarrinkhat et al., “Density-Evolution And Convergence Properties Of Majority-Based Algorthims For Decoding Low-Density Parity-Check (LDPC) Codes”,Proc. 40th Ann 'I Allerton Conf Commun., Cont., &Computing, Oct. 2002, Allerton, IL, USA, pp. 1425-1434.
Zarrinkhat et al., “Density Evolution And Convergence Properties Of Hybrid Iterative Algorithms For Decoding Low-Density Parity-Check Codes”,Proc. 8th Can. Work. Inform. Theory, May 2003, Waterloo, ON, Canada, pp. 40-43.
Zarrinkhat et all, “Hybrid Decoding of Low-Density Parity-Check Codes”,Proc. 3rdInternational Symposium Turbo Codes&Related Topics, Sep. 2003, pp. 503-506.
Zarrinkhat et al., “Hybrid Decoding of Low-Density Parity-Check Codes”,IEEE Coinmun. Lett., Apr. 2004, 8, pp. 250-252.
Zarrinkhat, et al., “Hybrid Hard-Decision Iterative Decoding Of Regular Low-Density Parity-Check Codes”,Rec. IEEE Int'l Conf Commun.—ICC, Jun. 2004, Paris, France, pp. 435-439.
Zarrinkhat et al., “Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes”,Ann. Thl#commun. /Ann. Telecoinmun., accepted for publication.
Zarrinkhat et al., “Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes”,IEEE Trans. Commun., accepted for publication.

Affiliated with

Also associated with

Rating

Time-invariant hybrid iterative decoders does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Time-invariant hybrid iterative decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-invariant hybrid iterative decoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3753540