講演名 2006-05-25
Multiuser Detection Algorithms for CDMA based on the Massage Passing Algorithms(HISC2006)
,
PDFダウンロードページ PDFダウンロードページへ
抄録(和)
抄録(英) 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.
キーワード(和)
キーワード(英) CDMA / factor graph / belief propagation / concave convex procedure
資料番号 IT2006-16
発行日

研究会情報
研究会 IT
開催期間 2006/5/18(から1日開催)
開催地(和)
開催地(英)
テーマ(和)
テーマ(英)
委員長氏名(和)
委員長氏名(英)
副委員長氏名(和)
副委員長氏名(英)
幹事氏名(和)
幹事氏名(英)
幹事補佐氏名(和)
幹事補佐氏名(英)

講演論文情報詳細
申込み研究会 Information Theory (IT)
本文の言語 ENG
タイトル(和)
サブタイトル(和)
タイトル(英) Multiuser Detection Algorithms for CDMA based on the Massage Passing Algorithms(HISC2006)
サブタイトル(和)
キーワード(1)(和/英) / CDMA
第 1 著者 氏名(和/英) / Shunsuke Horii
第 1 著者 所属(和/英)
Waseda University
発表年月日 2006-05-25
資料番号 IT2006-16
巻番号(vol) vol.106
号番号(no) 60
ページ範囲 pp.-
ページ数 6
発行日