Skip to Main Content
System-wide multiuser detection (MUD), in which all base stations (BSs) of a cellular system cooperate to detect the data of all mobile stations (MSs), has much promise. However, little is known at present about practical techniques or their performance. An attractive method is belief propagation (BP), with message exchange between nearby cooperating BSs over a backbone landline network, but its performance is known only for a greatly simplified network model and its computation load grows exponentially with the number of interfering MS symbols at each BS. In this paper, we present a reduced complexity variation of BP (RCBP) and show that its performance is close to or identical to that of BP in the simplified network. We also observe excellent performance by iterative multiuser detection and decoding of low-density parity check codes (LDPC). Furthermore, we examine RCBP performance in a realistic wireless network model, with path loss, shadowing, fading and power control. These results, though poorer than those of the simplified network, show that system-wide MUD with cooperating BSs provides great improvement compared with conventional systems.