Title
Technical Papers Parallel Session-VII: Modified SINR based user selection for MU-MIMO systems
Abstract/Description
In multi-antenna systems, the spatial degree of freedom can be efficiently exploited to enhance the system capacity by effectively scheduling the multiple users. This article analyzes the interference based scheduling for multiuser MIMO (MU-MIMO) communication in terms of performance gains, fairness, and computational complexity. We also consider the significance of specifiec selection criteria for the first user adopted in well known scheduling algorithms and investigate its impact on performance and computational complexity. Through experimental validations, it is shown that with random selection not only the performance loss in negligible but a significant gain in computational complexity is also achieved. Simulations results are presented to confirm the viewpoint for the suggested modification quantifying the scheduling performance in terms of sum rate (bps/Hz) and fairness.
Keywords
Interference, Scheduling algorithms, Signal to noise ratio, Precoding, MIMO, Computational complexity
Location
C-12, AMAN CED
Session Theme
Technical Papers Parallel Session-VII (Networks-II)
Session Type
Parallel Technical Session
Session Chair
Dr. Shahid Shaikh
Start Date
13-12-2015 2:50 PM
End Date
13-12-2015 3:10 PM
Recommended Citation
Naeem, M., Bashir, S., Khan, M. U., & Syed, A. A. (2015). Technical Papers Parallel Session-VII: Modified SINR based user selection for MU-MIMO systems. International Conference on Information and Communication Technologies. Retrieved from https://ir.iba.edu.pk/icict/2015/2015/37
COinS
Technical Papers Parallel Session-VII: Modified SINR based user selection for MU-MIMO systems
C-12, AMAN CED
In multi-antenna systems, the spatial degree of freedom can be efficiently exploited to enhance the system capacity by effectively scheduling the multiple users. This article analyzes the interference based scheduling for multiuser MIMO (MU-MIMO) communication in terms of performance gains, fairness, and computational complexity. We also consider the significance of specifiec selection criteria for the first user adopted in well known scheduling algorithms and investigate its impact on performance and computational complexity. Through experimental validations, it is shown that with random selection not only the performance loss in negligible but a significant gain in computational complexity is also achieved. Simulations results are presented to confirm the viewpoint for the suggested modification quantifying the scheduling performance in terms of sum rate (bps/Hz) and fairness.
