1,870 Hits in 2.8 sec

Memory reduction techniques for successive cancellation decoding of polar codes

Bertrand Le Gal, Camille Leroux, Christophe Jego
2016 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Polar coding is a new coding scheme that asymptotically achieves the capacity of several communication channels. Polar codes can be decoded with a successive cancellation (SC) decoder.  ...  The association of both methods allows a reduction of 16 ∼35% of the memory complexity for SC decoders depending on their quantization format.  ...  The associated decoder is the successive cancellation (SC) decoder.  ... 
doi:10.1109/icassp.2016.7471823 dblp:conf/icassp/GalLJ16 fatcat:7xsxxy5q6jhgbfjozt7cy5nv3e

Adaptive Quantization of the Polar Successive Cancellation Decoder

Yiğit Ertuğrul, Erdal Arikan
2019 Zenodo  
An adaptive quantization technique is proposed to reduce the memory complexity of the polar SC decoder.  ...  Adaptive quantization method reduces the memory complexity of the decoder proportional to coding rate.  ...  Orhan Arıkan for the development of the algortihm.  ... 
doi:10.5281/zenodo.3565298 fatcat:vmte6m2nibgorjmxqyhbcogm34

Register Free Polar Codes Based Partially Parallel Encoder and Decoder Architecture

K. Saranya Devi, R. Muthaiah
2016 Indian Journal of Science and Technology  
This paper presents about the partially parallel encoder and decoder architecture for polar-codes using register-free technique.  ...  In general, the polar codes are referred to a low complexity code to achieve the performance of channel carrying capacity in a binary-input memory-less channels.  ...  For small or adequate polar code, fault performance by the Cyclic Redundancy Check (CRC) supported Successive Cancelation List (SCL) decoding procedure is improved than the Successive Cancelation (SC)  ... 
doi:10.17485/ijst/2016/v9i29/93498 fatcat:u2qxjfab3bh6je3dq4kfallbm4

A new multiple folded successive cancellation decoder for polar codes

Harish Vangala, Emanuele Viterbo, Yi Hong
2014 2014 IEEE Information Theory Workshop (ITW 2014)  
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  ...  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  ...  The original successive cancellation decoder (SCD) for polar codes proposed by Arikan is an important element in proving the capacity theorems for polar codes.  ... 
doi:10.1109/itw.2014.6970858 dblp:conf/itw/VangalaVH14 fatcat:lc7nv5gn6nat7cxmj3uycygore

Non-recursive complexity reduction encoding scheme for performance enhancement of polar codes

Prakash K M, Dr. G S Sunitha
2017 International Journal of Engineering and Technology  
In order to reduce the complexity, successive cancellation decoding approach is proposed by Lin et al [1] where and efficient decoder architecture is developed for non-binary LDPC codes with the help of  ...  In this work, we propose new encoding schemes which mainly address the issue of computational complexity and memory requirements for polar coding scheme.  ...  Work presented in [5] addressed the issue of throughput and speed of polar codes by using successive cancellation decoding.  ... 
doi:10.21817/ijet/2017/v9i1/170901401 fatcat:o4lvv4cmcrgbteg4cb4y6aucre

LLR-Based Successive-Cancellation List Decoder for Polar Codes With Multibit Decision

Bo Yuan, Keshab K. Parhi
2017 IEEE Transactions on Circuits and Systems - II - Express Briefs  
To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding error-correcting performance of polar codes.  ...  Synthesis results show that for an example (1024, 512) polar code with list size 4, the proposed LLR-2Kb-SCL decoders achieve significant reduction in both area and latency as compared to prior works.  ...  Successive-Cancellation List (SCL) Algorithm The decoding process of polar codes can also be interpreted from the view of code tree. Fig. 3 shows an example code tree for n=4 polar codes.  ... 
doi:10.1109/tcsii.2016.2546904 fatcat:pyexzz2ynzgybcqq7mcmk4bmdq

Low-Complexity LSTM-Assisted Bit-Flipping Algorithm for Successive Cancellation List Polar Decoder [article]

Chun-Hsiang Chen, Chieh-Fang Teng, An-Yeu Wu
2019 arXiv   pre-print
Polar codes have attracted much attention in the past decade due to their capacity-achieving performance. The higher decoding capacity is required for 5G and beyond 5G (B5G).  ...  Although the cyclic redundancy check (CRC)- assisted successive cancellation list bit-flipping (CA-SCLF) decoders have been developed to obtain a better performance, the solution to error bit correction  ...  However, their decoding capacity is still worse than the state-of-the-art CRC-assisted successive cancellation list (CA-SCL) [8] - [10] .  ... 
arXiv:1912.05158v1 fatcat:waxpdx3nffbyrn25rsybb52uby

Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes [article]

