Systematic Modification of Parity-Check Matrices for Efficient Encoding of LDPC Codes

M. Shaqfeh, N. Goertz, John Thompson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

An algorithm for efficient encoding of LDPC codes is presented that does not impose any restrictions on the construction of the parity-check matrices. The algorithm modifies the parity check matrix, without changing the subspace spanned by its rows, by removing linear dependent rows and adding a small number of new rows such that the graph-based message-passing encoder will not get stuck in a stopping set. The added rows are designed by a new algorithm which is based on the notion of the "key set". The encoder exploits the sparseness of the parity-check matrix, and the encoding complexity grows almost linear with the blocksize, because the number of added rows, which may not be sparse, is relatively small.
Original languageEnglish
Title of host publicationCommunications, 2007. ICC '07. IEEE International Conference on
Pages945 -950
Publication statusPublished - 1 Jun 2007


Dive into the research topics of 'Systematic Modification of Parity-Check Matrices for Efficient Encoding of LDPC Codes'. Together they form a unique fingerprint.

Cite this