Topic
Cyclic redundancy check
About: Cyclic redundancy check is a research topic. Over the lifetime, 2669 publications have been published within this topic receiving 26115 citations. The topic is also known as: CRC & CRC8.
Papers published on a yearly basis
Papers
More filters
TL;DR: Simulation results show that CA-SCL/SCS can provide significant gain over the turbo codes used in 3GPP standard with code rate 1/2 and code length 1024 at the block error probability (BLER) of 10-4.
Abstract: CRC (cyclic redundancy check)-aided decoding schemes are proposed to improve the performance of polar codes. A unified description of successive cancellation decoding and its improved version with list or stack is provided and the CRC-aided successive cancellation list/stack (CA-SCL/SCS) decoding schemes are proposed. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that CA-SCL/SCS can provide significant gain of 0.5 dB over the turbo codes used in 3GPP standard with code rate 1/2 and code length 1024 at the block error probability (BLER) of 10-4. Moreover, the time complexity of CA-SCS decoder is much lower than that of turbo decoder and can be close to that of successive cancellation (SC) decoder in the high SNR regime.
722 citations
28 Jun 2004
TL;DR: A polynomial selection process for embedded network applications is described and a set of good general-purpose polynomials are proposed that provide good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.
Abstract: Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly less error detection capability than they might. An exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths. Unfortunately these shortcomings and limitations often seem to be overlooked. This paper describes a polynomial selection process for embedded network applications and proposes a set of good general-purpose polynomials. A set of 35 new polynomials in addition to 13 previously published polynomials provides good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.
393 citations
TL;DR: In this paper, an adaptive SC-List decoder for polar codes with CRC was proposed, which iteratively increases the list size until at least one survival path can pass CRC.
Abstract: In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until at least one survival path can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large maximum list size can achieve a frame error rate FER ≤ 10-3{-3} at Eb/No = 1.1dB, which is about 0.25dB from the information theoretic limit at this block length.
316 citations
TL;DR: The theory of cyclic redundancy codes (CRS) is reviewed, and four software algorithms for performing CRC computations are described: table lookup, reducedtable lookup, on-the-fly, and wordwise.
Abstract: The theory of cyclic redundancy codes (CRS) is reviewed. Four software algorithms for performing CRC computations are described: table lookup, reduced table lookup, on-the-fly, and wordwise. They are compared in terms of their speeds and storage requirements. >
245 citations
Posted Content•
TL;DR: It is demonstrated that polar code with 24-bit CRC decoded by the proposed adaptive SC-List decoder with very large maximum list size can achieve a frame error rate FER ≤ 10-3{-3} at Eb/No = 1.1dB, which is about 0.25dB from the information theoretic limit at this block length.
Abstract: In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic limit at this block length.
245 citations