Matrix analysis
Radio Resource Management for Wireless Networks
Radio Resource Management for Wireless Networks
Convex Optimization
Wireless Communications
Geometric programming for communication systems
Communications and Information Theory
The capacity region of the degraded multiple-input multiple-output compound broadcast channel
IEEE Transactions on Information Theory
The geometry of the capacity region for CDMA systems with general power constraints
IEEE Transactions on Wireless Communications
Capacity of fading channels with channel side information
IEEE Transactions on Information Theory
Linear multiuser receivers: effective interference, effective bandwidth and user capacity
IEEE Transactions on Information Theory
Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed
IEEE Transactions on Information Theory
Capacity regions and optimal power allocation for CDMA cellular radio
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Power Control and Allocation for MIMO Broadcast Channels in Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Fast algorithms and performance bounds for sum rate maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.84 |
In this paper, a communication system including n interfering additive white Gaussian noise (AWGN) links is considered. Each transmitter uses a Gaussian codebook and each receiver only decodes the data of the corresponding transmitter. For the case that the transmit powers are subject to arbitrary linear constraints, a mathematical expression for the boundary points of the signal-to-interference-plus-noise-ratio (SINR) region is obtained. Moreover, when the channels are time-varying and the average powers are constrained, the zero-outage SINR region of the system is derived. In addition, a scenario where the demanded SINR of the users is out of the SINR region is considered. A common approach is to remove a subset of the users such that the demanded SINR can be provided for the remaining users; the removed users are serviced in a later time slot. With the aim of maximizing the number of serviced users in each time slot, a suboptimal algorithm is developed, which outperforms the other known alternatives.