초록 ▼

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 comp

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.

대표청구항

[ I claim:] [1.] A method for selecting CRC generators in a concatenated code comprising the steps of:computing distance spectrums for all CRC generators of a given length;selecting optimal CRC generators from said distance spectrums.

[ I claim:] [1.] A method for selecting CRC generators in a concatenated code comprising the steps of:computing distance spectrums for all CRC generators of a given length;selecting optimal CRC generators from said distance spectrums.