Averaged Iterative Water-Filling Algorithm: Robustness and Convergence
From MaRDI portal
Publication:4572964
DOI10.1109/TSP.2011.2113341zbMATH Open1392.94821arXiv1102.1960MaRDI QIDQ4572964FDOQ4572964
Authors: Mingyi Hong, Alfredo García 
Publication date: 18 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
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 it 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.
Full work available at URL: https://arxiv.org/abs/1102.1960
Cited In (4)
- Convergence of Iterative Water-Filling With Quantized Feedback: A Sufficient Condition
- Title not available (Why is that?)
- A new averaging scheme for the Riemann problem in pure water
- Robust waveform design based on bisection and maximum marginal allocation methods with the concept of information entropy
This page was built for publication: Averaged Iterative Water-Filling Algorithm: Robustness and Convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572964)
