An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check

Li, Bin; Shen, Hui; Tse, David

doi:10.1109/lcomm.2012.111612.121898

Cited by 327 publications

(225 citation statements)

References 6 publications

Supporting

Mentioning

223

Contrasting

Unclassified

Order By: Relevance

“…As reported in [17]- [19], polar codes can outperform turbo codes and LDPC codes that are used in wireless standards when SCL+CRC decoding is adopted. Moreover, it was shown in [19] that polar codes with SCL+CRC decoding achieve near the Polyanskiy bound for finite-length codes.…”

Section: Polar Codes Vs Ldpc Codesmentioning

confidence: 94%

“…Moreover, it was shown in [19] that polar codes with SCL+CRC decoding achieve near the Polyanskiy bound for finite-length codes. In [35], the authors verified the advantage of short block-length polar codes in additive white Gaussian noise (AWGN) channels even when compared to recently proposed Pareto-optimal LDPC codes [7], which show the best trade-off between threshold and decoding complexity by optimizing the degree distribution for finite-iteration decoding via EXIT trajectory.…”

Section: Polar Codes Vs Ldpc Codesmentioning

confidence: 99%

“…Since we considered only VN processing without including any extra operations (e.g., sorting), reduced complexity techniques (e.g., [19], [45]), hardware architecture etc., the actual computational complexity can vary greatly depending on hardware implementation. Nevertheless, the general trend described above holds at short block lengths, and most prototyping studies such as [17] have already revealed that the polar codes can compete favorably with LDPC codes in terms of complexity.…”

Section: Computational Complexitymentioning

confidence: 99%

See 2 more Smart Citations

Irregular Polar Coding for Complexity-Constrained Lightwave Systems

Koike‐Akino

Cao

Wang

et al. 2018

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-Next-generation fiber-optic communications call for ultra-reliable forward error correction (FEC) codes that are capable of low-power and low-latency decoding. In this paper, we propose a new class of polar codes, whose polarization units are irregularly pruned to reduce computational complexity and decoding latency without sacrificing error correction performance. We then experimentally demonstrate that the proposed irregular polar codes can outperform state-of-the-art LDPC codes, while decoding complexity and latency can be reduced by at least 30% and 70%, respectively, versus regular polar codes, while also obtaining a marginal performance improvement.

show abstract

Section: Polar Codes Vs Ldpc Codesmentioning

confidence: 94%

Section: Polar Codes Vs Ldpc Codesmentioning

confidence: 99%

Section: Computational Complexitymentioning

confidence: 99%

See 1 more Smart Citation

Irregular Polar Coding for Complexity-Constrained Lightwave Systems

Koike‐Akino

Cao

Wang

et al. 2018

J. Lightwave Technol.

View full text Add to dashboard Cite

show abstract

“…The actual time complexity of SCS decoding is far below than that of SCL in the high-SNR regime and is close to SC decoding. SCH algorithm combines the advantages of SCL and SCS, and the performance of SCH is close to that of maximum likelihood (ML) [12]. The researchers of Huawei proposed the adaptive CA-SCL (aCA-SCL) [13] decoding algorithm based on CA-SCL algorithm.…”

Section: Introductionmentioning

confidence: 99%

High‐Throughput Fast‐SSC Polar Decoder for Wireless Communications

Zhang

Yan

Zeng

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Polar code has been proven to achieve the symmetric capacity of memoryless channels. However, the successive cancellation decoding algorithm is inherent serial in nature, which will lead to high latency and low throughput. In order to obtain high throughput, we design a deeply pipelined polar decoder and optimize the processing elements and storage structure. We also propose an improved fixed-point nonuniform quantization scheme, and it is close to the floating-point performance. Two-level control strategy is presented to simplify the controller. In addition, we adopt FIFO structure to implement the memory and memory and propose the 348-stage pipeline decoder.

show abstract

“…The standard SC decoding algorithm presented in [Tal, 2015] have ( log ) O N N decoding complexity, where N is the code length. But for achieving channel capacity it requires large size of block length so in that way to reduce block length and hence reduced decoding complexity and improve BER many methods [Li, 2012], [Chan, 2013] and [Haung, 2013] have been introduced.…”

Section: Introductionmentioning

confidence: 99%

Performance Review of Successive Cancellation Decoding Methods of Polar Codes

2016

IJSR

View full text Add to dashboard Cite

Abstract:The first provably capacity achieving codes with low complexity named polar codes were discovered recently and the successive cancellation (SC) decoding is widely known decoding algorithm for polar codes. There are many techniques like folded SC and permuted SC available for improve the SC decoding algorithm. In this paper, we study the different methods of SC decoding for polar codes which are recently developed and give a comparison based on bit error rate (BER) and decoding complexity.

show abstract

An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check

Cited by 327 publications

References 6 publications

Irregular Polar Coding for Complexity-Constrained Lightwave Systems

Irregular Polar Coding for Complexity-Constrained Lightwave Systems

High‐Throughput Fast‐SSC Polar Decoder for Wireless Communications

Performance Review of Successive Cancellation Decoding Methods of Polar Codes

Contact Info

Product

Resources

About