Hybrid Local Search Polynomial-Expanded Linear Multiuser Detector
Reinaldo Gotz, Taufik Abrão

DOI: 10.14209/sbrt.2012.8
Evento: XXX Simpósio Brasileiro de Telecomunicações (SBrT2012)
Keywords: suboptimum search algorithms polynomial ex- panded multiuser detection Gerschgorin circles DS/CDMA
In order to reduce computational complexity in- herent to cross-correlation matrix inversion in DS/CDMA sys- tem, this work proposes a hybrid multiuser detector based on polynomial expansion (PE-MuD) followed by a low complexity local search procedure, aiming at obtaining a near-optimum multiuser bit-error-rate (BER) performance, but with an amount of computational processing saving time. The proposed hy- brid PE-MuD receiver topology is analyzed under realistic wireless mobile channels, as well as useful system operation scenarios. Simulations results have indicated an improvement in performance-complexity trade-off regarding the classical linear multiuser detectors (MuD) performance, particularly, the mean square error minimization-based detector (MMSE).