کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
449800 1443249 2006 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A low complexity multiuser detector for synchronous CDMA system
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
A low complexity multiuser detector for synchronous CDMA system
چکیده انگلیسی

In a code-division multiple-access (CDMA) system, multiuser detection (MUD) can exploit the information of signals from other interfering users to increase the system capacity. However, the optimum MUD for CDMA systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In this paper, we apply a hybrid algorithm to develop a suboptimal MUD strategy. The result of symmetric successive overrelaxation (SSOR) preconditioned conjugate-gradient method is first used to initialize the reduced-complexity recursive (RCR) multiuser detector. Then, RCR algorithm is applied to detect the received data bit by optimizing an objective function in relation with the linear system of decorrelating detector. Simulation results for the synchronous case show that the performance of our proposed SSOR-RCR multiuser detector is promising and outperform the decorrelator and linear minimum mean squared error multiuser detector with lower computational complexity.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AEU - International Journal of Electronics and Communications - Volume 60, Issue 7, 3 July 2006, Pages 513–520
نویسندگان
, , , , ,