Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Bootstrapped Low Complexity Iterative Decoding Algorithm for Low Density Parity Check (LDPC) Codes

Albashir Adel Mohamed, Maha Mohamed Elsabrouty, Salwa Elramly

Published Jan 1, 2010• 0 citations
Publisher
DOI
10.1007/978-3-642-17758-3_29

Related papers

Bootstrap decoding of low-density parity-check codes

A. Nouh, Amir H. Banihashemi

An initial bootstrap step for the decoding of low-density parity-check (LDPC) codes is proposed. Decoding is initiated by first erasing a number of less reliable bits. New values and reliabilities are then assigned to erasure bits by passing messages from nonerasure bits through the reliable check equations. The bootstrap step is applied to the weighted bit-flipping algorithm to decode a number of LDPC codes. Large improvements in both performance and complexity are observed.

IEEE Communications Letters•Sep 1, 2002•34 citations

New interative decoding algorithms for low-density parity-check (LDPC) codes

Nastaran Mobini

•Jan 1, 2011•0 citations

Performance of low density parity check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel

Yoichi Inaba, Tomoaki Otsuki Ohtsuki

Low density parity check (LDPC) codes can be decoded in various ways, namely the bit-flipping (BF) algorithm, the weighted BF (WBF) algorithm and the log-likelihood ratio belief propagation (LLR-BP) algorithm, and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. Recently, the bootstrapped WBF (BWBF) algorithm has been proposed to improve the error rate performance and the decoding complexity of the WBF algorithm. In this paper, we study the effects of the predetermined threshold /spl alpha/ of the bootstrap step on BER for various LDPC codes. Furthermore, we apply the bootstrap step to the LLR-BP algorithm. We evaluate the BWBF and the bootstrapped LLR-BP (B-LLR-BP) algorithms on a fast fading channel. We show that the optimal threshold depends on the row and column weights of the LDPC codes. We also show that the BWBF algorithm provides a large improvements in both the error rate performance and the decoding complexity on a fast fading channel. Moreover, we show that the LLR-BP algorithm hardly receives the effect of the bootstrap step.

IEEE Vehicular Technology Conference•Feb 22, 2005•4 citations

Low Complexity Decoding Algorithm for Nonbinary LDPC Codes

Xuefei Yang, Wei Li, Huang Lian

Communications in computer and information science•Jan 1, 2011•1 citation

Bootstrapped Iterative Decoding Algorithms for Low Density Parity Check (LDPC) Codes

Albashir Adel Mohamed, Maha Mohamed Elsabrouty, Salwa Elramly

Reliability ratio based weighted bit-flipping algorithm is one of the best hard decision decoding algorithms in performance. Recently several modifications are done to this technique either to improve performance or to lower the complexity. The implementation efficient reliability ratio based weighted bit-flipping is developed targeting decreasing processing time of the decoding process. In this paper we are targeting improving performance of recent developed algorithm named low complex implementation efficient reliability ratio based weighted bit-flipping by adding a bootstrap step to the decoding technique which leads to increase in reliability of received bits then number of decoded bits will be increased leading to improve in performance. Also a modification done to bootstrap step for further increase the performance.

International Conference on Systems and Networks Communications•Aug 1, 2010•3 citations

Iterative Decoding with Bias Terms for LDPC Codes

Hiroshi Kamabe, Shusaku Kobota

IEICE Technical Report; IEICE Tech. Rep.•Dec 31, 2009•0 citations
Low density parity check (LDPC) codes can be decoded in various ways, namely the bit-flipping (BF) algorithm, the weighted BF (WBF) algorithm and the log-likelihood ratio belief propagation (LLR-BP) algorithm, and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. Recently, the bootstrapped WBF (BWBF) algorithm has been proposed to improve the error rate performance and the decoding complexity of the WBF algorithm. In this paper, we study the effects of the predetermined threshold /spl alpha/ of the bootstrap step on BER for various LDPC codes. Furthermore, we apply the bootstrap step to the LLR-BP algorithm. We evaluate the BWBF and the bootstrapped LLR-BP (B-LLR-BP) algorithms on a fast fading channel. We show that the optimal threshold depends on the row and column weights of the LDPC codes. We also show that the BWBF algorithm provides a large improvements in both the error rate performance and the decoding complexity on a fast fading channel. Moreover, we show that the LLR-BP algorithm hardly receives the effect of the bootstrap step.
Reliability ratio based weighted bit-flipping algorithm is one of the best hard decision decoding algorithms in performance. Recently several modifications are done to this technique either to improve performance or to lower the complexity. The implementation efficient reliability ratio based weighted bit-flipping is developed targeting decreasing processing time of the decoding process. In this paper we are targeting improving performance of recent developed algorithm named low complex implementation efficient reliability ratio based weighted bit-flipping by adding a bootstrap step to the decoding technique which leads to increase in reliability of received bits then number of decoded bits will be increased leading to improve in performance. Also a modification done to bootstrap step for further increase the performance.