| タイトル | Multiuser Detection Algorithms for CDMA based on the Massage Passing Algorithms |
|---|---|
| 著者 | Shunsuke Horii 、Tota Suko 、Toshiyasu Matsushima |
| 年度 | 2006 |
| 形式 | 国際学会 |
| 分野 | その他 |
| 掲載雑誌名 | IEICE technical report substituted for proc. of 2006 Hawaii, IEICE and SITA Joint Conference on Information Theory (HISC2006) |
| 掲載号・ページ | vol.106, no.60, IT2006-16, pp.17-22 |
| 掲載年 | 2006 |
| 掲載月 | 5 |
| アブスト （日本語） |
学会名：IEICE technical report substituted for proc. of 2006 Hawaii, IEICE and SITA Joint Conference on Information Theory (HISC2006) 日程：2006年5月25日 場所：Hawaii, USA |
| アブスト （英語） |
Optimal multiuser detection for the direct sequence code division multiple access (DS-CDMA) channel is known to be NP-hard, i.e., its computational complexity increase exponentially with the number of users. If regarding the detection problem as the probabilistic inference problem, one of the principled approaches to derive the algorithm for the detection problem is to apply the message passing algorithm such as the belief propagation (BP) algorithm and the concave convex procedure (CCCP) on a graph after obtaining the graphical representation of the problem. But it has been reported that the computational complexity of the resulting algorithms are exponentially increasing as the number of users increases since the graphical representation of the detection problem become a complete bipartite graph. Consequently it has been proposed that to reduce the computational complexity through approximating the algorithms with the central limit theorem.\\ In this paper, we suggest that we can reduce the computational complexity of the message passing algorithms for the detection problem by converting the graph structure, and as a result, the message passing algorithms can be applied in the same way of the definition without approximation. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
