Low-complexity CA-SCL decoding optimization algorithm for low-orbit satellite communication

doi:10.7523/j.ucas.2023.016

Abstract

Abstract: Based on the low-orbit satellite communication environment with limited hardware resources, this paper uses polarization code as the channel coding method, and combines the successive redundancy check (CRC) assisted successive cancellation list (SCL) decoder (CA-SCL) with critical sets and adaptive algorithms to propose an optimized CA-SCL decoder (OCASCL). The performance of the OCASCL decoder is better than the classic SCL decoder, the computational complexity can be reduced by 65%-70%.

Key words: LEO communication, polar code, CA-SCL, critical set, low decoding complexity

CLC Number:

TN911.2

HU Xiuqi, HOU Huiling, LIANG Guang, YU Jinpei. Low-complexity CA-SCL decoding optimization algorithm for low-orbit satellite communication[J]. Journal of University of Chinese Academy of Sciences, 2024, 41(5): 715-720.

References

[1] Wu W W, Miller E F, Pritchard W L, et al. Mobile satellite communications[J]. Proceedings of the IEEE, 1994, 82(9):1431-1448. DOI:10.1109/5.317086.
[2] Kalmykov I A, Mukhametshin V Sh, Tyncherov K T, et al. Developing method for constructing modular turbo code for anti-jam satellite authentication system[J]. Journal of Physics:Conference Series, 2022, 2176(1):012023. DOI:10.1088/1742-6596/2176/1/012023.
[3] Zhang C, Mu X J, Yuan J H, et al. Construction of multi-rate quasi-cyclic LDPC codes for satellite communications[J]. IEEE Transactions on Communications, 2021, 69(11):7154-7166. DOI:10.1109/TCOMM.2021.3107578.
[4] Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding:turbo-codes. 1[C]//Proceedings of ICC'93-IEEE International Conference on Communications. May 23-26, 1993, Geneva, Switzerland. IEEE, 2002:1064-1070. DOI:10.1109/ICC.1993.397441.
[5] MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes[J]. Electronics Letters,1996, 32(18):1645. DOI:10.1049/el:19961141.
[6] Arikan E. Channel polarization:a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels[J]. IEEE Transactions on Information Theory, 2009, 55(7):3051-3073. DOI:10.1109/TIT.2009.2021379.
[7] Wang H P, Duursma I M. Polar codes'simplicity, random codes'durability[J]. IEEE Transactions on Information Theory, 2020, 67(3):1478-1508. DOI:10.1109/TIT.2020.3041570.
[8] Şaşoǧlu E, Telatar E, Arikan E. Polarization for arbitrary discrete memoryless channels[C]//2009 IEEE Information Theory Workshop. October 11-16, 2009, Taormina, Italy. IEEE, 2009:144-148. DOI:10.1109/ITW.2009.5351487.
[9] Meng Y, Fang Y, Zhang C, et al. LLR processing of polar codes in concatenation systems[J]. China Communications, 2019, 16(9):201-208. DOI:10.23919/JCC.2019.09.015.
[10] 赵昕柔.极化码在卫星通信中的应用研究[D].西安:西安电子科技大学, 2020.
[11] Chen Y Y, Wang Y Z, Dong Y. Performance analysis of polar codes against rain attenuation in ka-band satellite communication[C]//2021 International Conference on Communications, Information System and Computer Engineering (CISCE). May 14-16, 2021, Beijing, China. IEEE, 2021:146-150. DOI:10.1109/CISCE52179.2021.9445972.
[12] Chen K, Niu K, Lin J R. List successive cancellation decoding of polar codes[J]. Electronics Letters, 2012, 48(9):500. DOI:10.1049/el.2011.3334.
[13] Niu K, Chen K. CRC-aided decoding of polar codes[J]. IEEE Communications Letters, 2012, 16(10):1668-1671. DOI:10.1109/LCOMM.2012.090312.121501.
[14] Tal I, Vardy A. List decoding of polar codes[J]. IEEE Transactions on Information Theory, 2015, 61(5):2213-2226. DOI:10.1109/TIT.2015.2410251.
[15] Zhang Z Y, Qin K J, Zhang L, et al. Progressive bit-flipping decoding of polar codes:a critical-set based tree search approach[J]. IEEE Access, 2018, 6:57738-57750. DOI:10.1109/ACCESS.2018.2873821.
[16] Zhang Z Y, Qin K J, Zhang L, et al. Progressive bit-flipping decoding of polar codes over layered critical sets[C]//GLOBECOM 2017-2017 IEEE Global Communications Conference. December 4-8, 2017, Singapore. IEEE, 2018:1-6. DOI:10.1109/GLOCOM.2017.8254149.