Nonconvergent example for the iterative water-filling algorithm

Simai He; Min Li; Shuzhong Zhang; Zhi Quan Luo

doi:10.3934/naco.2011.1.147

Nonconvergent example for the iterative water-filling algorithm

Simai He, Min Li, Shuzhong Zhang, Zhi Quan Luo

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

IterativeWater-filling Algorithm (IWFA) is a well-known distributed multi-carrier power control method for multi-user communication. It was empirically observed (and conjectured) to be convergent under all channel conditions. In this paper, we present an example showing that IWFA can oscillate, therefore disproving the conjecture.

Original language	English (US)
Pages (from-to)	147-150
Number of pages	4
Journal	Numerical Algebra, Control and Optimization
Volume	1
Issue number	1
DOIs	https://doi.org/10.3934/naco.2011.1.147
State	Published - Feb 2011

Keywords

Iterative water-filling algorithm
Multi-user communication system

Publisher link

10.3934/naco.2011.1.147

Find It

Find It at U of M Libraries

Cite this

@article{00e58e31bc0e447a9e04cefb19f18371,

title = "Nonconvergent example for the iterative water-filling algorithm",

abstract = "IterativeWater-filling Algorithm (IWFA) is a well-known distributed multi-carrier power control method for multi-user communication. It was empirically observed (and conjectured) to be convergent under all channel conditions. In this paper, we present an example showing that IWFA can oscillate, therefore disproving the conjecture.",

keywords = "Iterative water-filling algorithm, Multi-user communication system",

author = "Simai He and Min Li and Shuzhong Zhang and Luo, {Zhi Quan}",

year = "2011",

month = feb,

doi = "10.3934/naco.2011.1.147",

language = "English (US)",

volume = "1",

pages = "147--150",

journal = "Numerical Algebra, Control and Optimization",

issn = "2155-3289",

publisher = "American Institute of Mathematical Sciences",

number = "1",

}

TY - JOUR

T1 - Nonconvergent example for the iterative water-filling algorithm

AU - He, Simai

AU - Li, Min

AU - Zhang, Shuzhong

AU - Luo, Zhi Quan

PY - 2011/2

Y1 - 2011/2

N2 - IterativeWater-filling Algorithm (IWFA) is a well-known distributed multi-carrier power control method for multi-user communication. It was empirically observed (and conjectured) to be convergent under all channel conditions. In this paper, we present an example showing that IWFA can oscillate, therefore disproving the conjecture.

AB - IterativeWater-filling Algorithm (IWFA) is a well-known distributed multi-carrier power control method for multi-user communication. It was empirically observed (and conjectured) to be convergent under all channel conditions. In this paper, we present an example showing that IWFA can oscillate, therefore disproving the conjecture.

KW - Iterative water-filling algorithm

KW - Multi-user communication system

UR - http://www.scopus.com/inward/record.url?scp=84861628599&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861628599&partnerID=8YFLogxK

U2 - 10.3934/naco.2011.1.147

DO - 10.3934/naco.2011.1.147

M3 - Article

AN - SCOPUS:84861628599

SN - 2155-3289

VL - 1

SP - 147

EP - 150

JO - Numerical Algebra, Control and Optimization

JF - Numerical Algebra, Control and Optimization

IS - 1

ER -

Nonconvergent example for the iterative water-filling algorithm

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this