{"title":"多用户MIMO上行信道的坐标上升调度程序","authors":"Patrick Hosein, Tao Wu","doi":"10.1109/PIMRC.2008.4699436","DOIUrl":null,"url":null,"abstract":"Orthogonal frequency division multiple access (OFDMA) transmission has been chosen for the next generation of wireless networks. Multiple input multiple output (MIMO) techniques are well suited for OFDMA and will be used for increased transmission efficiency for both downlink and uplink. In this paper we focus on space division multiple access (SDMA) techniques for the uplink of such a network. In particular, we consider the problem of scheduling uplink users so as to maximize the uplink resources while satisfying the QoS requirements of each userpsilas flows. We do this by assigning suitable utility functions to user flows that are designed to maintain the specified QoS constraints. Since multiple users can be simultaneously scheduled, the scheduling problem becomes multi-dimensional and, in general, its computational complexity grows non-linearly with the number of users. In addition to choosing the users to be scheduled one must also determine the optimal transmission power for each scheduled user. For the case of two users per frame we show that the optimal power allocation scheme is such that either both users transmit with full power or only one transmits with full power. We then propose a coordinate ascent algorithm for solving the utility-based scheduling problem. Simulations are then used to show that the solution produced by this approach is close to optimal and is quite robust.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Coordinate ascent scheduler for the multi-user MIMO uplink channel\",\"authors\":\"Patrick Hosein, Tao Wu\",\"doi\":\"10.1109/PIMRC.2008.4699436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Orthogonal frequency division multiple access (OFDMA) transmission has been chosen for the next generation of wireless networks. Multiple input multiple output (MIMO) techniques are well suited for OFDMA and will be used for increased transmission efficiency for both downlink and uplink. In this paper we focus on space division multiple access (SDMA) techniques for the uplink of such a network. In particular, we consider the problem of scheduling uplink users so as to maximize the uplink resources while satisfying the QoS requirements of each userpsilas flows. We do this by assigning suitable utility functions to user flows that are designed to maintain the specified QoS constraints. Since multiple users can be simultaneously scheduled, the scheduling problem becomes multi-dimensional and, in general, its computational complexity grows non-linearly with the number of users. In addition to choosing the users to be scheduled one must also determine the optimal transmission power for each scheduled user. For the case of two users per frame we show that the optimal power allocation scheme is such that either both users transmit with full power or only one transmits with full power. We then propose a coordinate ascent algorithm for solving the utility-based scheduling problem. Simulations are then used to show that the solution produced by this approach is close to optimal and is quite robust.\",\"PeriodicalId\":125554,\"journal\":{\"name\":\"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2008.4699436\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2008.4699436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coordinate ascent scheduler for the multi-user MIMO uplink channel
Orthogonal frequency division multiple access (OFDMA) transmission has been chosen for the next generation of wireless networks. Multiple input multiple output (MIMO) techniques are well suited for OFDMA and will be used for increased transmission efficiency for both downlink and uplink. In this paper we focus on space division multiple access (SDMA) techniques for the uplink of such a network. In particular, we consider the problem of scheduling uplink users so as to maximize the uplink resources while satisfying the QoS requirements of each userpsilas flows. We do this by assigning suitable utility functions to user flows that are designed to maintain the specified QoS constraints. Since multiple users can be simultaneously scheduled, the scheduling problem becomes multi-dimensional and, in general, its computational complexity grows non-linearly with the number of users. In addition to choosing the users to be scheduled one must also determine the optimal transmission power for each scheduled user. For the case of two users per frame we show that the optimal power allocation scheme is such that either both users transmit with full power or only one transmits with full power. We then propose a coordinate ascent algorithm for solving the utility-based scheduling problem. Simulations are then used to show that the solution produced by this approach is close to optimal and is quite robust.