An efficient algorithm for low Error floor short length low Density parity check code

Abstract

Coded modulation has better error performance than uncoded newlinemodulation system and this can be proven by Shannon channel capacity newlinetheorem Low density parity check code LDPC was attracted by the newlineresearchers due to its near to Shannon channel capacity Ideal error floor newlineperformance can be achieved only by infinite codeword length Practically newlinethe codeword lengths are finite and it will lead to drop the performance of newlineerror floor region and waterfall region of bit error rate performance So newlinemaintaining the error floor region with finite codeword length is the hard newlinechallenge faced by researchers This research work is targeted for short length newlinecodeword LDPC to get low error floor without sacrificing waterfall region newlineMost of the researches concentrate only to decoder or encoder to obtain better newlineerror floor But this research contributes to the encoder and decoder together newlineto achieve low error floo newline newline