Distance bounds for an ensemble of LDPC convolutional codes
Författare
Summary, in English
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance dL, of code segments of finite length L and on the free distance dfree are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio dL/v approaches the ratio dfee/v for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.
Publiceringsår
2007
Språk
Engelska
Sidor
4537-4555
Publikation/Tidskrift/Serie
IEEE Transactions on Information Theory
Volym
53
Issue
12
Fulltext
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- spatial coupling
- LDPC codes
- LDPC convolutional codes
Status
Published
Forskningsgrupp
- Telecommunication Theory
ISBN/ISSN/Övrigt
- ISSN: 0018-9448