Received Value Flipping Based Sphere Decoding Algorithm for Polar Codes

被引：0

作者：

Wang, Rui ^{[1
]}

Chen, Haiqiang ^{[2
]}

Chen, Yan ^{[1
]}

Liu, Yuanbo ^{[1
]}

Li, Xiangcheng ^{[1
]}

Sun, Youming ^{[1
]}

Li, Qingnian ^{[3
]}

机构：

[1] School of Computer, Electronics and Information, Guangxi University, Nanning

[2] Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning

[3] Information and Engineering College, Nanning University, Nanning

来源：

Intelligent and Converged Networks | 2024年 / Part P卷 / 99期

基金：

中国国家自然科学基金;

关键词：

bit flipping; polar codes; polarization weight; row weight; sphere decoding;

D O I：

10.23919/ICN.2024.0025

中图分类号：

学科分类号：

摘要：

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. © 2020 Tsinghua University Press.

引用

共 17 条

[1]

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

[2]

Multiplexing and channel coding, (2018)

[3]

Sun C., Fei Z., Jia D., Cao C., Wang X., Secure transmission scheme for parallel relay channels based on polar coding, Tsinghua Sci. Technol., 23, 3, pp. 357-365, (2018)

[4]

Tal I., Vardy A., List decoding of polar codes, IEEE Trans. Inf. Theory, 61, 5, pp. 2213-2226, (2015)

[5]

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

[6]

Zeng Q., Zhou Q., He X., He X., Sun Y., Li X., Chen H., Polar codes: Encoding/decoding and rate-compatible jointly design for HARQ system, Intell. Conver. Netw., 2, 4, pp. 334-346, (2021)

[7]

Niu K., Chen K., CRC-aided decoding of polar codes, IEEE Commun. Lett., 16, 10, pp. 1668-1671, (2012)

[8]

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

[9]

Afisiadis O., Balatsoukas-Stimming A., Burg A., A low-complexity improved successive cancellation decoder for polar codes, Asilomar Conf. Signals, Systems and Computers, pp. 2116-2120, (2014)

[10]

Kahraman S., Celebi M.E., Code based efficient maximum-likelihood decoding of short polar codes, Proc. 2012 IEEE Int. Symp. Information Theory Proceedings, pp. 1967-1971, (2012)

← 1 2 →