Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders

Taehyun Kim; Jonghyun Baik; Myeongwoo Lee; Jun Heo

doi:10.1186/s13638-017-0934-z

Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders

Taehyun Kim, Jonghyun Baik, Myeongwoo Lee, Jun Heo^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

A modified message propagation algorithm is proposed for a low-complexity decoder of low-density parity-check (LDPC) codes, which controls the information propagated from variable and check nodes.The proposed threshold-based node deactivation for variable nodes and zero-forcing scheme for check nodes remarkably reduce decoding complexity required for similar error performance. In the proposed scheme, different thresholds, which are determined from the base matrix of the LDPC codes, are applied for each type of variable node. In addition, thresholds for deactivating variable nodes are increased while the decoding process is operated for a reduction in decoding complexity without early error floor, which is a drawback of the conventional threshold-based deactivation scheme. Simulation results show that the proposed scheme enables normalized min-sum decoders to decode successfully with less complexity than the conventional threshold-based deactivating scheme.

Original language	English
Article number	153
Journal	Eurasip Journal on Wireless Communications and Networking
Volume	2017
Issue number	1
DOIs	https://doi.org/10.1186/s13638-017-0934-z
Publication status	Published - 2017 Dec 1

Bibliographical note

Funding Information:
This research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2017-2015-0-00385) supervised by the IITP (Institute for Information and communications Technology Promotion).

Publisher Copyright:
© 2017, The Author(s).

Keywords

Complexity reduction
Low-density parity-check codes
Normalized min-sum algorithm
Protograph-based extrinsic transfer chart

ASJC Scopus subject areas

Signal Processing
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1186/s13638-017-0934-z

Cite this

@article{496ec9ce9af6449db1a981fe4bcdc58a,

title = "Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders",

abstract = "A modified message propagation algorithm is proposed for a low-complexity decoder of low-density parity-check (LDPC) codes, which controls the information propagated from variable and check nodes.The proposed threshold-based node deactivation for variable nodes and zero-forcing scheme for check nodes remarkably reduce decoding complexity required for similar error performance. In the proposed scheme, different thresholds, which are determined from the base matrix of the LDPC codes, are applied for each type of variable node. In addition, thresholds for deactivating variable nodes are increased while the decoding process is operated for a reduction in decoding complexity without early error floor, which is a drawback of the conventional threshold-based deactivation scheme. Simulation results show that the proposed scheme enables normalized min-sum decoders to decode successfully with less complexity than the conventional threshold-based deactivating scheme.",

keywords = "Complexity reduction, Low-density parity-check codes, Normalized min-sum algorithm, Protograph-based extrinsic transfer chart",

author = "Taehyun Kim and Jonghyun Baik and Myeongwoo Lee and Jun Heo",

note = "Funding Information: This research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2017-2015-0-00385) supervised by the IITP (Institute for Information and communications Technology Promotion). Publisher Copyright: {\textcopyright} 2017, The Author(s).",

year = "2017",

month = dec,

day = "1",

doi = "10.1186/s13638-017-0934-z",

language = "English",

volume = "2017",

journal = "Eurasip Journal on Wireless Communications and Networking",

issn = "1687-1472",

publisher = "SpringerOpen",

number = "1",

}

TY - JOUR

T1 - Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders

AU - Kim, Taehyun

AU - Baik, Jonghyun

AU - Lee, Myeongwoo

AU - Heo, Jun

N1 - Funding Information: This research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2017-2015-0-00385) supervised by the IITP (Institute for Information and communications Technology Promotion). Publisher Copyright: © 2017, The Author(s).

PY - 2017/12/1

Y1 - 2017/12/1

N2 - A modified message propagation algorithm is proposed for a low-complexity decoder of low-density parity-check (LDPC) codes, which controls the information propagated from variable and check nodes.The proposed threshold-based node deactivation for variable nodes and zero-forcing scheme for check nodes remarkably reduce decoding complexity required for similar error performance. In the proposed scheme, different thresholds, which are determined from the base matrix of the LDPC codes, are applied for each type of variable node. In addition, thresholds for deactivating variable nodes are increased while the decoding process is operated for a reduction in decoding complexity without early error floor, which is a drawback of the conventional threshold-based deactivation scheme. Simulation results show that the proposed scheme enables normalized min-sum decoders to decode successfully with less complexity than the conventional threshold-based deactivating scheme.

AB - A modified message propagation algorithm is proposed for a low-complexity decoder of low-density parity-check (LDPC) codes, which controls the information propagated from variable and check nodes.The proposed threshold-based node deactivation for variable nodes and zero-forcing scheme for check nodes remarkably reduce decoding complexity required for similar error performance. In the proposed scheme, different thresholds, which are determined from the base matrix of the LDPC codes, are applied for each type of variable node. In addition, thresholds for deactivating variable nodes are increased while the decoding process is operated for a reduction in decoding complexity without early error floor, which is a drawback of the conventional threshold-based deactivation scheme. Simulation results show that the proposed scheme enables normalized min-sum decoders to decode successfully with less complexity than the conventional threshold-based deactivating scheme.

KW - Complexity reduction

KW - Low-density parity-check codes

KW - Normalized min-sum algorithm

KW - Protograph-based extrinsic transfer chart

UR - https://www.scopus.com/pages/publications/85029601297

U2 - 10.1186/s13638-017-0934-z

DO - 10.1186/s13638-017-0934-z

M3 - Article

AN - SCOPUS:85029601297

SN - 1687-1472

VL - 2017

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

IS - 1

M1 - 153

ER -

Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this