Low complexity iterative decoding of Reed-Solomon convolutional concatenated codes

被引:1
作者
Samy, Ramy [1 ]
Mahran, Ashraf [2 ]
Mohasseb, Yahya [3 ]
机构
[1] Space Technol Ctr, Commun Div, Cairo, Egypt
[2] Mil Tech Coll, Av Dept, Cairo, Egypt
[3] Arab Acad Sci Technol & Maritime Transport, Coll Engn & Technol, Comp Engn Dept, Cairo, Egypt
关键词
convolutional codes; iterative decoding; Reed-Solomon codes; RSCC codes; soft-decision decoding; soft-output adaptive Viterbi algorithm; PERFORMANCE;
D O I
10.1002/dac.4922
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The power limitation is the predominant challenge for achieving a reliable communication transmission for aerospace systems. Therefore, it is appealing to use robust channel coding techniques with a low decoding complexity. The robust forward error correction scheme that uses a Reed-Solomon as an outer code concatenated with a convolutional code as an inner code is an attractive scheme whose applications are widely used in wireless and space communications. However, iterative soft-decision decoding of that concatenated code is still an open research challenge. This paper proposes a reduced complexity iterative decoding algorithm for this concatenated coding scheme. The soft-output adaptive Viterbi algorithm with a dynamic discarding threshold has been adopted to decode the inner convolutional code while the outer decoder will be based on a bit-level modified Chase algorithm. We have used the Hamming metric instead of the Euclidean metric, which is not only much less complex but also overcomes the lack of channel information on the outer decoder input. Simulation results using the proposed soft information exchange decoding mechanism show that a considerable performance enhancement over the classical decoding scheme as well as a significant reduction in complexity over the existing decoding algorithms that use an iterative process to decode this concatenated coding scheme. The adaptive decoding of the inner convolutional code can gain a complexity reduction of 90% after 5 iterations compared to the soft-output Viterbi algorithm while maintaining the small performance loss from the maximum a posteriori decoding algorithm.
引用
收藏
页数:17
相关论文
共 50 条
[31]   Iterative equalization and decoding for SFH spread-spectrum communications using reed-solomon codes [J].
Ramchandran H. ;
Noneaker D.L. .
International Journal of Wireless Information Networks, 2008, 15 (1) :1-15
[32]   Iterative Soft-decision Decoding of Reed-Solomon Codes Using Informed Dynamic Scheduling [J].
Lee, Huang-Chang ;
Huang, Guan-Xuan ;
Wang, Chung-Hsuan ;
Ueng, Yeong-Luh .
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, :2909-2913
[33]   Fast Chase Decoding Algorithms and Architectures for Reed-Solomon Codes [J].
Wu, Yingquan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (01) :109-129
[34]   Algebraic soft-decision decoding of Reed-Solomon codes [J].
Koetter, R ;
Vardy, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (11) :2809-2825
[35]   Performance evaluation of concatenated codes with inner trellis codes and outer Reed-Solomon code [J].
Valadon, CGF ;
Tafazolli, R ;
Evans, BG .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (04) :565-570
[36]   Low-Complexity Koetter-Vardy Decoding of Reed-Solomon Codes Using Module Minimization [J].
Xing, Jiongyue ;
Chen, Li ;
Bossert, Martin .
ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
[37]   Fast Chase Algorithms for Decoding Reed-Solomon Codes [J].
Chu, Shao-I ;
Chen, Yan-Haw ;
Chiu, Yi-Chan ;
Chang, Ru-Sian .
2014 INTERNATIONAL SYMPOSIUM ON NEXT-GENERATION ELECTRONICS (ISNE), 2014,
[38]   Burst List Decoding of Interleaved Reed-Solomon Codes [J].
Kolan, Tom ;
Roth, Ron M. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) :182-190
[39]   Simple algorithms for decoding systematic Reed-Solomon codes [J].
Mateer, Todd D. .
DESIGNS CODES AND CRYPTOGRAPHY, 2013, 69 (01) :107-121
[40]   On Cauchy Matrices for Remainder Decoding of Reed-Solomon Codes [J].
Ma, Chingwo .
IEEE COMMUNICATIONS LETTERS, 2009, 13 (09) :688-690