Strict log-convexity of the minimum power vector

Sławomir Stańczak, Holger Boche, Marcin Wiczanowski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In a previous work, it was shown that the l1-norm of the minimum power vector is log-convex if the signal-tointerference ratio (SIR) is establish log-convex function of the quality-of-service (QoS) value of interest. Assuming irreducibility of the gain matrix, the ll-norm was further shown to be strictly log-convex in two special cases of SIR-QoS functions. In this paper, we extend this result in two directions: First, we drop the requirement on irreducibility of the gain matrix and, secondly, we consider any log-convex SIR-QoS relationship. Finally, we point out a connection of these results to strong convexity of a utility-based power control problem.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages2471-2475
Number of pages5
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'Strict log-convexity of the minimum power vector'. Together they form a unique fingerprint.

Cite this