• DocumentCode
    2223200
  • Title

    NP-hardness of bit allocation in multiuser multicarrier communications

  • Author

    Vemulapalli, Manish ; Dasgupta, Soura

  • Author_Institution
    Dept. of Electr. Comput. Eng., Univ. of Iowa, Iowa City, IA, USA
  • fYear
    2006
  • fDate
    4-8 Sept. 2006
  • Firstpage
    1
  • Lastpage
    4
  • 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 problem and provide algorithms resulting in suboptimal bit allocation to reduce the computation complexity. A formal proof for classifying this problem as being NP-hard is presented in this article.
  • Keywords
    computational complexity; optimisation; telecommunication networks; NP-hard problem; computation complexity; multiuser multicarrier communication; optimal bit allocation; suboptimal bit allocation; Abstracts; Niobium; OFDM;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference, 2006 14th European
  • Conference_Location
    Florence
  • ISSN
    2219-5491
  • Type

    conf

  • Filename
    7071547
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2223200