Skip to main content
Article thumbnail
Location of Repository

Subcarrier Allocation in Multiuser OFDM Systems: Complexity and Approximability

By Pai-han Huang, Yi Gai, Bhaskar Krishnamachari and Ashwin Sridharan

Abstract

Abstract—We consider a number of related problem formulations pertaining to adaptive subcarrier allocation in multiuser Orthogonal Frequency-Division Multiplexing (OFDM) systems, and prove that they are NP-hard. Thus there exist no known algorithms that can provide optimal solutions for all instances of these problems in polynomial time. We further prove that these problems are hard to approximate in polynomial time. Finally, we discuss qualitatively the settings under which worstcase performance is likely to be observed. I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.4528
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://anrg.usc.edu/www/images... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.