Computation of minimum complexity for near optimal synchronous CDMA multiuser detection

In this paper, we show how to compute the minimum complexity (in terms of the number of paths kept) for near optimal M-algorithm multiuser detection. Several proven properties of the vector Euclidean distance (VED) are utilised to give an efficient algorithm for computing the minimum VED leading to a value for the minimum required number of paths to be kept for a given number of users. The analytical results are supported by the simulation results.