| Sign up

PDF (1.6 MB)

Cite

Collect

Submit Manuscript

Open Access

Received value flipping based sphere decoding algorithm for polar codes

Rui Wang^¹, Haiqiang Chen^², Yan Chen^¹, Yuanbo Liu^¹, Xiangcheng Li^¹, Youming Sun^¹, Qingnian Li^³()

1School of Computer and Electronic Information, Guangxi University, Nanning 530004, China

2Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning 530004, China

3College of Information Engineering, Nanning University, Nanning 530004, China

Show Author Information

Abstract

Polar codes are considered as one of the most competitive channel coding schemes for the future wireless communication system. To improve the performance of polar codes with short code-length for control channels, a sphere decoding algorithm based on received value flipping is proposed in this paper. When a codeword fails the cyclic redundancy check, the algorithm flips the received value with low reliability and forms a new received sequence. Then, this new sequence is sent to the decoder for another decoding attempt. In addition, we also compare the performance of different flipping sets and evaluate the influence of the associated flipping set sizes. Simulation results show that, the proposed algorithm can achieve performance improvement over additive white Gaussian noise channel with acceptable complexity. For the (64, 16) polar code, the proposed algorithm can achieve about 0.23 dB performance gain at frame error rate = $10^{- 3}$ , compared to the conventional sphere decoding algorithm. Finally, we also verify the applicability of the proposed algorithm over Rayleigh fading channel and observe similar results.

Keywords

polar codes sphere decoding bit flipping row weight polarization weight

References

[1]

E. Arikan, Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels, IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, 2009.

Crossref Google Scholar

[2]

TS38.212, NR; Multiplexing and channel coding, https://www.3gpp.org/DynaReport/38-series.htm, 2018.

[3]

C. Sun, Z. Fei, D. Jia, C. Cao, and X. Wang, Secure transmission scheme for parallel relay channels based on polar coding, Tsinghua Science and Technology, vol. 23, no. 3, pp. 357–365, 2018.

Crossref Google Scholar

[4]

I. Tal and A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, 2015.

Crossref Google Scholar

[5]

R. Gallager, Low-density parity-check codes, IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21–28, 1962.

Crossref Google Scholar

[6]

Q. Zeng, Q. Zhou, X. He, X. He, Y. Sun, X. Li, and H. Chen, Polar codes: Encoding/decoding and rate-compatible jointly design for HARQ system, Intelligent and Converged Networks, vol. 2, no. 4, pp. 334–346, 2021.

Crossref Google Scholar

[7]

K. Niu and K. Chen, CRC-aided decoding of polar codes, IEEE Commun. Lett., vol. 16, no. 10, pp. 1668–1671, 2012.

Crossref Google Scholar

[8]

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1, in Proc. IEEE Int. Conf. Communications (ICC’93), Geneva, Switzerland, 1993, pp. 1064–1070.

Crossref

[9]

O. Afisiadis, A. Balatsoukas-Stimming, and A. Burg, A low-complexity improved successive cancellation decoder for polar codes, in Proc. 2014 48th Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, USA, 2014, pp. 2116–2120.

Crossref

[10]

S. Kahraman and M. E. Çelebi, Code based efficient maximum-likelihood decoding of short polar codes, in Proc. 2012 IEEE Int. Symp. Information Theory, Cambridge, MA, USA, 2012, pp. 1967–1971.

Crossref

[11]

J. Guo and A. Guillén i Fàbregas, Efficient sphere decoding of polar codes, in Proc. 2015 IEEE Int. Symp. Information Theory (ISIT ), Hong Kong, China, 2015, pp. 236–240.

Crossref

[12]

Y. Liu, H. Chen, J. Chen, L. Liao, F. Huang, Y. Sun, and X. Li, Low complexity symmetric-coded based sphere decoding for low-rate polar codes, Sci. Rep., vol. 13, p. 1191, 2023.

Crossref Google Scholar

[13]

S. A. Hashemi, C. Condo, and W. J. Gross, List sphere decoding of polar codes, in Proc. 2015 49th Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, USA, 2015, pp. 1346–1350.

Crossref

[14]

H. Chen and Y. Liu, Sphere decoding for binary polar codes with the modified multiplicative repetition construction, Tsinghua Science and Technology, DOI: 10.26599/TST.2024.9010030.

Crossref

[15]

H. Zhou, J. Zheng, M. Yang, W. J. Gross, X. You, and C. Zhang, Low-complexity sphere decoding for polar-coded MIMO systems, IEEE Trans. Veh. Technol., vol. 72, no. 5, pp. 6810–6815, 2023.

Crossref Google Scholar

[16]

R. Mori and T. Tanaka, Performance of polar codes with the construction using density evolution, IEEE Commun. Lett., vol. 13, no. 7, pp. 519–521, 2009.

Crossref Google Scholar

[17]

G. He, J. C. Belfiore, I. Land, G. Yang, X. Liu, and Y. Chen, Beta-expansion: A theoretical framework for fast and recursive construction of polar codes, in Proc. 2017 IEEE Global Communications Conf., Singapore, 2017, pp. 1–6.

Crossref

Intelligent and Converged Networks

Volume 5 Issue 4,
December 2024

Pages 370-379

DOI: 10.23919/ICN.2024.0025

Cite this article:

Wang R, Chen H, Chen Y, et al. Received value flipping based sphere decoding algorithm for polar codes. Intelligent and Converged Networks, 2024, 5(4): 370-379. https://doi.org/10.23919/ICN.2024.0025