Near-ML multiuser detection with linear filters and reliability-based processing

The prohibitive - exponential in the number of users - computational complexity of the maximum-likelihood multiuser detector for direct-sequence code-division multiple-access communications has fueled an extensive research effort for the development of low-complexity multiuser detection alternatives. We show that we can efficiently and effectively approach the error rate performance of the optimum multiuser detector as follows. We utilize a multiuser zero-forcing or minimum mean-square error (MMSE) linear filter as a preprocessor and we establish that the output magnitudes, when properly scaled, provide a reliability measure for each user bit decision. Then, we prepare an ordered, reliability-based error search sequence of length linear in the number of users; it returns the most likely user bit vector among all visited options. Numerical and simulation studies for moderately loaded systems that permit exact implementation of the optimum detector indicate that the error rate performance of the optimum and the proposed detector are nearly indistinguishable over the whole predetection. signal-to-noise ratio range of practical interest. Similar studies for higher user loads (that prohibit comparisons with the optimum detector) demonstrate error rate performance gains of orders of magnitude in comparison with straight decorrelating or MMSE multiuser detection.