Complexity of scheduling for minimum power on a GMAC
| Data(s) |
01/07/2008
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/26072/1/getPDF.pdf 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. |
| Publicador |
IEEE |
| Relação |
http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=4595482&queryText%3D%28complexity+of+scheduling+for+minimum+power+on+a+gmac%29%26openedRefinements%3D* http://eprints.iisc.ernet.in/26072/ |
| Palavras-Chave | #Electrical Communication Engineering |
| Tipo |
Conference Paper PeerReviewed |
