Article


Article Code : 13990210236883

Article Title : Reliability Analysis of the Sum-Product Decoding Algorithm for the PSK Modulation Scheme

Journal Number : 31 Summer 2020

Visited : 261

Files : 459 KB


List of Authors

  Full Name Email Grade Degree Corresponding Author
1 Hadi Khodaei Jooshin hadikhodaei.j@gmail.com Graduate B.S
2 Mahdi Nangir nangir@tabrizu.ac.ir Assistant Professor PhD

Abstract

Iteratively decoding and reconstruction of encoded data has been considered in recent decades. Most of these iterative schemes are based on graphical codes. Messages are passed through space graphs to reach a reliable belief of the original data. This paper presents a performance analysis of the Low-Density Parity-Check (LDPC) code design method which approach the capacity of the Additive White Gaussian Noise (AWGN) model for communication channels. We investigate the reliability of the system under Phase Shift Keying (PSK) modulation. We study the effects and advantages of variation in the codeword length, the rate of parity-check matrix of the LDPC codes, and the number of iterations in the Sum-Product Algorithm (SPA). By employing an LDPC encoder prior to the PSK modulation block and the SPA in the decoding part, the Bit Error Rate (BER) performance of the PSK modulation system can improve significantly. The BER performance improvement of a point-to-point communication system is measured in different cases. Our analysis is capable for applying any other iterative message-passing algorithm. The code design process of the communication systems and parameter selection of the encoding and decoding algorithms are accomplished by considering hardware limitations in a communication system. Our results help to design and select paramours efficiently.