Decoder performance for block product codes

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S786000

Reexamination Certificate

active

10899337

ABSTRACT:
A method of improving block turbo decoder performance that comprises receiving soft input information corresponding to a first set of constituent codes of a block product code, scaling soft extrinsic information from a second set of constituent codes of the block product code, processing the scaled soft extrinsic information and the soft input information to produce soft output information suitable for a soft-input soft-output decoder, and performing one or more of: modifying encoded bit positions of the block product code, modifying decoded bit positions of a the block product code, permuting decoding parameters of the block product code to effect a preferred decoding order, detecting cases where a number of test patterns is insufficient to decode the soft output information and thereafter providing a different number of test patterns suitable for decoding the soft output information, and adapting the number of test patterns in the soft-input soft-output decoder.

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: 6460160 (2002-10-01), Classon
patent: 2001/0050622 (2001-12-01), Hewitt et al.
patent: 2002/0026615 (2002-02-01), Hewitt et al.
patent: WO 0019616 (2000-04-01), None
Argon et al., An efficient Chase decoder for Turbo product codes, Jun. 6, 2004, IEEE Trans. on Comm. vol. 52, No. 6, p. 896-898.
Arico et al. Limited trial Chase Decoding, Nov. 2003, IEEE Trans. on Info. THeory, vol. 49, No. 11, p. 2972-2975.
Chen et al. A very low complexity block turbo decoder composed of extended Hamming codes, 2001, IEEE, p. 171-175.
Pyndiah et al., A very low complexity block turbo decoder for product codes, 1996, IEEE, p. 101-105.
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.
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.
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.

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

Decoder performance for block product 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 Decoder performance for block product codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoder performance for block product codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3834243

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