A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Convex Optimization
Robust QoS-constrained optimization of downlink multiuser MISO systems
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Multiaccess fading channels. II. Delay-limited capacities
IEEE Transactions on Information Theory
Iterative water-filling for Gaussian vector multiple-access channels
IEEE Transactions on Information Theory
Optimized transmission for fading multiple-access and broadcast channels with multiple antennas
IEEE Journal on Selected Areas in Communications
An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Information Theory
Linear transmission for rate optimization in MIMO broadcast channels
IEEE Transactions on Wireless Communications
Hi-index | 35.74 |
We propose algorithms for rate allocation in a multiuser orthogonal-frequency-division multiple-access (OFDMA) system, which aim to maximize the system throughput and maintain fairness among users. The system comprises of variable-rate users (with specified minimum rates) as well as constant-rate users communicating with a base station. Rate allocation criteria based on the Nash bargaining solutions are formulated. Proportional fair-rate allocation as well as fair-rate allocation in classical OFDMA systems with orthogonality constraints, are subsumed as special cases of our formulations. The resulting optimization problems, which also accommodate practical per-user power constraints, are solved using the dual decomposition techniques. The efficiencies of our proposed methods are demonstrated through simulation results.