Opportunistic scheduling algorithms with link adaptation can increase system throughput, but have the drawback of requiring the channel quality information (CQI) to be transmitted from all the candidate users. In order to alleviate this problem, we propose a new feedback reduction scheme that preserves CQIs over all channels. The proposed scheme binds similar CQIs in groups to represent them more effectively, and uses a simple method for fast grouping. Simulation results show that the proposed scheme with this simple grouping achieves close to perfect feedback performance with respect to the original CQIs under reasonable feedback loads.
Bibliographical noteFunding Information:
Manuscript received April 18, 2006; revised May 18, 2007 and November 26, 2007; accepted January 16, 2008. The associate editor coordinating the review of this paper and approving it for publication was S. Shen. This work is supported in part by the Ministry of Education and Human Resources Development(MOE), the Ministry of Commerce, Industry and Energy(MOCIE) and the Ministry of Labor(MOLAB) through the fostering project of the Lab of Excellency. This work was supported by the Korea Science and Engineering Foundation through the NRL Program.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics