Abstract
To reduce the high decoding complexity of q-ary LDPC codes, a joint-demodulation and extended min-sum (JD-EMS) decoding algorithm is presented in this paper. By utilizing the squares of the distances between signal and constellation points over constellation graph as the decoder input soft messages, the proposed algorithm not only facilitates the computations of the decoder initial messages, but also avoids the performance loss due to conversions between probabilities and log-likelihoodratios. The elementary check node (ECN) processing is also improved in JD-EMS algorithm, thus the number of real additions can be reduced. Moreover, we also give an upper bound of the number of comparison candidates in the sorter at each ECN step. Simulation results indicate that, while significantly reducing the number of real additions at check nodes, JD-EMS algorithm performs as well as EMS algorithm on both AWGN and Rayleigh fading channels.
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.
