Reduced Complexity Code–length adaptive LDPC encoder
Honey Durga Tiwari, Chan Mo Kim, Yong Beom Cho · ICEIC : International Conference on Electronics, Informations and Communications · 2008
In this paper, we consider the encoding problem for LDPC codes. More generally, we consider the encoding problem for codes specified by sparse patterned parity?check matrices. We show how to exploit the patterned structure of the parity?check matrix to obtain efficient encoders. For the (3 6)?regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. Although, the associated coefficient can be made quite small, through pre?processing, this pre?processing is to done again for new design. We show that the number of calculations can be made linear by suggesting the considerations while selecting a parity check matrix for LDPC codes. Also the scheme can avoid re?computation of pre?processing for variable code length fixed code rate designs.