Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2006-09-01
2010-11-30
Alphonse, Fritz (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S755000, C714S785000
Reexamination Certificate
active
07844877
ABSTRACT:
Data bits to be encoded are split into a plurality of subgroups. Each subgroup is encoded separately to generate a corresponding codeword. Selected subsets are removed from the corresponding codewords, leaving behind shortened codewords, and are many-to-one transformed to condensed bits. The final codeword is a combination of the shortened codewords and the condensed bits. A representation of the final codeword is decoded by being partitioned to a selected subset and a plurality of remaining subsets. Each remaining subset is decoded separately. If one of the decodings fails, the remaining subset whose decoding failed is decoded at least in part according to the selected subset. If the encoding and decoding are systematic then the selected subsets are of parity bits.
REFERENCES:
patent: 4633470 (1986-12-01), Welch et al.
patent: 4736376 (1988-04-01), Stiffler
patent: 6330277 (2001-12-01), Gelblum et al.
patent: 6430722 (2002-08-01), Eroz et al.
patent: 6487693 (2002-11-01), Kim et al.
patent: 6516035 (2003-02-01), Wang et al.
patent: 6526531 (2003-02-01), Wang
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6731696 (2004-05-01), Gelblum et al.
patent: 6842491 (2005-01-01), Gelblum et al.
patent: 6865708 (2005-03-01), Wang
patent: 7356752 (2008-04-01), Hewitt et al.
patent: 2002/0147954 (2002-10-01), Shea
patent: 2004/0148560 (2004-07-01), Hocevar
patent: 2005/0003756 (2005-01-01), Sun et al.
patent: 2005/0091565 (2005-04-01), Eroz et al.
patent: 2005/0091570 (2005-04-01), Eroz et al.
patent: 2005/0149815 (2005-07-01), Eroz et al.
patent: 2005/0160350 (2005-07-01), Dror et al.
patent: 2005/0193320 (2005-09-01), Varnica et al.
patent: 2005/0204256 (2005-09-01), Yeh et al.
patent: 2005/0229087 (2005-10-01), Kim et al.
patent: WO2005022814 (2006-03-01), None
Shannon, “A mathematical theory of communications” Bell System Telephone Journal, vol. 27, 1948, pt. I, pp. 379-423; pt. II pp. 623-656.
M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi and D. A. Spielman, “Improved low density parity-check codes using irregular graphs and belief propagation,”Proc. of the IEEE Int. Symp. on Inf. Theory(ISIT), p. 117, 1998.
R. G. Gallager, “Low-density parity-check codes,”IRE Trans. Info. Theory, vol. IT-8, pp. 21-28, 1962.
T. J. Richardson and R. Urbanke, “The capacity of low-density parity-check codes under message passing decoding,”IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, 2001.
C. Berron, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error correcting coding and decoding: Turbo codes,” in IEEE Int. Conf. On Communications, 1993, pp. 1064-1070.
M. M. Mansour and N. R. Shanbhag, “High-Throughput LDPC Decoders,”IEEE Trans. on Very Large Scale Integration Systems, vol. 11,pp. 976-995, 2003.
T. J. Richardson, A. Shokrollahi and R. Urbanke, “Design of capacity approaching low-density parity-check codes,”IEEE Trans. Inform. Theory, vol. 47, pp. 619{637, 2001.
E.Sharon, S.Litsyn, J.Goldberger “An Efficient Message-Passing Schedule for LDPC Decoding,” in proc. 23rd IEEE Convention in Tel-Aviv, Israel, pp. 223-226, Sep. 6-7, 2004.
R. M. Tanner, “A recursive approach to low complexity code”IEEE Trans. on Info. Theory, vol. 27(5), pp. 533-547, 1981.
J. Zhang and M. Fossorier, “Scheduled belief propagation decoding,”The Proceedings 36th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, vol. 1, pp. 8-15, 2002.
Error-correcting codes , second edition , W. Wesley Peterson, E.J. Weldon.
Elwyn R. Berlekamp / Algebraic Coding Theory, Revised 1984 Edit.
Error-Correcting Codes and Finite Fields / Oliver Pretzel.
R.E.Blahut, Theory and Practice of Error-Correcting codes, Addison-Wesley, 1983.
W.G.Chambers, R.E.Peile, K.Y.Tsie, and N.Zein, An algorithm for solving the Welch-Berlekamp key-equation with a simplified proof, Electronic Letters, vol. 29, 1993, pp. 1620-1621.
V.Guruswami and M.Sudan, Improved decoding of Reed-Solomon and Algebraic-Geometry codes, IEEE Trans. Inform. Theory, 6, 1999, pp. 1757-1767.
D. Mandelbaum, Decoding of erasures and errors for certain RS codes by decreased redundancy, IEEE Trans. Inform. Theory, vol. 28, 2, 1982, pp. 330-336.
J.L.Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory, vol. 15, 1969, pp. 122-127.
TM Synchronization and Channel Coding-Summary of Concept Rationale , Report Concerning Space Data System Standards , Informational Report Green Book Jun. 2006.
Nefedov N et al.:“Performance of Low Complexity Concatenated Codes Formed by Differentail Encoders” Proceedings of the International Conference on Telecommunicationsict, XX,XX, vol. 1, Jun. 23, 2002, pp. 151-155, XP009037088, p. 151, right-hand column-p. 152, left hand column, figures 2,3.
Barbulescu A S et al:“Rate compatible turbo codes” Electronics Letters, IEE Stevenage, GB, vol. 31, No. 7, Mar. 30, 1995, pp. 535-536, XP006002664, ISSN: 0013-5194, Figure 1.
Alrod Idan
Lasser Menahem
Litsyn Simon
Sharon Eran
Alphonse Fritz
Friedman Mark M.
Ramot at Tel Aviv University Ltd.
LandOfFree
Method and device for multi phase error-correction 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 device for multi phase error-correction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and device for multi phase error-correction will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4203744