Averaged iterative water-filling algorithm: Robustness and convergence

Mingyi Hong, Alfredo Garcia

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

The convergence properties of the iterative water-filling (IWF) based algorithms have been derived in the ideal situation where the transmitters in the network are able to obtain the exact value of the interference plus noise (IPN) experienced at the corresponding receivers in each iteration of the algorithm. However, these algorithms are not robust because they diverge when there is time-varying estimation error of the IPN, a situation that arises in real communication system. In this correspondence, we propose an algorithm that possesses convergence guarantees in the presence of various forms of such time-varying error. Moreover, we also show by simulation that in scenarios where the interference is strong, the conventional IWF diverges while our proposed algorithm still converges.

Original languageEnglish (US)
Article number5711680
Pages (from-to)2448-2454
Number of pages7
JournalIEEE Transactions on Signal Processing
Volume59
Issue number5
DOIs
StatePublished - May 2011

Bibliographical note

Funding Information:
Manuscript received March 04, 2010; revised August 16, 2010, December 01, 2010; accepted January 28, 2011. Date of publication February 10, 2011; date of current version April 13, 2011. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Roberto Lopez-Val-carce. This work has been supported in part by the National Science Foundation under Award CCF-1017982 and IIP-0646008, and through the Wireless Internet Center for Advanced Technology (WICAT) at the University of Virginia.

Keywords

  • Convergence
  • Gaussian interference channel
  • iterative water-filling algorithm
  • robustness

Fingerprint

Dive into the research topics of 'Averaged iterative water-filling algorithm: Robustness and convergence'. Together they form a unique fingerprint.

Cite this