• DocumentCode
    86404
  • Title

    Fast Computation of Generalized Waterfilling Problems

  • Author

    Kalpana, N. ; Khan, Mohammed Zafar Ali

  • Author_Institution
    Dept. of Electr. Eng., Indian Inst. of Technol., Hyderabad, Hyderabad, India
  • Volume
    22
  • Issue
    11
  • fYear
    2015
  • fDate
    Nov. 2015
  • Firstpage
    1884
  • Lastpage
    1887
  • Abstract
    In this letter, we present a novel method of solving the Generalized Waterfilling problem (GWFP) using equivalence with a waterfilling problem (WFP) which has a closed form solution. Consequentially, a class of WFPs with only one-step called `1-step´ WFP is used to derive a low complexity algorithm which has the smallest worst case complexity reported. The proposed algorithm is verified by simulations.
  • Keywords
    MIMO communication; OFDM modulation; cognitive radio; computational complexity; iterative methods; 1-step WFP; GWFP; MIMO-OFDM system; cognitive radio; generalized waterfilling problem; iterative waterfilling algorithm; low complexity algorithm; worst case complexity; Closed-form solutions; Computational complexity; Nickel; Noise level; OFDM; Signal processing algorithms; Fast computation; generalized waterfilling problem; iterative waterfilling algorithm;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9908
  • Type

    jour

  • DOI
    10.1109/LSP.2015.2440653
  • Filename
    7116486
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=86404