Filters








3,739 Hits in 4.8 sec

Adaptive Simplified Successive Cancellation for Polar Codes Based on Frozen Bits

Nandhini. T
2017 International Journal for Research in Applied Science and Engineering Technology  
Here, the bit error rate performance of finite-length polar codes is performed under Successive-Cancellation decoding.  ...  Polar codes have been recently proposed as the first low complexity of error correcting codes for wireless channels that can provably achieve the capacity of symmetric binary-input memory less channels  ...  Code length of the polar code is N=2 n , which requires very long code length. Because of the successive cancellation decoding (SC) scheme, large code length tends to a long decoding latency.  ... 
doi:10.22214/ijraset.2017.4108 fatcat:yuxqqyzes5bwvh7hnpqr43slje

Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding

Jiaxin Fang, Chunwu Liu
2020 Journal of Computer and Communications  
Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature.  ...  The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders  ...  When the code Besides, the long polar codes also have a large number of , rate is high or low, there exists few but very long 0 1 ,   constituent codes.  ... 
doi:10.4236/jcc.2020.87008 fatcat:km5fli3rejdw5lgvgmasavzvk4

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.  ...  Hence, the register aspect in polar code centered encoder and decoder architecture are eliminated.  ...  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

Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding

Jiaxin Fang, Chunwu Liu
2020 Optics and Photonics Journal  
When the code Besides, the long polar codes also have a large number of , rate is high or low, there exists few but very long 0 1 ,   constituent codes.  ...  In practical, heavy burden faced by nodes identification and presence of massive short blocks for long codes restrict the use of fast simplified successive-cancellation decoder.  ... 
doi:10.4236/opj.2020.106016 fatcat:jpi5yiruevapxjagyu35vytqeq

A Constituent Codes Oriented Code Construction Scheme for Polar Code-Aim to Reduce the Decoding Latency [article]

Tiben Che, Gwan Choi
2017 arXiv   pre-print
They are used to accelerate the successive cancellation decoding process of polar code without any performance degradation.  ...  We conducted the simulation of 1024 and 2048 bits length polar codes with multiple rates and analyzed the decoding latency for various length codes.  ...  We even calculated the latencies for the codes with very long length such as 16384. IV.  ... 
arXiv:1612.02545v3 fatcat:naehoin22beb3mgqhatpuaqq5i

Capacity-Achievability of Polar Codes and Precoded Polar Codes under List Decoding: They are Good both Practically and Theoretically [article]

Zhuo Li, Lijuan Xing, Ba-Zhong Shen
2017 arXiv   pre-print
The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Arıkan.  ...  In this paper, we formalize the successive cancellation list decoder in our notation and prove that polar codes under successive cancellation list decoding achieve the symmetric capacity of any given binary-input  ...  as in Definition 1 and the decoder consists of a successive-cancellation-list generating phase and a local-maximum-likelihood selecting phase. 1) Successive-Cancellation-List Generating (SCLG): For  ... 
arXiv:1712.00165v2 fatcat:ugr5khc35jc2hndnfz64ngcpze

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

A new multiple folded successive cancellation decoder for polar codes

Harish Vangala, Emanuele Viterbo, Yi Hong
2014 2014 IEEE Information Theory Workshop (ITW 2014)  
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  ...  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  ...  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

On Channel Codes for Short Underwater Messages

Melanie Falk, Gerhard Bauch, Ivor Nissen
2020 Information  
the example of non-binary polar codes.  ...  For a reliable transmission, not only good channel estimation and equalization, but also strong error correcting codes are needed.  ...  Acknowledgments: The authors would like to thank all participants of the coding competition. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/info11020058 fatcat:koakw7shyfejldi6bu5eqo4bzq

Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform [article]

Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink
2016 arXiv   pre-print
The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm.  ...  In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with respect to parallel computing and its difficulties.  ...  INTRODUCTION Polar codes are proven to be capacity achieving under successive cancellation (SC) decoding [1] for infinite block lengths.  ... 
arXiv:1609.09358v3 fatcat:ai35px7pnfbxxpm3imkkjd3vge

LLR-Based Successive Cancellation List Decoding of Polar Codes

Alexios Balatsoukas-Stimming, Mani Bastani Parizi, Andreas Burg
2015 IEEE Transactions on Signal Processing  
the list size in order to achieve the best error-rate performance of concatenated polar codes.  ...  Finally, we synthesize conventional successive cancellation decoders at large block-lengths with the same block-error probability as our proposed CRC-aided successive cancellation list decoders to demonstrate  ...  Successive cancellation list (SCL) decoding was introduced in [5] to improve the finite block-length performance of polar codes.  ... 
doi:10.1109/tsp.2015.2439211 fatcat:dg7i2wbmwvgsdop2nn2hej2efq

Hardware architectures for successive cancellation decoding of polar codes

Camille Leroux, Ido Tal, Alexander Vardy, Warren J. Gross
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders.  ...  The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding.  ...  Polar codes have recently been shown to have an efficient construction [3] . Recent results have started to address the issue of long code length.  ... 
doi:10.1109/icassp.2011.5946819 dblp:conf/icassp/LerouxTVG11 fatcat:nktpgmjsyfdfloq3lrw4ntm7ey

Hardware architectures for Successive Cancellation Decoding of Polar Codes [article]

Camille Leroux, Ido Tal, Alexander Vardy, Warren J. Gross
2010 arXiv   pre-print
Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders.  ...  The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding.  ...  Polar codes have recently been shown to have an efficient construction [3] . Recent results have started to address the issue of long code length.  ... 
arXiv:1011.2919v1 fatcat:g2wwhfcmfnguzbfv4nxzzgem74

A Scalable Successive-Cancellation Decoder for Polar Codes

Alexandre J. Raymond, Warren. J. Gross
2014 IEEE Transactions on Signal Processing  
Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes.  ...  Polar codes, discovered by Arıkan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically.  ...  ACKNOWLEDGEMENT The authors would like to thank Gabi Sarkis and Pascal Giard, of McGill University, for helpful discussions.  ... 
doi:10.1109/tsp.2014.2347262 fatcat:b5p5c23pqzblpdjhqpxnr3dvue

Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes

Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang
2014 IEEE Transactions on Communications  
We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.  ...  A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered.  ...  In the successive cancellation (SC) decoding of the inner polar codes, the very first bits of each polar codeword that are protected by the first outer RS code are decoded first.  ... 
doi:10.1109/tcomm.2014.050714.130602 fatcat:iv5oujwjeve7xe73ahgevu6wna
« Previous Showing results 1 — 15 out of 3,739 results