Fast-SSC-flip decoding of polar codes

Giard, Pascal; Burg, Andreas

doi:10.1109/wcncw.2018.8369026

Cited by 39 publications

(61 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational complexity of SCFlip increases slightly compared with SC decoder in the medium and high SNR regimes and its error-correction performance could compete with CRC-aided SCL with L = 2. Following the line of SCFlip decoder proposed in [17], many researches have been reported in the literature for improving the error-correction performance or reducing the computational complexity [18]- [25].…”

Section: B Sc and Scflip Decodingmentioning

confidence: 99%

“…Thus, we can get the lower bound and upper bound of the WER for our proposed SCFlip decoding in (18), where P OASC is the error probability of the perfect OASC decoding. .…”

Section: The Performance Analysismentioning

confidence: 99%

“…To boost the performance of conventional SCFlip decoders, many approaches have been reported in the literature, either to reduce the computational complexity or to enhance the error-correction performance. To reduce the complexity, a fast SCFlip decoder was proposed in [18] with a narrowed critical set for flipping (flip-bits set) such that the efficiency of flipping and re-decoding procedures could be improved and its hardware implementation was simplified. The authors in [19] further reduced the search zone in constructing the critical set by exploiting the code tree structure.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding

2020

View full text Add to dashboard Cite

Successive cancellation (SC) decoding of polar codes may bring about error propagation that needs to be mitigated. In this paper, we present a new SC Flipping (SCFlip) decoder, named bit error rate (BER) evaluation based SCFlip (BER-SCFlip), which can accurately target the first error bit and correct it with a high probability. Thus, a high error correction capability and a low decoding complexity can be achieved. First, we propose a new criterion to find out the most suspicious error bit. Those non-frozen bits that have higher decoding BERs derived from log-likelihood-ratios (LLRs) after SC decoding than the corresponding expected ones estimated via Gaussian Approximation (GA), are collected into the flip-bits set. These candidate bits will be flipped one by one according to their SC decoding orderings in extra decoding attempts until the decoded codeword passes cyclic redundancy check (CRC) or a predetermined maximum number of extra attempts is reached. We then propose an extended version of BER-SCFlip, named BER-SCFlip-ω with the capability to correct up to ω error bits in each extra decoding attempt. By combining our criterion for the flip-bits selection with that of Dynamic SCFlip (D-SCFlip), the proposed BER-SCFlip-ω significantly reduces decoding complexity and latency while maintaining the superior error-correction performance close to that of D-SCFlip-ω. The simulation results show that the proposed schemes are competitive among existing SCFlip algorithms and could achieve the error-correction performance approaching that of CRC-aided SCL decoding under list size L = 16 while maintaining low complexity. INDEX TERMS Polar codes, SC decoding, SCFlip decoding, Gaussian approximation.

show abstract

Section: B Sc and Scflip Decodingmentioning

confidence: 99%

“…Thus, we can get the lower bound and upper bound of the WER for our proposed SCFlip decoding in (18), where P OASC is the error probability of the perfect OASC decoding. .…”

Section: The Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding

2020

View full text Add to dashboard Cite

show abstract

“…The progressive SC-Flip decoding proposed in [13] constructs a critical set (CS) including the first error bit and then develops a multiple-layer-flip decoding. The Fast-SSC-Flip decoding, which merges the SCF [4] with the fast-simplified SC (Fast-SSC) [14], [16], was proposed in [17]. The Fast-SSC-Flip decoding extends the flip idea in [4] to four types of special nodes.…”

Section: Introductionmentioning

confidence: 99%

Improved Multiple Bit-Flipping Fast-SSC Decoding of Polar Codes

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Polar codes can provably achieve channel capacity and have been used in standards of the 5th generation wireless communication. As the first decoding algorithm of polar codes, successive cancellation (SC) suffers a significant error-correction performance loss at the moderate to short code length. The SC-Flip decoding aims to correct the first error in the SC decoding, and has the competitive error-correction performance compared with the SC decoding at the cost of high decoding latency. However, there may exist more than one errors in the SC decoding. Therefore, this paper proposes to enhance the fast-simplified SC (Fast-SSC) decoding to incorporate multiple bit-flipping, and further proposes two enhanced Fast-SSC-Flip decoding algorithms. One is a two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E 2) decoding algorithm based on the distribution of the second error (E 2) in the Fast-SSC decoding, and is further expanded to flip multiple bits based on the distribution of multiple errors. The other is a partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) decoding algorithm. The Fast-SSC decoder tree is divided into several partitions, on which the Fast-SSC-Flip decoding is performed. Compared with the traditional Fast-SSC-Flip decoding, the proposed Fast-SSC-2Flip-E 2 has an error-correction performance gain up to 0.2 dB while keeping the average complexity close to that of the traditional Fast-SSC-Flip. The decoding speed of the PA-Fast-SSC-Flip is up to 6 times faster than that of traditional Fast-SSC-Flip, and has an error-correction performance gain up to 0.16dB. INDEX TERMS Polar codes, error-correction performance, fast-simplified SC flip decoding, partitioned decoding, multiple bit-flipping.

show abstract

“…The techniques described in [4]- [6] rely on the recursive construction of polar codes to identify particular subcodes in their structure, and propose fast decoders for these subcodes that can be used in SC decoding. In [7]- [11], the decoding of some of these subcodes has been extended to SCL and applied to SC-flip, reducing their latency and making them more practical to implement.…”

Section: Introductionmentioning

confidence: 99%

Generalized Fast Decoding of Polar Codes

Condo

Bioglio

Land

2018

2018 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have been selected as one of the coding schemes in the 5 th generation wireless standard (5G). Over the years various polar code decoding algorithms, like SC-list (SCL), have been proposed to improve the mediocre performance of the successive cancellation (SC) decoding algorithm for finite code lengths; however, like SC, they suffer from long decoding latency. Fast decoding of polar codes tries to overcome this problem by identifying particular subcodes in the polar code and decoding them with efficient decoders. In this work, we introduce a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency. We propose three multi-node polar code subcodes whose identification patterns include most of the existing subcodes, extending them to SCL decoding, and allow to apply fast decoding to larger subsets of bits. Without any error-correction performance degradation, the proposed technique shows up to 23.6% and 29.2% decoding latency gain with respect to fast SC and SCL decoding algorithms, respectively, and up to 63.6% and 49.8% if a performance loss is accepted, whose amount depends on code and decoding algorithm parameters, along with the desired speedup.

show abstract

Fast-SSC-flip decoding of polar codes

Cited by 39 publications

References 12 publications

BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding

BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding

Improved Multiple Bit-Flipping Fast-SSC Decoding of Polar Codes

Generalized Fast Decoding of Polar Codes

Contact Info

Product

Resources

About