This paper considers the competitive maximization of information rates in the Gaussian frequency-selective interference channel, subject to global power and spectral mask constraints. We focus on the practical case in which the transmission by the different users contains time and frequency synchronization offsets. We propose a unified framework based on a distributed algorithm called asynchronous iterative waterfilling algorithm. In this algorithm, the users update their power spectral density in a completely distributed and asynchronous way: some users may update their power allocation more frequently than others and they may even use outdated measurements of the received interference. Moreover the users are not required to know time and frequency offsets. Our main contribution is to provide a unified set of convergence conditions for the whole class of algorithms obtained from the asynchronous iterative water-filling algorithm. © 2007 IEEE.
Distributed Totally Asynchronous Iterative Waterfilling for Wideband Interference Channel with Time/Frequency Offset / Scutari, Gesualdo; D. P., Palomar; Barbarossa, Sergio. - 4:(2007), pp. 1325-1328. (Intervento presentato al convegno 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07 tenutosi a Honolulu; United States nel April 15-20, 2007) [10.1109/ICASSP.2007.367322].
Distributed Totally Asynchronous Iterative Waterfilling for Wideband Interference Channel with Time/Frequency Offset
SCUTARI, GESUALDO;BARBAROSSA, Sergio
2007
Abstract
This paper considers the competitive maximization of information rates in the Gaussian frequency-selective interference channel, subject to global power and spectral mask constraints. We focus on the practical case in which the transmission by the different users contains time and frequency synchronization offsets. We propose a unified framework based on a distributed algorithm called asynchronous iterative waterfilling algorithm. In this algorithm, the users update their power spectral density in a completely distributed and asynchronous way: some users may update their power allocation more frequently than others and they may even use outdated measurements of the received interference. Moreover the users are not required to know time and frequency offsets. Our main contribution is to provide a unified set of convergence conditions for the whole class of algorithms obtained from the asynchronous iterative water-filling algorithm. © 2007 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
