TY - JOUR
T1 - A High Performance and Low Complexity LDPC Decoding Strategy for Space-Air-Ground-Sea Integrated Communication Networks
AU - Ren, Xinyuan
AU - Zhang, Jiahao
AU - Chen, Chao
AU - Wang, Shuai
AU - Pan, Gaofeng
AU - Miao, Xiaqing
AU - An, Jianping
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2024
Y1 - 2024
N2 - In the coming sixth-generation era, space-air-ground-sea integrated (SAGSI) communication networks will be rapidly developed, with broader coverage, connectivity, security, and so on. The various communication requirements call for a decoding algorithm with lower complexity and higher coding gain for the channel code. Inspired by this point and based on the fifth-generation networks standard, this paper proposes a high-performance and low-complexity Low-Density Parity-Check (LDPC) decoding strategy for SAGSI communication networks. Based on a two-dimensional self-corrected min-sum algorithm (2D-SCMSA), the message reliability can be improved by the proposed Enhanced 2D-SCMSA (E-2D-SCMSA) while considering the erasure range of the variable node message. For given LDPC codes, the simulation results show that the proposed E-2D-SCMSA can achieve a performance gain of approximately 0.1dB at bit error rate (BER) of 10-4 compared to 2D-SCMSA with a negligible increase in computational complexity. Moreover, the performance gap between the proposed E-2D-SCMSA and likelihood ratio belief-propagation algorithm is less than 0.1dB
AB - In the coming sixth-generation era, space-air-ground-sea integrated (SAGSI) communication networks will be rapidly developed, with broader coverage, connectivity, security, and so on. The various communication requirements call for a decoding algorithm with lower complexity and higher coding gain for the channel code. Inspired by this point and based on the fifth-generation networks standard, this paper proposes a high-performance and low-complexity Low-Density Parity-Check (LDPC) decoding strategy for SAGSI communication networks. Based on a two-dimensional self-corrected min-sum algorithm (2D-SCMSA), the message reliability can be improved by the proposed Enhanced 2D-SCMSA (E-2D-SCMSA) while considering the erasure range of the variable node message. For given LDPC codes, the simulation results show that the proposed E-2D-SCMSA can achieve a performance gain of approximately 0.1dB at bit error rate (BER) of 10-4 compared to 2D-SCMSA with a negligible increase in computational complexity. Moreover, the performance gap between the proposed E-2D-SCMSA and likelihood ratio belief-propagation algorithm is less than 0.1dB
KW - iterative decoding
KW - LDPC codes
KW - SAGSI communication networks
KW - self-corrected min-sum
UR - http://www.scopus.com/inward/record.url?scp=85211996121&partnerID=8YFLogxK
U2 - 10.1109/TVT.2024.3514313
DO - 10.1109/TVT.2024.3514313
M3 - Article
AN - SCOPUS:85211996121
SN - 0018-9545
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
ER -