Multiple Folding for Successive Cancelation Decoding of Polar Codes

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

doi:10.1109/lwc.2014.2343970

Cited by 7 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The complexity increased by 22K in best implementation, where K represents the number of folding [10]. Multiple folding are employed to reduce the latency in the decoder [11] but increases the computation complexity. Feedback and feed-forward implementations of the encoder reduced the complexity and enhanced the speed of operation [14].…”

Section: Related Workmentioning

confidence: 99%

Low Power, Area Efficient Architecture for Successive Cancellation Decoder

James

Lakshminarayanan

2022

EMITTER Int'l J. of Engin. Technol.

View full text Add to dashboard Cite

Polar codes have recently emerged as an error-correcting code and have become popular owing to their capacity-achieving nature. Polar code based communication system primarily consists of two parts, including Polar Encoder and Decoder. Successive Cancellation Decoder is one of the methods used in the decoding process. The Successive Cancellation Decoder is a recursive structure built with the building block called Processing Element. This article proposes a low power, area-efficient architecture for the Successive Cancellation Decoder for polar codes. Successive Cancellation Decoder with code length 1024 and code rate 0.5 was designed in Verilog HDL and implemented using 45-nm CMOS technology. The proposed work focuses on developing an area-efficient Successive Cancellation Decoder architecture by presenting a new Processing Element architecture. The proposed architecture has produced about 35% lesser area with a 12% reduced gate count. Moreover, power is also reduced by 50%. A substantial reduction in the latency and improvement in the Technology Scaled Normalized Throughput value was observed.

show abstract

Section: Related Workmentioning

confidence: 99%

Low Power, Area Efficient Architecture for Successive Cancellation Decoder

James

Lakshminarayanan

2022

EMITTER Int'l J. of Engin. Technol.

View full text Add to dashboard Cite

show abstract

“…The upper and lower decoders can be folded again in order to further reduce latency (Xiang et al, 2020). The multiple folding technique consists of applying the same operation several times (Kahraman et al, 2013), (Kahraman et al, 2014b). Note that a similar folding operation can be obtained by splitting the even and odd code bits into two parts and applying the polar transform in the opposite direction.…”

Section: Bidirectional Stack Decoding Algorithmmentioning

confidence: 99%

“…This approach known as folding, was introduced in (Kahraman et al, 2013). Several decoding algorithms based on the folding technique were proposed in (Kahraman et al, 2014a), (Kahraman et al, 2014b), (Vangala et al, 2014a), (Vangala et al, 2014b), (Huang et al, 2018). A reduced latency implementation of the SCSD was given in (Xiang et al, 2020).…”

mentioning

confidence: 99%

Bidirectional stack decoding of polar codes

Minja¹,

Dobromirov²,

Šenk³

2021

Vojnotehnički glasnik

View full text Add to dashboard Cite

Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for decoding tree codes, the list decoding technique introduced by Peter Elias and the folding technique for polar codes which is used to reduce the latency of the decoding algorithm. The simulation was done using the Monte Carlo procedure. Results: A new polar code decoding algorithm, suitable for parallel implementation, is developed and the simulation results are presented. Conclusions: Polar codes are a class of capacity achieving codes that have been adopted as the main coding scheme for control channels in 5G New Radio. The main decoding algorithm for polar codes is the successive cancellation decoder. This algorithm performs well at large blocklengths with a low complexity, but has very low reliability at short and medium blocklengths. Several decoding algorithms have been proposed in order to improve the error correcting performance of polar codes. The successive cancellation list decoder, in conjunction with a cyclic redundancy check, provides very good error-correction performance, but at the cost of a high implementation complexity. The successive cancellation stack decoder provides similar error-correction performance at a lower complexity. Future machine-type and ultra reliable low latency communication applications require high-speed low latency decoding algorithms with good error correcting performance. In this paper, we propose a novel decoding algorithm, inspired by the bidirectional stack decoding of classical convolutional codes, with reduced latency that achieves similar performance as the classical successive cancellation list and successive cancellation stack decoding algorithms. The results are presented analytically and verified by simulation.

show abstract

“…It has been proved in [1] that polar codes with SC decoding can achieve the capacity of B-DMCs. Since then, many other decoding algorithms have been proposed [18], [21], [22], [23] and [24]; to improve the error rate performance in the finite-length regime. We will review the SC decoding algorithm in this section.…”

Section: Successive Cancellation Decodingmentioning

confidence: 99%

Polarization-Driven Puncturing for Polar Codes in 5g Systems

OLIVEIRA¹

View full text Add to dashboard Cite

Multiple Folding for Successive Cancelation Decoding of Polar Codes

Cited by 7 publications

References 14 publications

Low Power, Area Efficient Architecture for Successive Cancellation Decoder

Low Power, Area Efficient Architecture for Successive Cancellation Decoder

Bidirectional stack decoding of polar codes

Polarization-Driven Puncturing for Polar Codes in 5g Systems

Contact Info

Product

Resources

About