Abstract

This paper considers the problem of joint detection in the uplink of cellular multiaccess networks with base-station cooperation. Distributed multiuser detection algorithms with local passing among neighbor base stations are proposed and compared in terms of computational complexity required in the base stations, the amount of serial communications among them, error rate performance, and convergence speed. The algorithms based on the belief propagation algorithm result in complexity and delay per base station which do not grow as the network size increases. In addition, it is observed that these algorithms have near single user error rate performance for the fading channels considered. Thus it is illustrated that using the belief propagation algorithm, it is possible to use non-orthogonal signaling and still achieve near single user performance with moderate computational complexity and a limited amount of message passing between base stations of adjacent cells.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.