Performance of LPDC codes in short information length
Zhang Shu-ling · 2007
The performance of low density parity check(LDPC) codes is very perfect when their information length is long.If their information length is short,their performance are not very good.This paper simulates the performance of LDPC codes,and provides principle in selecting LDPC codes with short information length.It has directional effect to engineering implementation.At the same time,this paper analyzes the decoding complexity of LDPC,and points out that 30 is more reasonable in iterative decoding LDPC codes.This conclusion is worth of engineering implementation.