Improved Fast-SSC-Flip Decoding of Polar Codes

Zhou, Yangcan; Lin, Jun; Wang, Zhongfeng

doi:10.1109/lcomm.2019.2910059

Cited by 14 publications

(19 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is because the PA-Fast-SSC-Flip has the ability to flip up to S × T max bits, enhancing the probability of identifying the error location. When compared with the Fast-SSC-Flip [19], the error-correction performance of PA-Fast-SSC-Flip is close to that of Fast-SSC-Flip [19]. It also can be observed that at low E b /N 0 , the PA-Fast-SSC-Flip performance is close to the SC-Oracle, since it can correct more than one errors.…”

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 61%

“…15. On the other hand, the worst case T axe2 of PA-Fast-SSC-Flip with S = 2 is only 50% about that of Fast-SSC-Flip [17] and 60% about that of Fast-SSC-Flip [19], for both T max = 8 and T max = 16. At higher E b /N 0 , T axe2 of PA-Fast-SSC-Flip converges to that of Fast-SSC as 0.…”

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 92%

“…In Fig. 11, the number of partitions is changed into S = 4, it can be noticed that the advantage of PA-Fast-SSC-Flip over the Fast-SSC-Flip [17] decreases at E b /N 0 = 2.25dB, and advantage of PA-Fast-SSC-Flip over the Fast-SSC-Flip [19] decreases at E b /N 0 = 1.5dB. This is because the CRC distribution becomes more sub-optimal with increasing partition S. In addition, the error-correction performance is given in Fig.…”

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 98%

“…The error-correction performance of PA-Fast-SSC-Flip is compared with Fast-SSC, Fast-SSC-Flip [17], Fast-SSC-Flip [19] and SC-Oracle. The length of CRC code in each partition is 8 and the CRC generator polynomial is g(x) = x 8 + x 2 + x + 1.…”

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 99%

“…The Fast-SSC-Flip decoding extends the flip idea in [4] to four types of special nodes. Then, two enhanced Fast-SSC-Flip decoding algorithms proposed in [18] and [19] use these new nodes [20] to further reduce the number of iterations in decoding.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 61%

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 92%

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 98%

Section: B the Pa-fast-ssc-flip Decodingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

Highly reliable DHR-based polar compilation code communication method

Zheng,

Gu,

Liu

et al. 2024

Computer Networks

View full text Add to dashboard Cite

A latency‐reduced SC flip decoding algorithm for polar codes

2022

View full text Add to dashboard Cite

The successive cancellation flip (SC Flip) decoding algorithm was recently suggested for decoding polar codes, which could improve the performance of the frame error rate (FER). The performance of the SC Flip (SCF) decoding algorithm is strong, and its computational complexity tends to be the same as that of the SC decoder at medium to high signal-tonoise ratios (SNRs). However, the decoding latency of the SCF decoding algorithm is large. In this paper, a new method for detecting whether or not the flipped bit is correct is proposed. The proposed method makes a decision according to the changing log likelihood ratio (LLR) value caused by the flipped bit to ensure that the decoding process can be terminated in advance and the decoding latency is reduced. The simulation results show that the proposed Latency-Reduced SCF decoding algorithm can decrease computational complexity and decoding latency, while also achieving similar decoding performance compared to its counterpart.

show abstract

Improved Fast-SSC-Flip Decoding of Polar Codes

Cited by 14 publications

References 13 publications

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

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

Highly reliable DHR-based polar compilation code communication method

A latency‐reduced SC flip decoding algorithm for polar codes

Contact Info

Product

Resources

About