Abstract
An algorithm is proposed that finds the optimum assignment of mobile users to base stations, and its associated transmission powers, in a cellular direct-sequence code-division multiple-access network, with a computational complexity that grows polynomially with the number of users and base stations. The algorithm detects infeasible situations and allows the inclusion of power constraints. Its performance is analyzed in terms of complexity and system capacity.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
