Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Distance bounds for an ensemble of LDPC convolutional codes

Sridharan, Arvind ; Truhachev, Dmitri ; Lentmaier, Michael LU ; Costello Jr., Daniel J. and Zigangirov, Kamil LU (2007) In IEEE Transactions on Information Theory 53(12). p.4537-4555
Abstract
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.
Please use this url to cite or link to this publication:
author
; ; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
spatial coupling, LDPC codes, LDPC convolutional codes
in
IEEE Transactions on Information Theory
volume
53
issue
12
pages
4537 - 4555
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • scopus:49049101282
ISSN
0018-9448
DOI
10.1109/TIT.2007.909113
language
English
LU publication?
yes
id
38c687bf-5119-4409-a907-83750a5e7d81 (old id 3731678)
date added to LUP
2016-04-04 09:09:09
date last changed
2022-04-08 01:38:25
@article{38c687bf-5119-4409-a907-83750a5e7d81,
  abstract     = {{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.}},
  author       = {{Sridharan, Arvind and Truhachev, Dmitri and Lentmaier, Michael and Costello Jr., Daniel J. and Zigangirov, Kamil}},
  issn         = {{0018-9448}},
  keywords     = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
  language     = {{eng}},
  number       = {{12}},
  pages        = {{4537--4555}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Transactions on Information Theory}},
  title        = {{Distance bounds for an ensemble of LDPC convolutional codes}},
  url          = {{https://lup.lub.lu.se/search/files/5245944/3731679.pdf}},
  doi          = {{10.1109/TIT.2007.909113}},
  volume       = {{53}},
  year         = {{2007}},
}