Performance Analysis of MIA Algorithm for LDPC Codes in near Space Rain Attenuation Channel

Abstract:

According to the influence of grand reflector to the channel, near space Ka-band rain attenuation channel model of area coverage is improved. According to RRWBF algorithm and UMP BP-Based algorithm of LDPC codes, a mixed iterative decoding algorithm is proposed. The algorithm takes advantage of low complexity of hard-decision algorithm and high performance of soft-decision algorithm, so in near space rain attenuation channel, the decoding complexity significantly reduced when bit error rate performance does not decline. Simulation results show that in near space rain attenuation channel, MIA algorithm can reduce decoding complexity by about 30%, compare with the UMP BP-Based algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 148-149)
• Pages: 1576-1582
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.148-149.1576
• Online since: December 2011
• Authors: Yi Dong Su, Shu Xin Chen, Hao Wu
• Keywords: LDPC Codes, Near Space, Rain Attenuation Channel, RRWBF Algorithm, UMP BP-Based Algorithm

References

[1] Rong-Wei Bao, Shu-Xin Chen. Near Space Research stationary channel model [J]. Air Force Engineering University (Natural Science), 2010. 12, 11 (6): 22 ~ 26.

[2] Gallager R G. Low Density Parity Check Codes [M]. USA: MITpress, (1963).

[3] Zhongmin Gan. Near space platforms effective means of emergency communication [J]. Digital communications world, 2008, 06: 45 ~ 49.

[4] E. Lutz, D. Cygan, M. Dippold, F. Dolainsky and W. Papke, The land mobile satellite communication channel-recording, statistics and channel model, IEEE Transactions on Vehicular Technology, 40 (2), 375-386, May (1991).

DOI: 10.1109/25.289418

[5] Y. Kou S. Lin and M. Fossorier. Low density parity check codes based on finite geometries: a discovery and new results [J]. IEEE Trans. Inf. Theory 2001, 47: 2711-2736.

DOI: 10.1109/18.959255

[6] Guo F and Hanzo L. Reliability ratio based weighted bit-flipping decoding low-density parity-check codes [J]. Electronic Letters, 2004, 40 (21) : 1356-1358.

DOI: 10.1049/el:20046400

[7] Kschischang FR et al. Factor Graphs and the Sum-Product Algorithm [J]. IEEE Trans. Information Theory, 2001, 47 (2) : 498-519.

DOI: 10.1109/18.910572

[8] Fossorier MRC, Mihaljevic M and Imai H. Reduced complexity iterative decoding of low-density parity check codes Based on belief propagation [J]. IEEE Trans. Communication, 1999, 47 (5): 673-680.

DOI: 10.1109/26.768759

[9] Fossorier MP C. Iterative reliability-Based decoding of low-density parity check codes [J]. IEEE Journal of Selected Areas in Communications, 2001, 19 (5): 908 - 917.

DOI: 10.1109/49.924874

[10] Liyuan Zhou, Lijun Zhang, Changjia Chen. LDPC decoding algorithm for hybrid bit reversal [J]. Beijing Jiao tong University, 2005, 29 (2) , 1673 -0291.

[11] Zhenyu Liu, Dimitris A. Pados. A Decoding Algorithm for Finite-Geometry LDPC Codes [J]. IEEE Transactions on Communications, 2005, 53 (3) : 415-421.

DOI: 10.1109/tcomm.2005.843413