Transcription of LDPC Codes – a brief Tutorial - bernh
{{id}} {{{paragraph}}}
LDPC Codes a brief TutorialBernhard Leiner, : 8, 20051 IntroductionLow- density parity - check (LDPC) Codes are a class of linear blockLDPC Codes . The name comes from the characteristic of their parity -checkmatrix which contains only a few1 s in comparison to the amount of0 s. Their main advantage is that they provide a performance whichis very close to the capacity for a lot of different channels and lineartime complex algorithms for decoding. Furthermore are they suitedfor implementations that make heavy use of were first introduced by Gallager in his PhD thesis in ,1960 But due to the computational effort in implementing coder and en-coder for such Codes and the introduction of Reed-Solomon Codes ,they were mostly ignored until about ten years Representations for LDPC codesBasically there are two different possibilities to represent LDPC all linear block Codes they can be described via matrices.
LDPC Codes – a brief Tutorial Bernhard M.J. Leiner, Stud.ID.: 53418L bleiner@gmail.com April 8, 2005 1 Introduction Low-density parity-check (LDPC) codes are a class of linear block LDPC codes. The name comes from the characteristic of their parity-check matrix which contains only a few 1’s in comparison to the amount of 0’s.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}