On the Performance of SC-Flip and SC-Perturbation Decoders for Parallel Decoding of Polar Codes

Author(s):  
Jisang Park ◽  
Hyosang Ju ◽  
Chanho Yoon ◽  
Woncheol Cho ◽  
Sang-Hyo Kim
2014 ◽  
Vol 2014 ◽  
pp. 1-14
Author(s):  
Yingxian Zhang ◽  
Xiaofei Pan ◽  
Kegang Pan ◽  
Zhan Ye ◽  
Chao Gong

We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive theerror-checking equationsgenerated on the basis of the frozen nodes, and then we introduce the method to check the errors in the input nodes of the decoder by the solutions of these equations. In order to further correct those checked errors, we adopt the method of modifying the probability messages of the error nodes with constant values according to the maximization principle. Due to the existence of multiple solutions of theerror-checking equations, we formulate a CRC-aided optimization problem of finding the optimal solution with three different target functions, so as to improve the accuracy of error checking. Besides, in order to increase the throughput of decoding, we use a parallel method based on the decoding tree to calculate probability messages of all the nodes in the decoder. Numerical results show that the proposed decoding algorithm achieves better performance than that of some existing decoding algorithms with the same code length.


2020 ◽  
Vol E103.B (1) ◽  
pp. 43-51 ◽  
Author(s):  
Yuhuan WANG ◽  
Hang YIN ◽  
Zhanxin YANG ◽  
Yansong LV ◽  
Lu SI ◽  
...  

Author(s):  
R. A. Morozov ◽  
P. V. Trifonov

Introduction:Practical implementation of a communication system which employs a family of polar codes requires either to store a number of large specifications or to construct the codes by request. The first approach assumes extensive memory consumption, which is inappropriate for many applications, such as those for mobile devices. The second approach can be numerically unstable and hard to implement in low-end hardware. One of the solutions is specifying a family of codes by a sequence of subchannels sorted by reliability. However, this solution makes it impossible to separately optimize each code from the family.Purpose:Developing a method for compact specifications of polar codes and subcodes.Results:A method is proposed for compact specification of polar codes. It can be considered a trade-off between real-time construction and storing full-size specifications in memory. We propose to store compact specifications of polar codes which contain frozen set differences between the original pre-optimized polar codes and the polar codes constructed for a binary erasure channel with some erasure probability. Full-size specification needed for decoding can be restored from a compact one by a low-complexity hardware-friendly procedure. The proposed method can work with either polar codes or polar subcodes, allowing you to reduce the memory consumption by 15–50 times.Practical relevance:The method allows you to use families of individually optimized polar codes in devices with limited storage capacity. 


2014 ◽  
Author(s):  
David Wasserman
Keyword(s):  

2021 ◽  
pp. 1-1
Author(s):  
Yanlong Zhao ◽  
Zhendong Yin ◽  
Zhilu Wu ◽  
Mingdong Xu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document