Downlink Scheduling via Genetic Algorithms for Multiuser Single-Carrier and Multicarrier MIMO Systems With Dirty Paper Coding

被引:50
作者
Elliott, Robert C. [1 ,2 ]
Krzymien, Witold A. [1 ,2 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
[2] TRLabs, Edmonton, AB T6E 5A6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Cross-layer scheduling; dirty paper coding (DPC); genetic algorithms (GAs); multicarrier systems; multiuser multiple-input-multiple-output (MIMO); orthogonal frequency-division multiplexing (OFDM); packet data; NETWORKS; CAPACITY;
D O I
10.1109/TVT.2008.2009059
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multiple-input-multiple-output (MIMO) systems are of interest for meeting the expected demand for higher data rates and lower delays in future wireless packet data systems. In such systems, it is optimal to simultaneously transmit to multiple users compared with a single user in a single-input-single-output system. In addition, multicarrier systems are of interest to combat frequency-selective fading that is experienced over the larger bandwidth that these future broadband systems will use. The use of dirty paper coding further complicates the matter, because the order in which the users are encoded will affect the rates that they can achieve. A well-designed cross-layer scheduling algorithm must take into account the multiple dimensions of this resource-allocation problem and other quality-of-service (QoS) parameters to fully exploit the communications channel. The scheduling problem is often expressed in terms of optimizing some utility function. Unfortunately, the search space for this optimization problem is extremely large, which prohibits an optimal exhaustive search. To this end, we investigate the use of genetic algorithms to reduce the complexity of the scheduling. This paper builds upon prior work that implements scheduling via genetic algorithms in the context of single-carrier systems using zero-forcing beamforming (ZFB). In this paper, we investigate how the genetic algorithm can be adapted to account for the effect of encoding order on the scheduling and how the scheduling can be extended to a multicarrier system. In particular, we investigate the maximum throughput and proportionally fair scheduling criteria. We demonstrate that the performance of the genetic algorithm is near optimal compared with an exhaustive search at a greatly reduced computational complexity. Furthermore, in the case of a multicarrier orthogonal frequency-division multiplexing (OFDM) system, an increase in capacity is shown relative to the single-carrier case.
引用
收藏
页码:3247 / 3262
页数:16
相关论文
共 29 条
[1]  
*3GPP, 2007, TR25876 3GPP TR
[2]  
*3GPP, 2008, 25401 3GPP TS
[3]  
*3GPP2, 2007, CS0024B 3GPP2
[4]  
*3GPP2, 2008, 25308 3GPP2 TS
[5]  
BEDEKAR A, 1999, P IEEE GLOBECOM, V5, P2653
[6]  
Boyd S. P., 2004, Convex Optimization, P243
[7]  
CAIRE G, 2003, IEEE T INFORM THEORY, V49, P11706
[8]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[9]  
Fazel K., 2003, MULTICARRIER SPREAD
[10]   On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas [J].
Foschini G.J. ;
Gans M.J. .
Wireless Personal Communications, 1998, 6 (3) :311-335