Abstract
In this paper, we present a set of (exact and approximate) mathematical models and algorithms for determining the set of (globally) optimal distributed antenna deployments and the supported user demand in cellular code division multiple access (CDMA) systems. We focus on the uplink (user-to-base station) formulation and assume that the base station combines all the received signals at each of the antennas using path-gain based weights. In CDMA systems, as all users occupy the system bandwidth at the same time thereby interfering with each other, this results in a complicated 0–1 mixed-integer multilinear programming problem, where the objective function maximizes the total system capacity, while ensuring that the minimum signal-to-interference-plus-noise ratio (SINR) constraints and maximum transmit power constraints for each user are satisfied. This highly nonlinear, nonconvex problem is reformulated to yield a tight mixed-integer 0–1 linear programming representation via the addition of several auxiliary variables and constraints, and a specialized algorithm is designed to determine globally optimal solutions. The computational results obtained, corresponding to different user distributions, demonstrate the efficacy of the proposed models and algorithms, and clearly exhibit the viability of both exact and approximate models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.