Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel

Youichi Inaba, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
Pages333-337
Number of pages5
Volume59
Edition1
Publication statusPublished - 2004
Externally publishedYes
Event2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World - Milan, Italy
Duration: 2004 May 172004 May 19

Other

Other2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World
CountryItaly
CityMilan
Period04/5/1704/5/19

Fingerprint

Fading channels
Decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Inaba, Y., & Ohtsuki, T. (2004). Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel. In IEEE Vehicular Technology Conference (1 ed., Vol. 59, pp. 333-337)

Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel. / Inaba, Youichi; Ohtsuki, Tomoaki.

IEEE Vehicular Technology Conference. Vol. 59 1. ed. 2004. p. 333-337.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Inaba, Y & Ohtsuki, T 2004, Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel. in IEEE Vehicular Technology Conference. 1 edn, vol. 59, pp. 333-337, 2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World, Milan, Italy, 04/5/17.
Inaba Y, Ohtsuki T. Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel. In IEEE Vehicular Technology Conference. 1 ed. Vol. 59. 2004. p. 333-337
Inaba, Youichi ; Ohtsuki, Tomoaki. / Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel. IEEE Vehicular Technology Conference. Vol. 59 1. ed. 2004. pp. 333-337
@inproceedings{3b8eebf6ebcf4a01b77667775ad3677b,
title = "Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel",
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.",
author = "Youichi Inaba and Tomoaki Ohtsuki",
year = "2004",
language = "English",
volume = "59",
pages = "333--337",
booktitle = "IEEE Vehicular Technology Conference",
edition = "1",

}

TY - GEN

T1 - Performance of Low Density Parity Check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel

AU - Inaba, Youichi

AU - Ohtsuki, Tomoaki

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=15344341439&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=15344341439&partnerID=8YFLogxK

M3 - Conference contribution

VL - 59

SP - 333

EP - 337

BT - IEEE Vehicular Technology Conference

ER -