Method for selecting cyclic redundancy check polynomials for lin

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

714779, H03M 1300

Patent

active

060853492

ABSTRACT:
The method for selecting CRC polynomials (or CRC generators) for linear coded systems. In the exemplary embodiment, a communication system utilizes a concatenated code comprising a CRC code and a convolutional code. The CRC generators are selected based on the distance spectrums which have been computed for all possible CRC generators of a given length L. The distance spectrum comprises a listing of the number of paths (or code words) at various weights (or Hamming distance). These paths represent error information sequences I(x) which have diverged from an all-zero transmitted sequence (or the zero state) and have merged back into the zero state. The paths are checked by the CRC generators. If the CRC check passes, indicating that the error information sequence is undetected by the CRC check, the weight of this path is calculated and the distance spectrum for this CRC generator is updated. Otherwise, if the CRC does not check, the path is ignored. The CRC generator with the maximum minimum distance d.sub.min is selected.

REFERENCES:
patent: 4901307 (1990-02-01), Gilhousen et al.
patent: 4979174 (1990-12-01), Cheng et al.
patent: 5103451 (1992-04-01), Fossey
patent: 5103459 (1992-04-01), Gilhousen et al.
patent: 5132975 (1992-07-01), Avaneas
patent: 5550870 (1996-08-01), Blanker et al.
patent: 5577053 (1996-11-01), Dent
patent: 5710784 (1998-01-01), Kindred et al.
Andrew J Viterbi, Convoluntional Codes and Their Performance in communication System, IEEE, pp. 751 to 772, Oct. 1967.
J.Bibb Cain, Punctured Conventional Codes of Rate (n-1)
and Simplified Makimum Likelihood Decoding, IEEE, pp. 97 to 100, Jan. 1979.
"A Fast Algortihm for Computing Distance Spectrum of Convolutional Codes" by Cedervall et al.; IEEE Transactions on Information Theory, vol. 35 No. 6, Nov. 1989, pp. 1149-1160.
"Use of a Sequential Decoder to Analyze Convolutional Code Structure" by Forney, Jr.; IEEE Transactions on Information Theory, Nov. 1970, pp. 793-795.
"Optimum Cyclic Redundancy-Check Codes with 16-Bit Redundancy", IEEE Transactions on Communications, vol. 38 No. 1, Jan. 1990; New York, US pp. 111-114.

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

Method for selecting cyclic redundancy check polynomials for lin 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 for selecting cyclic redundancy check polynomials for lin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for selecting cyclic redundancy check polynomials for lin will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1496709

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