Analysis of the Encoding and Decoding Process of Polar Code
DOI:
https://doi.org/10.54097/hset.v53i.9702Keywords:
Polar Code, Channel Coding, Binary Erase The Channel.Abstract
This paper briefly introduces the history of channel coding from the hamming code to the newest polar code. Then it introduces that the polar code is the only one that can reach the Shannon limit. With such a crucial technique, this study set it as the core research target of this article. After pointing out the target and the content of the polar code, this paper explains the core principle, which is the channel polarization theory. It also contains channel polarization's two components, the channel combining and splitting theory. In the main part, this paper explains the encoding and decoding of polar code in detail based on the polarization theory. It analyzes the whole process of polar code using examples with multiple inputs. And at last, the result of the likelihood ratio and channel capacity is obtained, which can be utilized to compute the relevant parameters to evaluate the efficiency of encoding and decoding and other rates.
Downloads
References
C. E. Shannon, "A mathematical theory of communication," in The Bell System Technical Journal, vol. 27, no. 3, pp. 379-423, July 1948, doi: 10.1002/j.1538-7305. 1948.tb01338. x.
R. W. Hamming, "Error detecting and error correcting codes," in The Bell System Technical Journal, vol. 29, no. 2, pp. 147-160, April 1950, doi: 10.1002/j.1538-7305. 1950.tb00463. x.
J. Li and H. Imai, “Serial concatenation of convolutional code and low rate orthogonal convolutional code,” Proceedings of IEEE International Symposium on Information Theory.
P. Jung, "Turbo-codes for future mobile radio applications," 1998 IEEE 5th International Symposium on Spread Spectrum Techniques and Applications - Proceedings. Spread Technology to Africa (Cat. No.98TH8333), Sun City, South Africa, 1998, pp. 358 vol.2-, doi: 10.1109/ISSSTA.1998.723805.
R. Gallager, "Low-density parity-check codes," in IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21-28, January 1962, doi: 10.1109/TIT.1962.1057683.
E. Arikan, "Channel polarization: A method for constructing capacity-achieving codes," 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, 2008, pp. 1173-1177, doi: 10.1109/ISIT.2008.4595172.
E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July 2009, doi: 10.1109/TIT.2009.2021379.
Wuzhou Yang and Tong Liu, “Analysis and prospect of polarization code research status” Information & Communications ,2016,0(4):218-219
R. Mori and T. Tanaka, “Performance of polar codes with the construction using density evolution,” IEEE Communications Letters, vol. 13, no. 7, pp. 519–521, 2009.
M. M. Wilde and S. Guha, "Polar Codes for Degradable Quantum Channels," in IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4718-4729, July 2013, doi: 10.1109/TIT.2013.2250575.
M. Abdelhedi, F. Tlili, and L. Ben Hadj Slama, “Simulation-based validation of improved BP-based decoding algorithms of LDPC codes,” 2008 3rd International Symposium on Communications, Control and Signal Processing, 2008.
I. Tal and A. Vardy, "List Decoding of Polar Codes," in IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213-2226, May 2015, doi: 10.1109/TIT.2015.2410251.
K. Chen, K. Niu and J. Lin, "A Reduced-Complexity Successive Cancellation List Decoding of Polar Codes," 2013 IEEE 77th Vehicular Technology Conference (VTC Spring), Dresden, Germany, 2013, pp. 1-5, doi: 10.1109/VTCSpring.2013.6691844.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
