Approaching Capacity with Asymptotically Regular LDPC Codes
(2009) Information Theory and Applications Workshop (ITA), 2009 p.173-177- Abstract
- We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be... (More)
- We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731617
- author
- Lentmaier, Michael LU ; Fettweis, Gerhard ; Zigangirov, Kamil LU and Costello Jr., Daniel J.
- organization
- publishing date
- 2009
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes
- host publication
- 2009 Information Theory and Applications Workshop
- pages
- 173 - 177
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- Information Theory and Applications Workshop (ITA), 2009
- conference location
- San Diego, CA, United Kingdom
- conference dates
- 2009-02-08 - 2009-02-13
- external identifiers
-
- scopus:70349280471
- ISBN
- 978-1-4244-3990-4
- DOI
- 10.1109/ITA.2009.5044941
- language
- English
- LU publication?
- no
- id
- ed803699-7320-4322-b7ab-1894c065bb87 (old id 3731617)
- date added to LUP
- 2016-04-04 10:46:52
- date last changed
- 2022-04-23 23:31:13
@inproceedings{ed803699-7320-4322-b7ab-1894c065bb87, abstract = {{We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement.}}, author = {{Lentmaier, Michael and Fettweis, Gerhard and Zigangirov, Kamil and Costello Jr., Daniel J.}}, booktitle = {{2009 Information Theory and Applications Workshop}}, isbn = {{978-1-4244-3990-4}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}}, language = {{eng}}, pages = {{173--177}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Approaching Capacity with Asymptotically Regular LDPC Codes}}, url = {{https://lup.lub.lu.se/search/files/5619574/3731625.pdf}}, doi = {{10.1109/ITA.2009.5044941}}, year = {{2009}}, }