Du är här

On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes

Författare:
Publiceringsår: 2008
Språk: Engelska
Dokumenttyp: Konferensbidrag

Sammanfattning

Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing the single parity-check constituent codes in Gallager's LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDPC codes for which such iterative decoding corrects any error pattern with a number of errors that
grows linearly with the code length. The number of required decoding iterations is a logarithmic function of the code length. The fraction of correctable errors is computed numerically for different code parameters.

Disputation

Nyckelord

  • Technology and Engineering
  • iterative decoding
  • LDPC codes
  • Hamming codes
  • asymptotic performance

Övrigt

11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)
2008-06-16
Pamporovo, Bulgaria
Published
Yes
  • Informations- och kommunikationsteori
  • Information Theory

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo