Lowering the Error Floors of Irregular LDPC Code on Fast Fading Environment with Perfect and Imperfect CSIs
-
- GOUNAI Satoshi
- Graduate School of Electrical Engineering, Tokyo University of Science
-
- OHTSUKI Tomoaki
- Department of Information and Computer Science, Keio University
-
- KANEKO Toshinobu
- Department of Electrical Engineering, Tokyo University of Science
この論文をさがす
抄録
Irregular LDPC codes can achieve better error rate performance than regular LDPC codes. However, irregular LDPC codes have higher error floors than regular LDPC codes. The Ordered Statistic Decoding (OSD) algorithm achieves approximate Maximum Likelihood (ML) decoding. ML decoding is effective to lower error floors. However, the OSD estimates satisfy the parity check equation of the LDPC code even the estimates are wrong. Hybrid decoder combining LLR-BP decoding algorithm and the OSD algorithm cannot also lower error floors, because wrong estimates also satisfy the LDPC parity check equation. We proposed the concatenated code constructed with an inner irregular LDPC code and an outer Cyclic Redundancy Check (CRC). Owing to CRC, we can detect wrong codewords from OSD estimates. Our CRC-LDPC code with hybrid decoder can lower error floors in an AWGN channel. In wireless communications, we cannot neglect the effects of the channel. The OSD algorithm needs the ordering of each bit based on the reliability. The Channel State Information (CSI) is used for deciding reliability of each bit. In this paper, we evaluate the Block Error Rate (BLER) of the CRC-LDPC code with hybrid decoder in a fast fading channel with perfect and imperfect CSIs where 'imperfect CSI' means that the distribution of channel and those statistical average of the fading amplitudes are known at the receiver. By computer simulation, we show that the CRC-LDPC code with hybrid decoder can lower error floors than the conventional LDPC code with hybrid decoder in the fast fading channel with perfect and imperfect CSIs. We also show that combining error detection with the OSD algorithm is effective not only for lowering the error floor but also for reducing computational complexity of the OSD algorithm.
収録刊行物
-
- IEICE transactions on communications
-
IEICE transactions on communications 90 (3), 569-577, 2007-03-01
一般社団法人電子情報通信学会
- Tweet
キーワード
詳細情報
-
- CRID
- 1571698602462693760
-
- NII論文ID
- 110007519279
-
- NII書誌ID
- AA10826261
-
- ISSN
- 09168516
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles