tailieunhanh - Báo cáo hóa học: "Research Article On Throughput-Fairness Tradeoff in Virtual MIMO Systems with Limited Feedback"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article On Throughput-Fairness Tradeoff in Virtual MIMO Systems with Limited Feedback | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2009 Article ID 102064 17 pages doi 2009 102064 Research Article On Throughput-Fairness Tradeoff in Virtual MIMO Systems with Limited Feedback Alexis A. Dowhuszko 1 Graciela Corral-Briones 1 Jyri Hamalainen 2 and Risto Wichman3 1 Digital Communications Research Laboratory National University of Cordoba UNC - CONICET Avenida Velez Sarsfield 1611 X5016GCA Cordoba Argentina 2 Department of Communications and Networking Helsinki University of Technology TKK . Box 3000 FIN-02015 TKK Finland 3 Department of Signal Processing and Acoustics Helsinki University of Technology TKK - Smart and Novel Radios SMARAD Centre of Excellence . Box 3000 FIN-02015 TKK Finland Correspondence should be addressed to Alexis A. Dowhuszko adowhuszko@ Received 1 July 2008 Revised 10 December 2008 Accepted 24 January 2009 Recommended by Zhu Han We investigate the performance of channel-aware scheduling algorithms designed for the downlink of a wireless communication system. Our study focuses on a two-transmit antenna cellular system where the base station can only rely on quantized versions of channel state information to carry out scheduling decisions. The motivation is to study the interaction between throughput and fairness of practical spatial multiplexing schemes when implemented using existing physical layer signaling such as the one that exists in current wideband code division multiple access downlink. Virtual MIMO system selects at each time instant a pair of users that report orthogonal quantized channels. Closed-form expressions for the achievable sum-rate of three different channel-aware scheduling rules are presented using an analytical framework that is derived in this work. Our analysis reveals that simple scheduling procedures allow to reap a large fraction in the order of 80 of the sum-rate performance that greedy scheduling provides. This overall .