Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. To derive decentralized solutions that do not require any cooperation among the users, the optimization problem is formul...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 54; číslo 7; s. 2868 - 2878
Hlavní autoři:	Scutari, G., Palomar, D.P., Barbarossa, S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.07.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Applied sciences Channels Decoding Density Density measurement Distributed algorithms Electronics Exact sciences and technology Frequency Game theory Games Gaussian Gaussian frequency-selective interference channel Information rates Information theory Information, signal and communications theory Interference Interference channels Interference constraints Iterative algorithms iterative water-filling algorithm Maximization Nash equilibrium Nash Equilibrium (NE) Optimization algorithms Power measurement Spectra Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory totally asynchronous algorithm Transmission and modulation (techniques and equipments) Fading channels Power spectral density Information rate Nash equilibrium Updating Iterative method Power allocation Game theory Information transmission Optimization Nash Equilib- I rium (NE) Frequency selection Decentralized system totally asynchronous algorithm Distributed algorithm Gaussian frequency-selective interference channel iterative water-filling algorithm Power spectrum
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!