• ETRI Journal
• /
• v.30 no.6
• /
• pp.765-773
• /
• 2008

Spatial correlation is a result of insufficient antenna spacing among multiple antenna elements, while temporal correlation is caused by Doppler spread. This paper compares the effect of spatial and temporal correlation in order to investigate the performance of multiuser scheduling algorithms in multiple-input multiple-output (MIMO) broadcast channels. This comparison includes the effect on the ergodic capacity, on fairness among users, and on the sum-rate capacity of a multiuser scheduling algorithm utilizing statistical channel state information in spatio-temporally correlated MIMO broadcast channels. Numerical results demonstrate that temporal correlation is more meaningful than spatial correlation in view of the multiuser scheduling algorithm in MIMO broadcast channels. Indeed, the multiuser scheduling algorithm can reduce the effect of the Doppler spread if it exploits the information of temporal correlation appropriately. However, the effect of spatial correlation can be minimized if the antenna spacing is sufficient in rich scattering MIMO channels regardless of the multiuser scheduling algorithm used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.474-480
• /
• 2005

In this paper, we present a new scheduling scheme for MIMO OFDM Multiuser Diversity System. This scheduling scheme maximizes the system throughput, and at the same time fairly shares the resources based on the feedback information from the receivers and the queue information. To show the effectiveness of the proposed algorithm, we evaluate the performance of the proposed algorithm as compared to K&H and RR algorithms.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.481-488
• /
• 2009

This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an antenna trade-off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade-off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade-off scheme combined with QF scheduling can improve the probability of QoS-guaranteed transmission when supporting different QoS groups.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.6-12
• /
• 2009

In this paper, we propose the opportunistic channel state information feedback scheme for eigen based scheduling in multiuser MIMO systems. According to 3GPP SMC channel model, the system capacity of MU-MIMO systems is severly degraded, since the antennas are highly correlated in urban macro cell. Although the eigen based scheduling scheme mitigates the adverse effect of the antenna correlation, it achieves only small amount of the multiuser diversity gain. Since the opportunistic channel state information scheme can achieve sufficient multiuser diversity gain, the system capacity of MU-MIMO systems can be improved. The system capacity improvement is verified by the computer simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1111-1118
• /
• 2007

This paper presents our study of throughput enhancement achieved by selection diversity in a multiuser system, called multiuser diversity (MUDiv), using a new asymptotic approach. The MUDiv gain is evaluated by deriving an asymptotic formula for the throughput enhancement from the MUDiv gain as a simple closed form introducing a Puiseux series. The formula shows that the MUDiv gain is independent of the signal-to-noise ratio (SNR). This concept can be extended to analysis applicable to scheduling algorithms, such as Max C/I and proportional fair scheduling. The MUDiv gain throughput analysis is verified using Monte-Carlo simulations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.201-204
• /
• 2006

In this paper, we propose efficient scheduling strategy for Multi-user MIMO systems that find advantageous trade off solution between multiuser diversity and spatial diversity, spatial multiplexing technique. Specifically, we suggest P-SFS(Pseudo-SNR Fair scheduling) algorithm that consider throughput and fairness problem. also we propose channel aware Antenna deployment that decide how to use assigned multiple antennas by the information of each user's channel condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1101-1112
• /
• 2011

The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.430-436
• /
• 2007

In this paper, we assume the uplink multiuser MIMO system based on FDD. Considering the implementation of practical system, Antenna selection and Transmit Beamforming scheme are suggested. System model of both two schemes are introduced and the scheduling algorithm which approaches the optimal performance with affordable computational complexity is proposed for each transmission scheme. Simulation results show that the sum-rate of the proposed low complexity scheduler approaches the performance of brute-force scheduler which is believed to be the optimal scheme.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.71-75
• /
• 2011

The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.