Systematic modification of parity-check matrices for efficient encoding of LDPC codes

Mohammad Shaqfeh, Norbert Goertz

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

3 Citations (Scopus)

Abstract

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 publication2007 IEEE International Conference on Communications, ICC'07
Pages945-950
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: 24 Jun 200728 Jun 2007

Other

Other2007 IEEE International Conference on Communications, ICC'07
CountryUnited Kingdom
CityGlasgow, Scotland
Period24/6/0728/6/07

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Shaqfeh, M., & Goertz, N. (2007). Systematic modification of parity-check matrices for efficient encoding of LDPC codes. In 2007 IEEE International Conference on Communications, ICC'07 (pp. 945-950). [4288831] https://doi.org/10.1109/ICC.2007.160