Open AccessLow‐complexity linear group‐SIC detectors
Author(s) -
Bentrcia A.,
Zerguine A.,
Sheikh A. U.
Publication year - 2007
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1002/wcm.374
Subject(s) - detector , diagonal , single antenna interference cancellation , synchronous cdma , interference (communication) , computer science , polynomial , computational complexity theory , polynomial expansion , algorithm , code division multiple access , matrix (chemical analysis) , group (periodic table) , time complexity , multiuser detection , telecommunications , mathematics , physics , mathematical analysis , channel (broadcasting) , materials science , geometry , quantum mechanics , composite material
In this paper, we consider a linear group polynomial expansion successive interference cancellation (GPE‐SIC) detector in a synchronous CDMA system. It is a hybrid detector, which combines parallel and successive cancellation techniques in order to extract the advantages of both schemes. We use the fact that even if the cross‐correlation matrix of the system is not diagonal dominant, the sub‐matrices corresponding to different groups can be forced to be diagonal dominant by suitable grouping of users to approximate the decorrelator/MMSE detector by a low‐complexity polynomial expansion detector. The latter is computationally very efficient if the cross‐correlation matrix of users within the same group is diagonal dominant. Simulation results showed that the (GPE‐SIC) detector has the same performance as the linear group decorrelator successive interference cancellation (GDEC‐SIC) detector but with low‐computational complexity. Copyright © 2006 John Wiley & Sons, Ltd.