The sequential Iterative Water-Filling Algorithm (IWFA) proposed by Yu et al. is by now a popular lowcomplexity algorithm to compute the Nash equilibrium point of the power allocation game in a Gaussian frequency-selective multiuser interference channel. The algorithm is based on a distributed sequential updating where, at each iteration, the users choose their power allocation, one after the other. However, this sequential updating strategy may slow down its convergence time excessively when the number of users is high. In this paper, we propose an alternative distributed algorithm, called Simultaneous Iterative Water-Filling Algorithm (SIWFA), where at each iteration, all the users update their power allocations simultaneously, rather than sequentially. This reduces the convergence time considerably, specially when the number of users is large. Our main contribution is to provide a unified set of sufficient conditions for the convergence of both IWFA and SIWFA, that are less stringent than those known in the literature for IWFA. These conditions guarantee the convergence of both algorithms also in the presence of spectral mask constraints imposed on the power allocations of the users. © 2006 IEEE.

Simultaneous iterative water-filling for Gaussian frequency-selective interference channels / SCUTARI, GESUALDO; Daniel, Palomar; BARBAROSSA, Sergio. - (2006), pp. 600-604. (Intervento presentato al convegno IEEE International Symposium on Information Theory tenutosi a Seattle; United States nel JUL 09-14, 2006) [10.1109/isit.2006.261855].

Simultaneous iterative water-filling for Gaussian frequency-selective interference channels

SCUTARI, GESUALDO;BARBAROSSA, Sergio
2006

Abstract

The sequential Iterative Water-Filling Algorithm (IWFA) proposed by Yu et al. is by now a popular lowcomplexity algorithm to compute the Nash equilibrium point of the power allocation game in a Gaussian frequency-selective multiuser interference channel. The algorithm is based on a distributed sequential updating where, at each iteration, the users choose their power allocation, one after the other. However, this sequential updating strategy may slow down its convergence time excessively when the number of users is high. In this paper, we propose an alternative distributed algorithm, called Simultaneous Iterative Water-Filling Algorithm (SIWFA), where at each iteration, all the users update their power allocations simultaneously, rather than sequentially. This reduces the convergence time considerably, specially when the number of users is large. Our main contribution is to provide a unified set of sufficient conditions for the convergence of both IWFA and SIWFA, that are less stringent than those known in the literature for IWFA. These conditions guarantee the convergence of both algorithms also in the presence of spectral mask constraints imposed on the power allocations of the users. © 2006 IEEE.
2006
IEEE International Symposium on Information Theory
Gaussian frequency-selective interference channels; Spectral mask constraints;
Pubblicazione in atti di convegno::04b Atto di convegno in volume
Simultaneous iterative water-filling for Gaussian frequency-selective interference channels / SCUTARI, GESUALDO; Daniel, Palomar; BARBAROSSA, Sergio. - (2006), pp. 600-604. (Intervento presentato al convegno IEEE International Symposium on Information Theory tenutosi a Seattle; United States nel JUL 09-14, 2006) [10.1109/isit.2006.261855].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/368446
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 42
  • ???jsp.display-item.citation.isi??? 18
social impact