Abstract
In direct sequence (DS) code division multiple access (CDMA) systems, multiuser detection offers important performance gains compared to conventional detection. The optimum multiuser detection is computationally very complex and requires knowledge, e.g. of the signal energies and cross-correlations. In this paper two adaptive suboptimal multiuser detection algorithms are investigated in the symbol-synchronous case and tested by simulations. The algorithms are based on the classical projection theorem of Hilbert spaces and the idea is to minimize the error vector between the matched filter output and the detected information bit. Both the algorithms have computational complexity linearly dependent on the number of users. The simulations show that it is possible to achieve the multistage detector performance based only on knowledge of the matched filter output.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
