By Topic

Reduced-Complexity Belief Propagation for System-Wide MUD in the Uplink of Cellular Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bavarian, S. ; Simon Fraser Univ., Burnaby ; Cavers, J.K.

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.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:26 ,  Issue: 3 )