|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/13481
|
| タイトル: | Decoding Techniques for Graph-based Random Access High Dense Multiway Multirelay Networks |
| 著者: | Anwar, Khoirul |
| キーワード: | Multiway Multi Relay
Coded Random Access
Slotted ALOHA
EXIT chart |
| 発行日: | 2015-11 |
| 出版者: | The Institute of Electronics, Information and Communication Engineers (IEICE) |
| 誌名: | The 38th Symposium on Information Theory and its Applications (SITA2015) |
| 抄録: | Densely deployed wireless network is one of the most important solutions for spectrum crunch expected by 2020 with a huge economic impact. This paper proposes decoding schemes for high dense multiway multirelaying (hd-MWMR) systems comprising two multiway relays to serve huge number of users. Due to the nature of huge number, instead of using perfect scheduling, we consider coded random access schemes, where all users transmit their messages without coordination. Although the transmission is uncoordinated, the network structure still has a structure that provide an advantage. The theoretical bound for hd-MWMR systems exploiting two multiway relays is derived. To achieve the bound, we propose simple coding and decoding schemes based on iterative interference cancellation over a sparse graph involving two multiway relays. The results confirm that the second relay helps on the improvement of throughput performances, which is highly required for future wireless networks. |
| Rights: | Copyright (C) 2015 The Institute of Electronics, Information and Communication Engineers (IEICE). Khoirul Anwar, The 38th Symposium on Information Theory and its Applications (SITA2015), 2015. |
| URI: | http://hdl.handle.net/10119/13481 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 21918.pdf | | 1758Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
