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 - http://www.scopus.com/inward/record.url?scp=85029601297&partnerID=8YFLogxK
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 -