Folded successive cancelation decoding of polar codes

Kahraman, Sinan; Viterbo, Emanuele; Çelebi, M.E.

doi:10.1109/ausctw.2014.6766428

Cited by 7 publications

(23 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…folded SC decoder is way better than conventional SC decoder. In paper [Kahraman, 2014] more results are shown. In fig.…”

Section: Resultsmentioning

confidence: 97%

“…In previous method [Kahraman, 2014] shows folding only for 3 k  due to rapidly increasing complexity. In this method [Vangala, 2014], an alternative implementation of the multiple-folding SC decoder proposed, to significantly reduce its complexity.…”

Section: Improved Multiple Folded Sc Decodermentioning

confidence: 99%

“…In this paper some latest methods of SC decoding [Kahraman, 2014], [Vangala, 2014] and [Liu, 2015] are presented and compared for decoding complexity and BER performances.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

“…folded SC decoder is way better than conventional SC decoder. In paper [Kahraman, 2014] more results are shown. In fig.…”

Section: Resultsmentioning

confidence: 97%

Section: Improved Multiple Folded Sc Decodermentioning

confidence: 99%

See 1 more Smart Citation

Performance Review of Successive Cancellation Decoding Methods of Polar Codes

2016

IJSR

View full text Add to dashboard Cite

show abstract

“…In [13], it was shown that the choice of alternative foldings for any given polar code may be crucial on the decoding performance. In fact, some of the frozen information bits in d can be hidden in the folded group ϕ of 2 κ bits.…”

Section: Resultsmentioning

confidence: 99%

“…A single folded SCD (i.e. for κ = 1) was presented as a preliminary result in [13] and the dependence of the error performance on the alternative foldings was investigated. Here, we investigate the complexity of the proposed method in terms of the computational and memory requirements.…”

mentioning

confidence: 99%

Multiple Folding for Successive Cancelation Decoding of Polar Codes

Kahraman

Viterbo

Çelebi

2014

IEEE Wireless Commun. Lett.

Self Cite

View full text Add to dashboard Cite

Abstract-Polar coding is known as the first provably capacityachieving coding scheme under low-complexity suboptimal successive cancelation decoding (SCD). The large error-correction capability of finite-length polar codes is mostly achieved with relatively long codes. SCD is the conventional decoder for polar codes and exhibits a quasi-linear complexity in terms of the code length. Practical decoder schemes with low latency are important for high-speed polar coding applications. In this letter, we propose a nonbinary multiple folded SCD scheme to reduce the decoding latency of standard binary polar codes. Multiple foldings were first proposed to improve the efficiency of folded tree maximumlikelihood decoder for Kronecker product-based codes. By successively applying the folding operation κ times on the SCD, for a code length N , the latency is reduced from 2N − 1 to (N/2 κ−1 ) − 1 time slots, assuming full parallelization. We show that multiple folded SCD can be effectively implemented for up to κ = 3 foldings due to memory limitations. This decoder achieves exactly the same performance of the original SCD with significantly reduced latency.

show abstract

A new multiple folded successive cancellation decoder for polar codes

Vangala

Viterbo

Hong

2014

2014 IEEE Information Theory Workshop (ITW 2014)

Self Cite

View full text Add to dashboard Cite

We consider a new variant of successive cancellation decoder (SCD) for polar codes based on the concept of folding, which was proposed in [1], [2] as technique to reduce the decoding latency at the cost of a higher computational complexity. In this paper, we first formally define the multiple folding operation (iterated κ times), which decomposes the original encoding graph into a number of smaller polar encoding graphs. More specifically, we show that the multiple folding gives rise to a two stage interpretation of the graph representing the polar encoder and the SCD. Based on this, we propose the improved multiple folded successive cancellation decoder (IMFSCD), which combines SCD in one stage and maximum-likelihood decoding in the other. This decoder exhibits a latency gain by a factor of 2 κ , still retaining a complexity close to the classic SCD. The small increase in complexity is due to a short maximum likelihood decoder (MLD) used in place of a SCD in the last decoding stage within the IMFSCD. Moreover, we observe by simulation that the decoder performance is exactly the same as that of an SCD at all rates.Keywords-Successive cancellation decoder, multiple folded successive cancellation decoder, partial ML decoding of polar codes, low latency decoder, two stage polar encoder, two stage polar decoder, polar code concatenation.978-1-4799-5999-0/14/$31.00 ©2014 IEEE

show abstract

Folded successive cancelation decoding of polar codes

Cited by 7 publications

References 11 publications

Performance Review of Successive Cancellation Decoding Methods of Polar Codes

Performance Review of Successive Cancellation Decoding Methods of Polar Codes

Multiple Folding for Successive Cancelation Decoding of Polar Codes

A new multiple folded successive cancellation decoder for polar codes

Contact Info

Product

Resources

About