• DocumentCode
    2522362
  • Title

    Complexity of scheduling for minimum power on a GMAC

  • Author

    Padakandla, Arun ; Sundaresan, Rajesh

  • Author_Institution
    ECE Dept., Indian Inst. of Sci., Bangalore
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    2698
  • Lastpage
    2701
  • Abstract
    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.
  • Keywords
    Gaussian channels; minimisation; multi-access systems; Gaussian multiple-access channel; combinatorial power minimization; scheduling complexity; time-slotted GMAC; Additive noise; Decoding; Delay systems; Downlink; Jamming; Multiaccess communication; OFDM; Random variables; Resilience; Tin;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595482
  • Filename
    4595482
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2522362