Power-efficient resource allocation for time-division multiple access over fading channels

Xin Wang; Georgios B. Giannakis

doi:10.1109/TIT.2007.915717

Power-efficient resource allocation for time-division multiple access over fading channels

Xin Wang, Georgios B. Giannakis

Electrical and Computer Engineering

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

43 Scopus citations

Abstract

We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and transmitters having full channel state information (CSI), we first minimize power under a weighted sum average rate constraint and show that the optimal rate and time allocation policies can be obtained by a greedy water-filling approach with linear complexity in the number of users. Subsequently, we pursue power minimization under individual average rate constraints and establish that the optimal resource allocation also amounts to a greedy water-filling solution. Our approaches not only provide fundamental power limits when each user can support an infinite-size capacity-achieving codebook (continuous rates), but also yield guidelines for practical designs where users can only support a finite set of adaptive modulation and coding modes (discrete rates).

Original language	English (US)
Pages (from-to)	1225-1240
Number of pages	16
Journal	IEEE Transactions on Information Theory
Volume	54
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2007.915717
State	Published - Mar 2008

Bibliographical note

Funding Information:
Manuscript received November 13, 2005; revised October 23, 2007. This work was supported by the ARO under Grant W911NF-05-1-0283 and was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The material of this paper was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006, and in part at the IEEE International Conference on Communications, Glasgow, Scotland, U.K., June 2007.

Keywords

Convex optimization
Fading channel
Time-division multiple access (TDMA)
Water-filling

Access

10.1109/TIT.2007.915717

OpenUrl availability

Full text

Cite this

@article{758a1a5414d84451960aaaabf84d9842,

title = "Power-efficient resource allocation for time-division multiple access over fading channels",

abstract = "We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and transmitters having full channel state information (CSI), we first minimize power under a weighted sum average rate constraint and show that the optimal rate and time allocation policies can be obtained by a greedy water-filling approach with linear complexity in the number of users. Subsequently, we pursue power minimization under individual average rate constraints and establish that the optimal resource allocation also amounts to a greedy water-filling solution. Our approaches not only provide fundamental power limits when each user can support an infinite-size capacity-achieving codebook (continuous rates), but also yield guidelines for practical designs where users can only support a finite set of adaptive modulation and coding modes (discrete rates).",

keywords = "Convex optimization, Fading channel, Time-division multiple access (TDMA), Water-filling",

author = "Xin Wang and Giannakis, {Georgios B.}",

note = "Funding Information: Manuscript received November 13, 2005; revised October 23, 2007. This work was supported by the ARO under Grant W911NF-05-1-0283 and was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The material of this paper was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006, and in part at the IEEE International Conference on Communications, Glasgow, Scotland, U.K., June 2007.",

year = "2008",

month = mar,

doi = "10.1109/TIT.2007.915717",

language = "English (US)",

volume = "54",

pages = "1225--1240",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "3",

}

TY - JOUR

T1 - Power-efficient resource allocation for time-division multiple access over fading channels

AU - Wang, Xin

AU - Giannakis, Georgios B.

N1 - Funding Information: Manuscript received November 13, 2005; revised October 23, 2007. This work was supported by the ARO under Grant W911NF-05-1-0283 and was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The material of this paper was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006, and in part at the IEEE International Conference on Communications, Glasgow, Scotland, U.K., June 2007.

PY - 2008/3

Y1 - 2008/3

N2 - We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and transmitters having full channel state information (CSI), we first minimize power under a weighted sum average rate constraint and show that the optimal rate and time allocation policies can be obtained by a greedy water-filling approach with linear complexity in the number of users. Subsequently, we pursue power minimization under individual average rate constraints and establish that the optimal resource allocation also amounts to a greedy water-filling solution. Our approaches not only provide fundamental power limits when each user can support an infinite-size capacity-achieving codebook (continuous rates), but also yield guidelines for practical designs where users can only support a finite set of adaptive modulation and coding modes (discrete rates).

AB - We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and transmitters having full channel state information (CSI), we first minimize power under a weighted sum average rate constraint and show that the optimal rate and time allocation policies can be obtained by a greedy water-filling approach with linear complexity in the number of users. Subsequently, we pursue power minimization under individual average rate constraints and establish that the optimal resource allocation also amounts to a greedy water-filling solution. Our approaches not only provide fundamental power limits when each user can support an infinite-size capacity-achieving codebook (continuous rates), but also yield guidelines for practical designs where users can only support a finite set of adaptive modulation and coding modes (discrete rates).

KW - Convex optimization

KW - Fading channel

KW - Time-division multiple access (TDMA)

KW - Water-filling

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

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

U2 - 10.1109/TIT.2007.915717

DO - 10.1109/TIT.2007.915717

M3 - Article

AN - SCOPUS:40949163904

SN - 0018-9448

VL - 54

SP - 1225

EP - 1240

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

Power-efficient resource allocation for time-division multiple access over fading channels

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this