View in EDS PDF Full Text

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

Saved in:
Bibliographic Details
Title: Adaptive deactivation and zero-forcing scheme for low-complexity LDPC decoders.
Authors: Kim, Taehyun1 samecorey@korea.ac.kr, Baik, Jonghyun2 jonghyun.baik@lge.com, Lee, Myeongwoo3 mw07.lee@samsung.com, Heo, Jun1 junheo@korea.ac.kr
Source: EURASIP Journal on Wireless Communications & Networking. 9/11/2017, Vol. 2017 Issue 1, p1-17. 17p.
Subjects: Message processing (Telecommunication), Adaptive codes, Decoders (Electronics), Algorithms, Normalized measures
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. [ABSTRACT FROM AUTHOR]
Copyright of EURASIP Journal on Wireless Communications & Networking is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
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. [ABSTRACT FROM AUTHOR]
ISSN:16871472
DOI:10.1186/s13638-017-0934-z