|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9106
|
| タイトル: | A simple near-capacity concatenation scheme over MISO channels |
| 著者: | Tran, Nghi H.
Le-Ngoc, Tho
Mastumoto, Tad
Nguyen, Ha H. |
| キーワード: | Multiple-input single-output (MISO) channels
capacity-approaching performance
EXIT chart
convolutional code
repetition code
block code |
| 発行日: | 2009-09 |
| 出版者: | Institute of Electrical and Electronics Engineers (IEEE) |
| 誌名: | Sixth International Conference on Broadband Communications, Networks, and Systems, 2009. BROADNETS 2009 |
| 開始ページ: | 1 |
| 終了ページ: | 7 |
| DOI: | 10.4108/ICST.BROADNETS2009.7271 |
| 抄録: | This paper proposes a capacity-approaching, yet simple scheme over a multiple-input single-output (MISO) wireless fading channel, which is very common in the downlink of a cellular system. 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 rate-1 code together with 1-D mapping as a multi-D mapping performed over multiple transmit antennas, the error performance is analyzed in the turbo pinch-off region using EXIT chart. At first, a simple design criterion on the bit-wise mutual information with perfect a priori information is derived. Based on the obtained design criterion, an optimal rate-1 code for each 1-D mapping is then constructed to maximize the bit-wise mutual information with perfect a priori information. The combination of optimal rate-1 code and 1-D mapping results in a steep inner detector's EXIT curve over an MISO channel, which matches very well to that of a simple outer code. It is demonstrated that the simple concatenation scheme can achieve a near-capacity performance over the MISO channels. In some cases, the selected mixed code is just a simple repetition code. |
| Rights: | Copyright (C) 2009 IEEE. Reprinted from Sixth International Conference on Broadband Communications, Networks, and Systems, 2009. BROADNETS 2009. 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/9106 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| ieee271.pdf | | 3686Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
