|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9101
|
| タイトル: | Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme |
| 著者: | Tran, Nghi H.
Le-Ngoc, Tho
Matsumoto, Tad
Nguyen, Ha H. |
| キーワード: | Multiple-antenna channels
capacity approaching performance
EXIT chart
convolutional code
repetition code
block code
anti-Gray mapping
Gray mapping
multi-dimensional mapping
error bound |
| 発行日: | 2010-04 |
| 出版者: | Institute of Electrical and Electronics Engineers (IEEE) |
| 誌名: | IEEE Transactions on Communications |
| 巻: | 58 |
| 号: | 4 |
| 開始ページ: | 1048 |
| 終了ページ: | 1059 |
| DOI: | 10.1109/TCOMM.2010.04.090116 |
| 抄録: | This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short memory-length convolutional codes or repetition codes and a short, and simple rate-1 linear block code, followed by either 1-dimensional (1-D) anti-Gray or Gray mapping of quadrature phase-shift keying (QPSK) modulation. By interpreting the rate-1 code and the 1-D mapping as a multi-D mapping performed over multiple transmit antennas, the error performance is analyzed in two regions. In the error-floor region, a tight union bound and the corresponding design criterion on the asymptotic performance are derived. The bound provides a useful tool to predict the error performance at relatively low bit error rate (BER) values. Based on the obtained design criterion, an optimal rate-1 code for each 1-D mapping is then constructed to achieve the best asymptotic performance. In the turbo pinch-off region, by using extrinsic information transfer (EXIT) charts, the most suitable mixed codes are selected for both symmetric and asymmetric antenna configurations. It is demonstrated that the simple concatenation scheme can achieve a near-capacity performance over the MIMO channels. Furthermore, its error performance is shown to be comparable to that obtained by using well-designed irregular LDPC and RA codes, and therefore, the proposed scheme significantly outperforms a scheme employing a parallel concatenated turbo code. Simulation results in various cases are provided to verify the analysis. |
| Rights: | Copyright (C) 2010 IEEE. Reprinted from IEEE Transactions on Communications, 58(4), 2010, 1048-1059. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of JAIST's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. |
| URI: | http://hdl.handle.net/10119/9101 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| ieee265.pdf | | 597Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
