Abstract
A new reduced complexity decoding algorithm, called adaptive successive erasure correction (ASEC), is considered. It is applied to non-binary Reed Solomon code coupled with general MPSK modulation. The performance of the corresponding system is analyzed under assumption that the transmitted signals suffer from additive white gaussian noise (AWGN) and slow flat Rayleigh fading. The examined algorithm is compared with the General Minimum Distance (GMD) and with the Successive Erasure Minimum Distance (SEMD) decoding algorithms. It has reduced complexity while the loss of performance does not exceed 1 dB in SNR. The relative advantage of the proposed algorithm becomes more significant with increasing of the code symbol size.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
