Joint Frequency-Spatial Resource Allocation with Bipartite Matching in OFDM-MIMO Systems

Author

Sun, Fanglei ; You, Mingli ; Liu, Jin ; Wen, Pingping ; Wu, Shaoquan

Author_Institution

Res. & Innovation Center, Alcatel-Lucent Shanghai Bell Co., Ltd., Shanghai

fYear

2009

fDate

26-29 April 2009

Firstpage

1

Lastpage

5

Abstract

In this paper, we investigate the problem of joint frequency-spatial resource allocation for OFDM-MIMO systems. Based on Hungarian algorithm, the Kuhn-Munkres algorithm can provide the maximum weight bipartite matching for assignment problems. However it can only solve one-dimension resource allocation problems. For multi-dimension problems, such as joint frequency-spatial scheduling, we propose two modified bipartite matching algorithms to optimize the resource allocation for OFDM-MIMO systems. For LTE uplink systems with particular scheduling requirements, a modified bipartite matching algorithm is proposed. The simulation results show that our proposed algorithms can effectively increase the wireless spectrum usage and achieve high system capacity.

Keywords

MIMO communication; OFDM modulation; multi-access systems; Hungarian algorithm; Kuhn-Munkres algorithm; OFDM MIMO systems; joint frequency spatial resource allocation; maximum weight bipartite matching; multi dimension problem; Bipartite graph; Downlink; MIMO; OFDM; Radio spectrum management; Resource management; Round robin; Scheduling algorithm; Sun; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th

Conference_Location

Barcelona

ISSN

1550-2252

Print_ISBN

978-1-4244-2517-4

Electronic_ISBN

1550-2252

Type

conf

DOI

10.1109/VETECS.2009.5073632

Filename

5073632