Abstract
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 predeter-mined threshold α 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.
| Original language | English |
|---|---|
| Pages (from-to) | 333-337 |
| Number of pages | 5 |
| Journal | IEEE Vehicular Technology Conference |
| Volume | 59 |
| Issue number | 1 |
| Publication status | Published - 2004 Dec 1 |
| Externally published | Yes |
| Event | 2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World - Milan, Italy Duration: 2004 May 17 → 2004 May 19 |
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics