Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes
(2017) In IEEE Transactions on Communications 65(2). p.501-510- Abstract
Spatially coupled low-density parity-check codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a... (More)
Spatially coupled low-density parity-check codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a significant reduction in complexity without any loss in performance. Furthermore, based on observations made using density evolution, we propose a non-uniform pragmatic decoding schedule (parallel and serial) that does not require any additional calculations (e.g., BER estimates) within the decoding process.
(Less)
- author
- Ul Hassan, Najeeb ; Pusane, Ali E. ; Lentmaier, Michael LU ; Fettweis, Gerhard P. and Costello, Daniel J. Jr.
- organization
- publishing date
- 2017-02-01
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- decoding schedules, iterative decoding, LDPC codes, LDPC convolutional codes, spatially coupled codes, window decoding
- in
- IEEE Transactions on Communications
- volume
- 65
- issue
- 2
- article number
- 7762121
- pages
- 10 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000395825300003
- scopus:85013439614
- ISSN
- 0090-6778
- DOI
- 10.1109/TCOMM.2016.2633466
- language
- English
- LU publication?
- yes
- id
- a67a77f3-b8c0-43b9-8c67-7f08007bb112
- date added to LUP
- 2017-03-08 12:09:13
- date last changed
- 2024-09-15 21:35:49
@article{a67a77f3-b8c0-43b9-8c67-7f08007bb112,
abstract = {{<p>Spatially coupled low-density parity-check codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a significant reduction in complexity without any loss in performance. Furthermore, based on observations made using density evolution, we propose a non-uniform pragmatic decoding schedule (parallel and serial) that does not require any additional calculations (e.g., BER estimates) within the decoding process.</p>}},
author = {{Ul Hassan, Najeeb and Pusane, Ali E. and Lentmaier, Michael and Fettweis, Gerhard P. and Costello, Daniel J. Jr.}},
issn = {{0090-6778}},
keywords = {{decoding schedules; iterative decoding; LDPC codes; LDPC convolutional codes; spatially coupled codes; window decoding}},
language = {{eng}},
month = {{02}},
number = {{2}},
pages = {{501--510}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Communications}},
title = {{Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes}},
url = {{https://lup.lub.lu.se/search/files/35273512/FinalPaper.pdf}},
doi = {{10.1109/TCOMM.2016.2633466}},
volume = {{65}},
year = {{2017}},
}