Low‐complexity ad‐hoc non‐linearities for blind multiuser detection of long‐code code‐division multiple access signals and asymptotic performance evaluation

Abstract

In this study, monomials with odd integer powers are proposed for blind multiuser detection of code-division multiple access signals with long spreading codes, in the near-far situation. The performance of the new non-linear detectors are substantiated asymptotically and confirmed via simulations. It is demonstrated that the proposed non-linear detectors significantly outperform the matched filter detector in the block fading and Ricean fading channels, at the cost of a small increase in computational complexity. The optimum integer power value for the block fading channel with a limited interferer level, the Ricean channel with a given K factor and asynchronous channel is determined. The proposed multiuser detectors are blind in the sense that they require neither training nor the spreading code of the interferers. The detectors also do not require long convergence time for decision making in contrast to conventional blind multiuser detectors.