Weighted Bit-Flipping 復号における Rate Compatible LDPC 符号のレート推定法の検討

Kenji Kita, Tetsuo Tsujioka

洋一 稲葉, 知明 大槻

Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian

Kenji Kita, Tetsuo Tsujioka

This paper considers a new rate estimation scheme for rate compatible LDPC (RC-LDPC) codes. We have investigated some estimation schemes for RC-LDPC codes even though there is no side information about code rates used at a transmitter. The previous schemes were based on log-likelihood ratio of sum-product decoders at a receiver. Because of too much computational complexity, simpler estimation schemes are expected to be developed. For this purpose, we focus on a simpler decoding scheme, thus weighted bit-flipping (WBF) decoding which have been much attention by many reseachers recently. In this paper, we propose a new rate estimation scheme and evaluate its performance. Simulation results show that the proposed scheme has advantages of much effectiveness and potential for estimating code rates.

稲葉洋一, 大槻知明

Yoichi Inaba

Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.