International Journal of Advances in Engineering & Scientific Research

International Journal of Advances in Engineering & Scientific Research

Print ISSN : 2349 –4824

Online ISSN : 2349 –3607

Frequency : Continuous

Current Issue : Volume 5 , Issue 1
2018

ANALYSIS OF REDUCED DECODING COMPLEXITY OF LOW DENSITY PARITY CHECK DECODER

Swapnil B. Dheple

Department of Electronics Engineering, Yeshwantrao Chavan College of engineering, Nagpur, India

DOI : Page No : 16-21

Published Online : 2018-01-30

Download Full Article : PDF Check for Updates


ABSTRACT

 

The approach of this paper to reduce decoding complexity of Low density parity check decoder(LDPC). For that technique uses high precision soft messages at the variable node and put down the message length, due to this number of interconnection between check node and variable node will reduce. For the designing and simulation purposes LDPC uses min-sum algorithm. In min-sum algorithm quite increment in complexity so modified min-sum  algorithm is use to reduce decoding complexity. A design model of this decoder uses for long distance communication application such as WiMax, WLAN, DVB-S2 and optical communication. The results achieve significant reduction hardware  of LDPC decoder

KEY WORDS

Digital communication; error correction coding; iterative coding; min-sum algorithm