|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9817
|
| タイトル: | Irregular repetition and single parity check coded BICM-ID using extended mapping -Optimal node degree allocation- |
| 著者: | Fukawa, Kisho
Zhao, Dan
Tolli, Antti
Matsumoto, Tad |
| キーワード: | BICM-ID
EXIT Chart
Close-Capacity Performance
Linear Programming
Optimal Degree Allocation
Extended Mapping |
| 発行日: | 2010-08 |
| 出版者: | Institute of Electrical and Electronics Engineers (IEEE) |
| 誌名: | 2010 5th International ICST Conference on Communications and Networking in China (CHINACOM) |
| 開始ページ: | 1 |
| 終了ページ: | 6 |
| 抄録: | Since BICM-ID is a concatenation between channel coding and mapping, its performances strongly depend on the matching between mapping rule and code structure. In our previous papers, we proposed a yet very simple, close Shannon limit achieving BICM-ID system. It uses very simple codes, irregular repetition and single parity check codes, combined with extended mapping. Even though we know that the key role played towards the optimal design of the proposed code is the degree allocation for variable nodes, the irregular degree allocation to the node degrees were determined only empirically, by try-anderror. This paper shows that the problem of the optimal degree allocation for the proposed BICM-ID technique can be solved by using linear programming technique. Results shows we can achieve better matching between the de-mapper and decoder curves, by which we can achieve even closer threshold to the Shannon limit and also lower error floor. |
| Rights: | Copyright (C) 2010 IEEE. Reprinted from 2010 5th International ICST Conference on Communications and Networking in China (CHINACOM), 2010, 1-6. 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/9817 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 15702-1.pdf | | 1332Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
