File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TVT.2004.823507
- Scopus: eid_2-s2.0-1942485973
- WOS: WOS:000220452400006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Performance analysis of SIMO space-time scheduling with convex utility function: Zero-forcing linear processing
Title | Performance analysis of SIMO space-time scheduling with convex utility function: Zero-forcing linear processing |
---|---|
Authors | |
Keywords | Fairness Genetic algorithm (GA) Multiple antenna Optimal algorithm Scheduling Single-input-multiple-output (SIMO) Utility functions |
Issue Date | 2004 |
Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 |
Citation | Ieee Transactions On Vehicular Technology, 2004, v. 53 n. 2, p. 339-350 How to Cite? |
Abstract | In a multiple-antenna system, an optimized design across the link and scheduling layers is crucial toward fully exploiting the temporal and spatial dimensions of the communication channel. In this paper, based on discrete optimization techniques, we derive a novel analytical framework for designing optimal space-time scheduling algorithms with respect to general convex utility functions. We focus on the reverse link (i.e., client to base station) and assume that the mobile terminal has a single transmit antenna while the base station has nR receive antennas. In order that our proposed framework is practicable and can be implemented with a reasonable cost in a real environment, we further assume that the physical layer involves only linear-processing complexity in separating signals from different users. As an illustration of the efficacy of our proposed analytical design framework, we apply the framework to two commonly used system utility functions, namely maximal throughput and proportional fair. We then devise an optimal scheduling algorithm based on our design framework. However, in view of the formidable time complexity of the optimal algorithm, we propose two fast practical scheduling techniques, namely the greedy algorithm and the genetic algorithm (GA). The greedy algorithm, which is similar to the one widely used in 3G1X and Qualcomm high-data-rate (HDR) systems (optimal when nR = 1), exhibits significantly inferior performance when nR > 1 as compared with the optimal approach. On the other hand, the GA is quite promising in terms of performance complexity tradeoff, especially for a system with a large number of users with even a moderately large nR. As a case in point, for a system with 20 users and nR = 4, the GA is more than 36 times faster than the optimal while the performance degradation is less than 10%, making it an attractive choice in the practical implementation for real-time link scheduling. |
Persistent Identifier | http://hdl.handle.net/10722/42974 |
ISSN | 2023 Impact Factor: 6.1 2023 SCImago Journal Rankings: 2.714 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lau, VKN | en_HK |
dc.contributor.author | Kwok, YK | en_HK |
dc.date.accessioned | 2007-03-23T04:35:49Z | - |
dc.date.available | 2007-03-23T04:35:49Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Ieee Transactions On Vehicular Technology, 2004, v. 53 n. 2, p. 339-350 | en_HK |
dc.identifier.issn | 0018-9545 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/42974 | - |
dc.description.abstract | In a multiple-antenna system, an optimized design across the link and scheduling layers is crucial toward fully exploiting the temporal and spatial dimensions of the communication channel. In this paper, based on discrete optimization techniques, we derive a novel analytical framework for designing optimal space-time scheduling algorithms with respect to general convex utility functions. We focus on the reverse link (i.e., client to base station) and assume that the mobile terminal has a single transmit antenna while the base station has nR receive antennas. In order that our proposed framework is practicable and can be implemented with a reasonable cost in a real environment, we further assume that the physical layer involves only linear-processing complexity in separating signals from different users. As an illustration of the efficacy of our proposed analytical design framework, we apply the framework to two commonly used system utility functions, namely maximal throughput and proportional fair. We then devise an optimal scheduling algorithm based on our design framework. However, in view of the formidable time complexity of the optimal algorithm, we propose two fast practical scheduling techniques, namely the greedy algorithm and the genetic algorithm (GA). The greedy algorithm, which is similar to the one widely used in 3G1X and Qualcomm high-data-rate (HDR) systems (optimal when nR = 1), exhibits significantly inferior performance when nR > 1 as compared with the optimal approach. On the other hand, the GA is quite promising in terms of performance complexity tradeoff, especially for a system with a large number of users with even a moderately large nR. As a case in point, for a system with 20 users and nR = 4, the GA is more than 36 times faster than the optimal while the performance degradation is less than 10%, making it an attractive choice in the practical implementation for real-time link scheduling. | en_HK |
dc.format.extent | 784508 bytes | - |
dc.format.extent | 26112 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/msword | - |
dc.language | eng | en_HK |
dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 | en_HK |
dc.relation.ispartof | IEEE Transactions on Vehicular Technology | en_HK |
dc.rights | ©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Fairness | en_HK |
dc.subject | Genetic algorithm (GA) | en_HK |
dc.subject | Multiple antenna | en_HK |
dc.subject | Optimal algorithm | en_HK |
dc.subject | Scheduling | en_HK |
dc.subject | Single-input-multiple-output (SIMO) | en_HK |
dc.subject | Utility functions | en_HK |
dc.title | Performance analysis of SIMO space-time scheduling with convex utility function: Zero-forcing linear processing | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0018-9545&volume=53&issue=2&spage=339&epage=350&date=2004&atitle=Performance+analysis+of+SIMO+space-time+scheduling+with+convex+utility+function:+zero-forcing+linear+processing | en_HK |
dc.identifier.email | Kwok, YK:ykwok@eee.hku.hk | en_HK |
dc.identifier.authority | Kwok, YK=rp00128 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/TVT.2004.823507 | en_HK |
dc.identifier.scopus | eid_2-s2.0-1942485973 | en_HK |
dc.identifier.hkuros | 91517 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-1942485973&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 53 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 339 | en_HK |
dc.identifier.epage | 350 | en_HK |
dc.identifier.isi | WOS:000220452400006 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Lau, VKN=7005811464 | en_HK |
dc.identifier.scopusauthorid | Kwok, YK=7101857718 | en_HK |
dc.identifier.issnl | 0018-9545 | - |