Low complexity LDPC encoding scheme based on iterative decoding
Yu Hui · Information technology newsletter · 2008
The LDPC encoding algorithm based on iterative decoding can be divided into two stages.In the first stage,exchanging columns of H matrix and adding new rows to H will substantially increase the resource consumption of the encoder.This article focuses on finding the H matrixes which facilitate the implementation of encoding algorithm.It discusses the encoder of Repeat Accumulate(RA) code based on iterative decoding,and then proposes a new method to implement the first stage of the encoder algorithm,which makes the encoding of RA like LDPC code in 802.11n and 802.16e much simpler.