Abstract
This letter considers joint beamformer assignment and power allocation (BAPA) for codebook-based downlink beamforming. The BAPA problem represents a mixed integer combinatorial program since beamformer assignments involve binary decisions and beamformer assignments of multiple users are coupled in the downlink SINR constraints. We develop a mixed integer linear program formulation of the BAPA problem, which can be solved using, e.g., the branch-and-cut method. To derive low-complexity solutions, we introduce a virtual uplink problem, in which beamformer assignments of different users are decoupled. We establish the uplink-downlink duality of the two problems and develop a customized iterative algorithm to solve the BAPA problem. Analytic studies show that the customized algorithm yields either optimal (within the desired numerical accuracy) solutions of the BAPA problem (when it is feasible), or infeasibility certificates (when infeasible). The performance of the algorithm is demonstrated with numerical examples.
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.
