| US 7,370,258 B2 | ||
| Iterative concatenated convolutional Reed-Solomon decoding method | ||
| Daniel Iancu, Pleasantville, N.Y. (US); Hua Ye, Durham, N.C. (US); and John Glossner, Carmel, N.Y. (US) | ||
| Assigned to Sandbridge Technologies Inc., White Plains, N.Y. (US) | ||
| Filed on Apr. 28, 2005, as Appl. No. 11/116,340. | ||
| Prior Publication US 2006/0248430 A1, Nov. 02, 2006 | ||
| Int. Cl. H03M 13/29 (2006.01) | ||
| U.S. Cl. 714—755 | 19 Claims |
| 1. A method of decoding an encoded data stream of bits comprising:
inner concatenated convolutional decoding the bits to produce hard decision of coded bit information and a soft decision of
reliability bit information for each bit;
deinterleaving the coded and reliability bit information; and
outer decoding the deinterleaved coded and reliability bit information by
a) first decoding by error correction decoding for r errors per word;
b) terminating the decoding and outputting a decoded word if the syndromes of a corrected word of the first decoding are all
zeros,
c) second decoding by error correcting and erasure decoding for the number of error decreased by one and the number of erasures
increased by two if the syndromes of the corrected word of the first decoding are not all zeros,
d) terminating the decoding and outputting a decoded word if the syndromes of a corrected word of the second decoding are
all zeros, and
e) repeating the second decoding by error correcting and erasure decoding for the number of errors decreased by one and the
number of erasures increased by two for each iteration of the second decoding if the syndromes of the corrected word of the
previous second decoding are not all zeros.
|