Np-Hardness Of Bit Allocation In Multiuser Multicarrier Communications
Year: 2006
Type: article
Abstract: In this paper, we consider the problem of optimal bit allocation for a multiuser multicarrier communications. Some of the existing papers comment, without a proof, on the intractability of the prob-lem and provide algorithms resulting in suboptimal bit allocation to reduce the computation complexity. A formal proof for classi-fying this problem as being NP-hard is presented in this article. 1.
DOI: 10.5281/zenodo.52851
Authors: Dasgupta, Soura, Vemulapalli, Manish
Institution: University of Iowa
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2154266633