Low-complexity segmented CRC-aided SC stack decoder for polar codes

Song, Wenqing; Zhou, Huayi; Zhao, Yi; Zhang, Shunqing; You, Xiaohu; Zhang, Chuan

doi:10.1109/acssc.2016.7869560

Cited by 8 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…respectively, where L is the list width and D is the stack depth. A cyclic redundancy check (CRC)-assisted SCL algorithm was proposed in [10], [11]. In this scheme, CRC is added to the decoding path decision based on the SCL algorithm.…”

Section: Introductionmentioning

confidence: 99%

Multi-CRC Polar Codes and M-SCFlip-Based Decoding

2019

View full text Add to dashboard Cite

A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes. In this algorithm, the information sequence is optimized into several segments to allow decoding errors to be corrected in time, minimizing the impact of error propagation. An improved multi-successive cancellation bit flipping (M-SCFlip) decoding algorithm is proposed to execute the bit flipping operation after CRC check-in each segment. In the low-SNR region, the proposed new multi-CRC polar code with successive cancellation list (SCL) decoding has a slight frame-error rate (FER) degradation compared with the original CRC polar code. With the M-SCFlip decoding algorithm developed in this paper, it achieves a better FER performance compared with the CRC polar code with successive cancellation (SC) and SCL (L = 2) decoding algorithms. In addition, it has a lower decoding delay and requires a lower memory space. For example, at a FER of 10 −4 with the same code length and effective code rate, the proposed multi-CRC polar code with M-CFlip decoding achieves a 1.19 dB and 0.79 dB gains over existing CRC polar codes with the SC and SCL (L = 2) decoding algorithms, respectively.

show abstract

Section: Introductionmentioning

confidence: 99%

Multi-CRC Polar Codes and M-SCFlip-Based Decoding

2019

View full text Add to dashboard Cite

show abstract

“…Rather than considering only the locally most-likely value for each successive bit, as in SC decoding, the Successive Cancellation List (SCL) decoder [10], [26], [27] uses a breadth-first search for identifying the L number of locally most-likely bit values, allowing it to more frequently spot the globally most-likely values. By contrast, the Successive Cancellation Stack (SCS) decoder [11], [19] uses a depth-first approach to directly TABLE 1. Summary of the error correction capability, computational complexity and memory requirement of various polar decoding algorithms.…”

mentioning

confidence: 99%

“…As an additional benefit, the CRC can enable error detection, although this ability is degraded by using the CRC to aid error correction in the manner described above. Furthermore, the distributed CRC technique allows early termination of the SCL or SCS decoding, further reducing the decoding complexity [18], [19], [35].…”

mentioning

confidence: 99%

“…Note that a Parity Check (PC) code is concatenated with the polar code in the case of PUCCH and PUSCH with information block lengths in the range A ∈[12,19] bits[39]. We will apply our proposed Log-SCS to this case in future work.…”

mentioning

confidence: 99%

“…Note that a 6-bit CRC having the polynomial D 6 + D5 + 1 is used to aid the PC polar code used for A ∈[12,19] in 3GPP NR PUCCH and PUSCH.…”

mentioning

confidence: 99%

See 2 more Smart Citations

CRC-Aided Logarithmic Stack Decoding of Polar Codes for Ultra Reliable Low Latency Communication in 3GPP New Radio

et al. 2019

View full text Add to dashboard Cite

This paper provides a detailed tutorial on the Cyclic Redundancy Check (CRC)-aided logarithmic successive cancellation stack (Log-SCS) algorithm. We apply these algorithms for the ultrareliable decoding of polar codes, which has relevance for the control channels of the ultra-reliable low latency communication version of the third generation partnership project (3GPP) New Radio (NR). During the exploitation of the CRC codes to improve the error correction performance, we propose a novel technique which limits the number of CRC checks performed, in order to maintain a consistent error detection performance. In addition, we propose a pair of techniques for further improving the performance of the Log-SCS polar decoder. We demonstrate that the proposed S = 128 Improved Log-SCS decoder achieves a similar error correction capability as a logarithmic successive cancellation list (Log-SCL) decoder having a list size of L = 128 across the full range of block lengths supported by the 3GPP NR physical uplink control channel. This is achieved without increasing its memory requirement, while dramatically reducing its complexity, which becomes up to seven times lower than that of a L = 8 Log-SCL decoder.

show abstract

Flexible and Adaptive Path Splitting of Simplified Successive Cancellation List Polar Decoding

Shen

Zhang

et al. 2019

2019 IEEE 13th International Conference on ASIC (ASICON)

View full text Add to dashboard Cite

Low-complexity segmented CRC-aided SC stack decoder for polar codes

Cited by 8 publications

References 8 publications

Multi-CRC Polar Codes and M-SCFlip-Based Decoding

Multi-CRC Polar Codes and M-SCFlip-Based Decoding

CRC-Aided Logarithmic Stack Decoding of Polar Codes for Ultra Reliable Low Latency Communication in 3GPP New Radio

Flexible and Adaptive Path Splitting of Simplified Successive Cancellation List Polar Decoding

Contact Info

Product

Resources

About