DS/CDMA Multiuser Detection Based on Polynomial Expansion Subspace Signal

In this work, we proposed a comparative analysis for the performance-complexity tradeoff of several Hybrid Group-blind multiuser detectors with polynomial expansion (MuD Group-Blind PE). Using flop notation, the computational complexity for the three forms of SBld-MuD-II hybrid detector based on polynomial approximation was compared. MCS results indicated the superiority of the SBld-MuD-I detector in the presence of parameters errors estimates and for the SBld-MuD-II detector with polynomial approach based on Gershgorin circles.