Please use this identifier to cite or link to this item: https://doi.org/10.1109/GLOCOM.2012.6503440
DC FieldValue
dc.titleOutage minimization in fading channels: Optimal power allocation with channel distribution information known at transmitter
dc.contributor.authorHuang, C.
dc.contributor.authorZhang, R.
dc.contributor.authorCui, S.
dc.date.accessioned2014-10-07T04:48:21Z
dc.date.available2014-10-07T04:48:21Z
dc.date.issued2012
dc.identifier.citationHuang, C.,Zhang, R.,Cui, S. (2012). Outage minimization in fading channels: Optimal power allocation with channel distribution information known at transmitter. GLOBECOM - IEEE Global Telecommunications Conference : 2191-2195. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/GLOCOM.2012.6503440" target="_blank">https://doi.org/10.1109/GLOCOM.2012.6503440</a>
dc.identifier.isbn9781467309219
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/84061
dc.description.abstractThis paper revisits the optimal power allocation for outage minimization in the classic point-to-point fading channels with the channel distribution information (CDI) known at the transmitter. The channel state information (CSI) is assumed to be perfectly known at the receiver, but not available at the transmitter. In particular, we consider a finite horizon of N-block transmissions subject to an average power constraint at the transmitter. Although minimizing the time-averaged per-block outage probability over each N-block transmission is shown to be a non-convex problem for a large class of practical fading channels, we show that the globally optimal power allocation is obtainable by a simple one-dimensional search. It is shown that if the average transmit power is above a certain threshold determined by the distribution of the fading channel and the target transmission rate, the uniform power allocation is optimal; otherwise, an on-off power allocation is optimal. Moreover, a suboptimal low-complexity power allocation scheme is proposed, which is shown to be asymptotically optimal as N goes to infinity. Finally, numerical results are provided to validate our analysis. © 2012 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/GLOCOM.2012.6503440
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/GLOCOM.2012.6503440
dc.description.sourcetitleGLOBECOM - IEEE Global Telecommunications Conference
dc.description.page2191-2195
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

54
checked on Jun 14, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.