Fair resource allocation for the Gaussian broadcast channel with ISI

Authors:
Chi Wan Sung;Kenneth W. Shum;Cho Yiu Ng
Affiliations:
Dept. of Electronic Eng., City University of Hong Kong;Dept. of Information Eng., The Chinese University of Hong Kong;Dept. of Information Eng., The Chinese University of Hong Kong
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 9
Cited 0

Elements of information theory

Elements of information theory
On finding an envy-free Pareto-optimal division

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Convex Optimization

Convex Optimization
Graph Theory

Graph Theory
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Multiuser OFDM with adaptive subcarrier, bit, and power allocation

IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider fair resource allocation in Gaussian frequency-division broadcast channel with intersymbol interference. The goal is to allocate power and subchannels in a way such that proportional fairness is achieved. We show that the subchannel allocation problem is NP-hard. If multiple users are allowed to time-share a subchannel, the relaxed problem is equivalent to the cake cutting problem and can be efficiently solved. For the joint power and subchannel allocation problem, we propose an iterative method, which solves the power allocation problem and subchannel allocation problem alternately. Simulation results show that its performance is nearly optimal.