arXiv · 2112.03512
Constrained Resource Allocation Problems in Communications: An Information-assisted Approach
Abstract
We consider a class of resource allocation problems given a set of unconditional constraints whose objective function satisfies Bellman's optimality principle. Such problems are ubiquitous in wireless communication, signal processing, and networking. These constrained combinatorial optimization problems are, in general, NP-Hard. This paper proposes two algorithms to solve this class of problems using a dynamic programming framework assisted by an information-theoretic measure. We demonstrate that the proposed algorithms ensure optimal solutions under carefully chosen conditions and use significantly reduced computational resources. We substantiate our claims by solving the power-constrained bit allocation problem in 5G massive Multiple-Input Multiple-Output receivers using the proposed approach.
Explore related subjects
Keep this discovery
I. Zakir Ahmed, Hamid Sadjadpour, Shahram Yousefi. 2021-12-07. Constrained Resource Allocation Problems in Communications: An Information-assisted Approach. https://arxiv.org/abs/2112.03512
Cite the original work for its findings. Save a collection to share your selection of sources.