Improved Successive Cancellation Decoding of Polar Codes

Chen, Kai; Niu, Kai; Lin, Jiaru

doi:10.1109/tcomm.2013.070213.120789

Cited by 188 publications

(105 citation statements)

References 29 publications

Supporting

Mentioning

104

Contrasting

Unclassified

Order By: Relevance

“…6, we can see that the performance of the proposed decoder using the different grouping method can be improved significantly. Compared with the CRC-SCL (L = 32) [17,18], the proposed decoder with the parameters (10, 50, 3) provides about 0.2 dB performance gains at an FER = 10 −4 . Additionally, the damping coefficients of the proposed algorithm must be carefully chosen to control the updating step width.…”

Section: Simulation Resultsmentioning

confidence: 99%

Enhanced belief propagation decoding of polar codes by adapting the parity-check matrix

Jiao

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

Though the performance of belief propagation (BP) decoder for polar codes is comparable with the successive cancellation (SC) decoder, it has significant performance gap when compared with the improved SC decoders, such as SC list (SCL) decoding. In this paper, we propose an improved BP decoding for polar codes with good performance by adapting their parity-check matrices. The decoding process is iterative and consists of two parts. Firstly, the parity-check matrix of polar codes is adjusted such that one of its submatrices corresponding to less reliable bits is in a sparse nature. Secondly, the BP decoding is applied to the adjusted parity-check matrix. Simulation results show that the proposed decoder, when accompanied with the early termination scheme, provides significant performance gains over the original polar BP decoder under a relatively low decoding complexity and even competes with the cyclic redundancy check (CRC)-aided SCL (CRC-SCL) decoder only by increasing a tolerate complexity.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Enhanced belief propagation decoding of polar codes by adapting the parity-check matrix

Jiao

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The decoding process would not stop until the top path in the stack reaches length N, then the top path is the decode result [7]. If the stack is full before the result comes out, we abandon the paths from the bottom of the stack.…”

Section: Stack Successive Cancellation Decodingmentioning

confidence: 99%

Multi-stack Decoding of Polar Codes

Zhang

2016

Proceedings of the 2015 International Conference on Communications, Signal Processing, and Systems

View full text Add to dashboard Cite

A successive cancellation multi-stack (SCMS) decoding is proposed to improve the performance of polar codes. Unlike the successive cancellation stack (SCS) decoding algorithm which just uses one ordered stack to store the candidate partial paths and attempts to find out the optimal estimation in the stack, the SCMS algorithm uses several stacks to obtain better performance at the same space complexity. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGN) show that the SCMS algorithm can achieve an improvement of about 0.2 dB.

show abstract

“…In order to improve the time and space complexity of the SC decoder, Niu proposed successive-cancellation stack (SCS) algorithms [4]. The successive-cancellation hybrid (SCH) algorithm combines the features of SCL and SC and approaches the performance of ML decoding with acceptable complexity [5]. These SC decoders can achieve good error-correcting capability with low complexity, however, for high-speed real-time applications, this serial decoding scheme of polar codes poses the challenge of high throughput and latency.…”

Section: 이 논문은 교육부 및 한국연구재단의 기본연구에 의해 지 원되었음(Nrf-2014r1a1a2058152) *mentioning

confidence: 99%

Enhanced Belief Propagation Polar Decoder for Finite Lengths

Iqbal¹,

Choi²

2015

Journal of the Korea Society of Digital Industry and Informatio

View full text Add to dashboard Cite

In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal.Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of    .

show abstract

Improved Successive Cancellation Decoding of Polar Codes

Cited by 188 publications

References 29 publications

Enhanced belief propagation decoding of polar codes by adapting the parity-check matrix

Enhanced belief propagation decoding of polar codes by adapting the parity-check matrix

Multi-stack Decoding of Polar Codes

Enhanced Belief Propagation Polar Decoder for Finite Lengths

Contact Info

Product

Resources

About