Mao-Ching Chiu, Wei-De Wu
2016 arXiv   pre-print
Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme.  ...  Simulation results show that, with a (16384, 8192) multi-CRC-aided polar code, a R-SCL decoder with about 85% reduction of space complexity and 20% reduction of time complexity results in a worst performance  ...  Sun for helpful discussions.  ... 
arXiv:1609.08813v1 fatcat:2qze36yivrgpvdswuycach55ca

Input-distribution-aware successive cancellation list decoding of polar codes [article]

Carlo Condo
2021 arXiv   pre-print
Successive cancellation list (SCL) decoding relies on a set of parallel decoders; it yields good error-correction performance at finite code length, at the cost of increased implementation complexity and  ...  Polar codes are linear block codes that can achieve channel capacity at infinite code length.  ...  Successive cancellation list (SCL) decoding has been proposed in [5] to improve on the error-correction performance of polar codes provided by their original decoding algorithm, successive cancellation  ... 
arXiv:2010.14477v3 fatcat:haxc72m25nbxzihommtxpxjexe

Memory Management in Successive-Cancellation based Decoders for Multi-Kernel Polar Codes [article]

Valerio Bioglio, Carlo Condo, Ingmar Land
2018 arXiv   pre-print
We propose an efficient, generalized memory management framework for implementation of successivecancellation decoding of multi-kernel polar codes.  ...  Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory management.  ...  Multi-kernel polar codes can be decoded through successive cancellation (SC) decoding on the Tanner graph of the code, where log-likelihood ratios (LLRs) [15] are passed from the right to the left, while  ... 
arXiv:1809.09436v1 fatcat:vojzfoybkfet5aib2ioqzl2vwe

Improving utilization rate of semi-parallel successive cancellation architecture for polar codes using 2-bit decoding

2021 Turkish Journal of Electrical Engineering and Computer Sciences  
Partial sums generation architecture for successive cancellation decoding 26 of polar codes.  ...  A High-Throughput Energy-Efficient Implementation of Successive Cancellation Decoder for 34 Polar Codes Using Combinational Logic.  ... 
doi:10.3906/elk-2105-175 fatcat:vcxs7cgwuvgojfkqmp34ydzs5a

Reduced Path Successive Cancellation List Decoding for Polar Codes

Walled Khalid Abdulwahab, Abdulkareem Abdulrahman Kadhim
2021 International Journal of Engineering and Technology Innovation  
Polar codes have already been adopted in 5G systems to improve error performance. Successive cancellation list (SCL) decoding is usually used at the decoder and involves lengthy processing.  ...  The results reveal that the proposed RP-SCL decoder provides the complexity reduction in terms of the average number of processed paths at high SNR.  ...  Polar codes with successive cancellation (SC) decoders have achieved the attractive performance for long coded block length (N) with a complexity of O(N.log 2 N) [2] .  ... 
doi:10.46604/ijeti.2021.6376 fatcat:f7zglwgtfnbebcss3y46ahvola

A Semi-Parallel Successive-Cancellation Decoder for Polar Codes

Camille Leroux, Alexandre J. Raymond, Gabi Sarkis, Warren J. Gross
2013 IEEE Transactions on Signal Processing  
Motivated by the recent rapid progress in the theory of polar codes, we propose a semi-parallel architecture for the implementation of successive cancellation decoding.  ...  This drastic reduction in processing complexity allows very large polar code decoders to be implemented in hardware. An N = 2 17 polar code successive cancellation decoder is implemented in an FPGA.  ...  cancellation decoding of polar codes.  ... 
doi:10.1109/tsp.2012.2223693 fatcat:dht3noqcybazrnkwot6vmbss2m

Operation Merging for Hardware Implementations of Fast Polar Decoders

Furkan Ercan, Thibaud Tonnellier, Carlo Condo, Warren J. Gross
2018 Journal of Signal Processing Systems  
As a result, fast decoding techniques for polar codes are essential.  ...  Previous works targeting improved throughput for successive-cancellation (SC) decoding of polar codes are semi-parallel implementations that exploit special maximum-likelihood (ML) nodes.  ...  A polar code of length N is composed of two concatenated polar codes of length N/2; Fig. 1 depicts the encoding process for P C (8, 5) . B.  ... 
doi:10.1007/s11265-018-1413-4 fatcat:a6ajvez26fd7xngnh67guek6m4

Overlapped List Successive Cancellation Approach for Hardware Efficient Polar Code Decoder [article]

Tiben Che, Jingwei Xu, Gwan Choi
2015 arXiv   pre-print
This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes.  ...  By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list size l can be cut down to only one.  ...  Polar Code As introduced in [1], a polar code is constructed by successively performing channel polarization. Mathematically, polar codes are linear block codes of length N = 2 n .  ... 
arXiv:1511.00577v1 fatcat:twx2cla2xbegtbvpu5c4n4eh7q
« Previous Showing results 1 — 15 out of 1,870 results