Multiuser detection with branch-and-bound-based algorithm using user grouping for synchronous CDMA <Abstract> Branch-and-Bound method for multiuser detection (MUD) achieves close to the performance of the Maximum Likelihood Detector (MLD). However, it is unlikely to be implemented in a practical system since the worst case computational cost of the BBD method grows exponentially in the number of users. In this paper, we propose a novel method for MUD based on the branch-and-bound (BBD) method using user grouping. The worst case computational cost of the proposed method is much less than that of the BBD method by partitioning all users into some disjoint groups. Moreover, some candidate solutions are derived in each group. For the improvement of the performance, finally, the best solution is determined from all combinations of the candidate solutions in the proposed method. The performance of the proposed method is evaluated by computer simulation. |