Y. Li, X. Huang, J. He, H. Liu and T. Truong, "On Soft-Information-Based Error and Erasure Decoding of Reed–Solomon Codes in Burst Rayleigh Fading Channels," in IEEE Transactions on Communications, vol. 67, no. 1, pp. 50-60, Jan. 2019. doi: 10.1109/TCOMM.2018.2872033
On soft-information-based error and erasure decoding of Reed–Solomon codes in burst Rayleigh fading channels
|Author:||Li, Yong1; Huang, Xiang2; He, Jiguang3;|
1College of Computer Science, Chongqing University, Chongqing 400044, China
2Key Laboratory of Mobile Communication, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
3Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
4Department of Information Engineering, I-Shou University, Kaohsiung 84001, Taiwan
5Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan
|Online Access:||PDF Full Text (PDF, 0.3 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2019041712657
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2019-04-17
In this paper, two new decoding algorithms to decode Reed-Solomon codes during transmission over burst Rayleigh fading channels with additive white Gaussian noise (AWGN) are proposed. They only conduct error correction for coded symbols located in the pure AWGN region and conduct error and erasure correction for those symbols located in the burst fading region by treating those coded symbols that are very likely erroneous as erasures. The first algorithm does not need to know the fading locations in advance, while the second algorithm assumes that the fading locations are known. In addition, the performance of such two algorithms is studied when a pre-computed threshold is used to determine the erasures of the code. Simulation results show that our proposed algorithms not only significantly perform better than the classic Berlekamp-Messay algorithm with a comparable computational complexity but also achieve a better tradeoff between the performance and the computational complexity when compared with other existing algorithms. In particular, our algorithms exhibit excellent robustness for tested various code parameters and fading configurations. Furthermore, a more detailed mathematical analysis is also developed in this paper in order to estimate the performance of the new algorithms in the burst Rayleigh fading channels. We observe that the performance of the first algorithm can only be estimated relatively accurately when encountering burst deep-fading, whereas the performance prediction for the second algorithm is always in agreement with the simulation results for various fading cases.
IEEE transactions on communications
|Pages:||50 - 60|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported by China NSF under Grants No. 61771081 and 61501072.
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.