Brief paper: Unconditional stability of the Foschini-Miljanic algorithm

Authors:
Annalisa Zappavigna;Themistoklis Charalambous;Florian Knorn
Affiliations:
Politecnico di Milano, Italy;University of Cyprus, Cyprus;Hamilton Institute, NUI Maynooth, Ireland
Venue:
Automatica (Journal of IFAC)
Year:
2012

Citing 3
Cited 0

Topics in matrix analysis

Topics in matrix analysis
Brief paper: On linear co-positive Lyapunov functions for sets of linear positive systems

Automatica (Journal of IFAC)
Stability analysis of positive systems with bounded time-varying delays

IEEE Transactions on Circuits and Systems II: Express Briefs

Quantified Score

Hi-index	22.14

Visualization

Abstract

In this note we prove the unconditional stability of the Foschini-Miljanic algorithm. Our results show that the Foschini-Miljanic algorithm is unconditionally stable (convergent) even in the presence of bounded time-varying communication delays, and in the presence of topology changes. The implication of our results may be important for the design of Code Division Multiple Access (CDMA) based wireless networks.