Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms
Abstract We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculat...
Main Authors: | Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2020-09-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13638-020-01791-5 |
Similar Items
-
An Improved Design of Gallager Mapping for LDPC-coded BICM-ID System
by: Lin Zhou, et al.
Published: (2016-06-01) -
On the Error Exponents of LDPC Codes Approaching Capacity Under a Low-Complexity Decoding Algorithm
by: Pavel Rybin, et al.
Published: (2021-02-01) -
CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE
by: H. Prashantha Kumar, et al.
Published: (2011-09-01) -
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
by: Zunaira Babar, et al.
Published: (2015-01-01) -
Decoding Optimization for 5G LDPC Codes by Machine Learning
by: Xiaoning Wu, et al.
Published: (2018-01-01)