Low Density Parity Check Code for Next Generation Communication System

Channel coding provides the means of patterning signals so as to reduce their energy or bandwidth consumption for a given error performance. LDPC codes have been shown to have good error correcting performance which enables efficient and reliable communication. LDPC codes have linear decoding complexity but performance approaching close to shannon capacity with iterative probabilistic decoding algorithm. In this dissertation, the performance of different error correcting code such as convolution, Reed Solomon(RS), hamming, block code are evaluated based on different parameters like code rate, bit error rate (BER), Eb/No, complexity, coding gain and compare with LDPC code. In general, message passing algorithm and the sum-product algorithm are used to decode the message. We showed that logarithmic sum-product algorithm with long block length code reduces multiplication to addition by introducing logarithmic likelihood ratio so that it achieves the highest BER performance among all the decoding algorithms. The astonishing performance combined with proposed modified MS decoding algorithm make these codes very attractive for the next generations digital broadcasting system (ABS - S).

Autorentext

Mr. Mayank A. Ardeshana has obtained his master degree in communication from Nirma university, ahmedabad in 2010. He has a one year industrial experience in Nokia Siemens Networks, pvt. ltd, ahmedabad. Presently, he has working as a Assistant Professor in G.H.Patel College of Engineering & Technology, v.v.nagar, Gujarat, India.