Padakandla, Arun and Sundaresan, Rajesh (2008) Complexity of scheduling for minimum power on a GMAC. In: IEEE International Symposium on Information Theory, JUL 06-11, 2008, Toronto.
getPDF.pdf - Published Version
Restricted to Registered users only
Download (230Kb) | Request a copy
Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||12 Mar 2010 05:47|
|Last Modified:||19 Sep 2010 05:56|
Actions (login required)