By Topic

Optimal downlink space-time scheduling design with convex utility functions - multiple antenna systems with orthogonal transmit beamforming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lau, V.K.N. ; Lucent Technol., Bell Labs., Whippany, NJ, USA

We consider the optimal downlink MISO scheduling design framework for a general class of convex utility functions. The access point or base station is equipped with nT transmit antennas. There are K mobiles in the system with single receive antenna. For practical reasons, we constraint the physical/link layer of the base station and mobile devices to linear processing complexity in signal transmission/reception respectively. We shall apply the design framework to two common utility functions, namely the maximum throughput and the proportional fair. The scheduling problem is a mixed nonlinear integer programming problem and therefore, the complexity of the optimal solution is enormous. Greedy algorithms is widely used in today's wireless data systems (3GIX, HDR, UMTS) and is optimal when nT = 1. However, we found that there is a large performance penalty of greedy algorithms (relative to optimal performance) when nT > 1 and this motivates the search for more efficient heuristics. In this paper, we address genetic-based heuristics and discuss their complexity-performance tradeoff.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:5 )

Date of Conference:

20-24 June 2004