Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Comparison of LDPC Block and LDPC Convolutional Codes Based on their Decoding Latency

Ul Hassan, Najeeb ; Lentmaier, Michael LU and Fettweis, Gerhard (2012) International Symposium on Turbo Codes & Related Topics (ISTC), 2012 p.225-229
Abstract
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10-5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We... (More)
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10-5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes. (Less)
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
spatial coupling, LDPC codes, LDPC convolutional codes
host publication
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
pages
225 - 229
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
International Symposium on Turbo Codes & Related Topics (ISTC), 2012
conference location
Gothenburg, Sweden
conference dates
2012-08-27 - 2012-08-31
external identifiers
  • scopus:84870843246
ISSN
2165-4700
ISBN
978-1-4577-2114-4
DOI
10.1109/ISTC.2012.6325232
language
English
LU publication?
no
id
4bb92959-286e-4021-8a2e-c4b82f1804e0 (old id 3731085)
date added to LUP
2016-04-01 13:56:20
date last changed
2022-05-15 08:04:09
@inproceedings{4bb92959-286e-4021-8a2e-c4b82f1804e0,
  abstract     = {{We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10-5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.}},
  author       = {{Ul Hassan, Najeeb and Lentmaier, Michael and Fettweis, Gerhard}},
  booktitle    = {{2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)}},
  isbn         = {{978-1-4577-2114-4}},
  issn         = {{2165-4700}},
  keywords     = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
  language     = {{eng}},
  pages        = {{225--229}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Comparison of LDPC Block and LDPC Convolutional Codes Based on their Decoding Latency}},
  url          = {{https://lup.lub.lu.se/search/files/3675481/3731088.pdf}},
  doi          = {{10.1109/ISTC.2012.6325232}},
  year         = {{2012}},
}