Interleaved cyclic redundancy check (CRC) code
| Autor: | Keshab K. Parhi, Jun Jin Kong |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Theoretical computer science
Interleaving Polynomial code Error floor Computer science Concatenated error correction code Code word Data_CODINGANDINFORMATIONTHEORY Longitudinal redundancy check Cyclic code Cyclic redundancy check ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Error detection and correction Algorithm Decoding methods Computer Science::Information Theory |
| Zdroj: | The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003. |
| DOI: | 10.1109/acssc.2003.1292358 |
| Popis: | In this paper, we investigate interleaved cyclic redundancy check (CRC) code. The interleaved CRC can be obtained by merging independent small message blocks into one large block (merged interleaving) or by dividing the original message block into independent small sub blocks (divided interleaving) and then by alternatively dividing the resulting message block(s) using same generator polynomial. The interleaved CRC increases both the detection span and the detectable error patterns. New applications of the interleaved CRC as the error detection scheme or stopping criteria in interleaved error correction coding and iterative decoding schemes are proposed. Since each individual codeword of interleaved CRC code is mutually independent, it is possible to generate CRC in interleaved manner and to check CRC in parallel manner. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|