Interleaved cyclic redundancy check (CRC) code

Jun Jin Kong, Keshab K Parhi

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)2137-2141
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
StatePublished - Dec 1 2003
EventConference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 9 2003Nov 12 2003


Dive into the research topics of 'Interleaved cyclic redundancy check (CRC) code'. Together they form a unique fingerprint.

Cite this