On bounding the performance of group-wise multiuser detectors

We develop a union bound on the error performance of group-wise symbol detectors in frequency-flat Rayleigh fading channels. The bound is applicable to detectors that search over a subspace of the total symbol space. It provides a means to investigate tradeoffs among system parameters such as group size versus error performance.