Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2007-12-18
2007-12-18
Torres, Joseph D. (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S784000, C714S780000, C714S794000
Reexamination Certificate
active
10899376
ABSTRACT:
A method and structure of processing soft information in a block code decoder, includes a soft-input soft-output decoder receiving a length n soft input vector, creating a binary vector Y corresponding to the soft input vector, hard decoding each linear function Xi of Y and a test pattern Zi of one or more test patterns, wherein if the hard decoding is successful a codeword produced by the hard decoding of Xi is added to a set S, removing redundant codewords in S to form a reduced set S′ based on processing a number of errors found during the hard decoding and a guaranteed error correcting capability of the block code decode, and an extrinsic value estimator generating n soft outputs based on c estimated soft output values and (n-c) non-estimated soft output values wherein the c estimated soft output values are computed from one or more positions of soft input vector and one or more codewords in S′.
REFERENCES:
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5930272 (1999-07-01), Thesling
patent: 6065147 (2000-05-01), Pyndiah et al.
patent: 6122763 (2000-09-01), Pyndiah et al.
patent: 2001/0050622 (2001-12-01), Hewitt et al.
patent: 2002/0026615 (2002-02-01), Hewitt et al.
patent: 2002/0124223 (2002-09-01), Thesling et al.
patent: 2003/0070131 (2003-04-01), Fujita et al.
patent: 2003/0126546 (2003-07-01), Fujita et al.
patent: 2005/0031025 (2005-02-01), Xie et al.
patent: 2006/0020874 (2006-01-01), Desai et al.
patent: WO0019616 (2000-11-01), None
Kaneko, T.; Nishijima, T.; Inazumi, H.; Hirasawa, S.; An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder; IEEE Transactions on Information Theory, vol. 40, Issue 2, Mar. 1994 pp. 320-327.
Gazelle, David et al. “Reliability-Based Code-Search Algorithms for Maximum-Likelihood Decoding of Block Codes”.IEEE Transactions on Information Theory, Jan. 1997, pp. 239-249, vol. 43, No. 1.
Chase, David. “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information.” IEEE Transactions on Information Theory, Jan. 1972, pp. 170-182, vol. IT-18, No. 1.
Elias, Peter. “Error-Free Coding”. Department of Electrical Engineering and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Massachusetts, pp. 29-37, no date.
Hagenauer, Joachim. “Iterative Decoding of Binary Block and Convolutional Codes”. IEEE Transactions on Information Theory, Mar. 1996, pp. 429-445, vol. 42, No. 2.
IEEE Transactions on Information Theory, Mar. 1974, pp. 284-287.
Kaneko, Toshimitsu, et al. “An Improvement of Soft-Decision Maximum-Likelihood Decoding Algorithm Using Hard-Decision Bounded-Distance Decoding”. IEEE Transactions on Information Theory, Jul. 1997, pp. 1314-1319, vol. 43, No. 4.
Pyndiah, Ramesh Mahendra. “Near-Optimum Decoding of Product Codes: Block Turbo Codes”. IEEE Transactions on Communications, Aug. 1998, pp. 1003-1010, vol. 46, No. 8.
“TIA Standard”. Telecommunications Industry Association, Mar. 11, 2003, pp. 1-49, WAI SAM CHC Specification, TIA-902.BAAD.
Blankenship Yufei W.
Classon Brian K.
Desai Vipul A.
Motorola Inc.
Torres Joseph D.
LandOfFree
Decoding block 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 block codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding block codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3835239