RBF Based Receivers for DS-CDMA with Reduced Complexity

This paper presents a Mahalanobis based RBF receiver structure with reduced complexity. It is also illustrated, how the RBF receiver could be employed as a multiuser detector. The RBF structure has superior performance over linear receiver structures and is equivalent to MLSD in an AWGN channel. However, a drawback is its complexity in multipath channels. Ideas from pattern recognition are exploited to reduce its complexity for multipath scenarios with little performance loss. I. INTRODUCTION DS-CDMA is a candidate for the next generation mobile system [1]. Research focuses on multiuser detector (MUD) schemes which process signals derived from a bank of matched filters (MF) [2, 3, 4]. These preprocessed signals are then fed into the receiver structure (MUD). The multipath combining process can be conducted either before or as part of the MUD process [4]. It has been shown that nonlinear receivers outperform linear receivers since the optimal decision boundary in DS-CDMA is nonlinear ..