Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes
(2013) IEEE Global Communications Conference (GLOBECOM), 2013- Abstract
- Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity... (More)
- Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity compared to uniform window schedules. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3954390
- author
- Ul Hassan, Najeeb ; Pusane, Ali Emre ; Lentmaier, Michael LU ; Fettweis, Gerhard and Costello Jr., Daniel J.
- organization
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes
- host publication
- [Host publication title missing]
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE Global Communications Conference (GLOBECOM), 2013
- conference location
- Atlanta, GA, United States
- conference dates
- 2013-12-09 - 2013-12-13
- external identifiers
-
- scopus:84904135254
- language
- English
- LU publication?
- yes
- id
- 1cb6aa3e-0d36-4759-9f81-409f0e956a56 (old id 3954390)
- date added to LUP
- 2016-04-04 10:46:34
- date last changed
- 2022-01-29 20:47:47
@inproceedings{1cb6aa3e-0d36-4759-9f81-409f0e956a56,
abstract = {{Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity compared to uniform window schedules.}},
author = {{Ul Hassan, Najeeb and Pusane, Ali Emre and Lentmaier, Michael and Fettweis, Gerhard and Costello Jr., Daniel J.}},
booktitle = {{[Host publication title missing]}},
keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes}},
url = {{https://lup.lub.lu.se/search/files/5618449/4248110.pdf}},
year = {{2013}},
}