Simplified Fair Scheduling and Antenna Selection Algorithms for Multiuser MIMO Orthogonal Space-Division Multiplexing Downlink

Sigdel, Shreeram; Krzymien, W.A.

doi:10.1109/tvt.2008.925002

Cited by 91 publications

(111 citation statements)

References 24 publications

Supporting

Mentioning

109

Contrasting

Unclassified

Order By: Relevance

“…However, since SUS is originally utilized for throughput maximization, this method has a problem in that the users with high CNR tend to be selected, which leads to unfairness among users. Moreover, although the combination of MU-MIMO and scheduling techniques has been investigated so far [6,9,10,11], the objectives of the previous work are limited to a specific scheduling technique such as SUS or PF, which does not aim to achieve both high system capacity and fairness.…”

Section: Introductionmentioning

confidence: 99%

Efficient combination of MU-MIMO THP and user scheduling to achieve both high system capacity and fairness

2018

View full text Add to dashboard Cite

This letter proposes an efficient method for combining MU-MIMO Tomlinson Harashima precoding (THP) with user scheduling techniques to realize fairness among users as well as high system capacity. The concept of the proposed approach is to first adopt semiorthogonal user selection (SUS) for throughput maximization and then apply proportional fairness (PF) to the remaining users, which regains fairness lowered by using SUS for throughput maximization. Moreover, considering that THP adopted as a precoder for PF requires the calculation of ordering and precoding for each user combination, the proposed method adopts linear precoding (LP) instead of THP to relax the computational effort during operation of PF. This approach is inspired by the fact that LP achieves almost the same system capacity as THP with ordering when conducting PF. The effectiveness of the proposed method is demonstrated by comparing it to MU-MIMO THP with SUS or PF in terms of system capacity and fairness among users, by means of computer simulations. Keywords: MU-MIMO THP, semiorthogonal user selection (SUS), proportional fairness (PF), system capacity, fairness index (FI) Classification: Wireless Communication Technologies

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient combination of MU-MIMO THP and user scheduling to achieve both high system capacity and fairness

2018

View full text Add to dashboard Cite

show abstract

“…The optimum user selection mechanism usually requires an exhaustive search among all possible subsets, which is very computationally demanding even for a moderate number of users. In this context, a large number of suboptimal yet simplified algorithms have been proposed for various user selection criteria [6], [7], [8], [9]. At this point it is important to remark that none of the previous works have considered the information of the battery status of the terminals in the proposed user selection mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Energy-aware user scheduling for downlink multiuser-MIMO systems

Rubio

Pascual‐Iserte

2014

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)

View full text Add to dashboard Cite

Abstract-In this paper we address the problem of designing a user selection algorithm in a multiuser multiple-input multipleoutput downlink scenario. Linear precoding is adopted at the transmitter and, thus, the number of users to be served at each particular scheduling period is limited by the number of available transmit and receive antennas. The adopted scheduling criterion for the user selection is based on proportional fair criterion. The novelty relies on the fact that the users are considered to have a finite battery capacity and a harvesting source that allows them to recharge their batteries dynamically. The proposed user scheduler mechanism exploits not only the channel dynamics but also the battery fluctuations. We analyze how the intensity of the energy arrivals impacts the performance of the user scheduler. Simulations results show that the average long-term rates approach the requested quality of service if the scheduler controls the amount of energy that is being used by the terminals at each scheduling period.

show abstract

“…Simplified fair scheduling and antenna selection algorithms for BD and successive optimization (SO) system were proposed in [5]. The aim in [5] is to investigate low complexity algorithms for joint user and antenna selection for MU-MIMO system employing either BD or SO.…”

Section: Introductionmentioning

confidence: 99%

“…The aim in [5] is to investigate low complexity algorithms for joint user and antenna selection for MU-MIMO system employing either BD or SO. For BD, the user selection algorithm is similar to Frobenius normbased user selection algorithm in [4], and for further lower complexity, a user grouping technique based on subspace correlation was also proposed, here we call it simplified norm-based user scheduling algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…For BD, the user selection algorithm is similar to Frobenius normbased user selection algorithm in [4], and for further lower complexity, a user grouping technique based on subspace correlation was also proposed, here we call it simplified norm-based user scheduling algorithm. Simplified proportionally fair (PF) scheduling was also introduced for both techniques, where Metric 1 and Metric 2 are PF criteria for BD in [5], to reduce the unfairness of supported rates for the users.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simplified Capacity-Based User Scheduling Algorithm for Multiuser MIMO Systems with Block Diagonalization

Chang

Araki

2011

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARYIn multiple-input multiple-output (MIMO) systems, the multiuser MIMO (MU-MIMO) systems have the potential to provide higher channel capacity owing to multiuser and spatial diversity. Block diagonalization (BD) is one of the techniques to realize MU-MIMO systems, where multiuser interference can be completely cancelled and therefore several users can be supported simultaneously. When the number of multiantenna users is larger than the number of simultaneously receiving users, it is necessary to select the users that maximize the system capacity. However, computation complexity becomes prohibitive, especially when the number of multiantenna users is large. Thus simplified user scheduling algorithms are necessary for reducing the complexity of computation. This paper proposes a simplified capacity-based user scheduling algorithm, based on analysis of the capacity-based user selection criterion. We find a new criterion that is simplified by using the properties of Gram-Schmidt orthogonalization (GSO). In simulation results, the proposed algorithm provides higher sum rate capacity than the conventional simplified norm-based algorithm; and when signal-to-noise power ratio (SNR) is high, it provides performance similar to that of the conventional simplified capacity-based algorithm, which still requires high complexity. Fairness of the users is also taken into account. With the proportionally fair (PF) criterion, the proposed algorithm provides better performance (sum rate capacity or fairness of the users) than the conventional algorithms. Simulation results also shows that the proposed algorithm has lower complexity of computation than the conventional algorithms.

show abstract

Simplified Fair Scheduling and Antenna Selection Algorithms for Multiuser MIMO Orthogonal Space-Division Multiplexing Downlink

Cited by 91 publications

References 24 publications

Efficient combination of MU-MIMO THP and user scheduling to achieve both high system capacity and fairness

Efficient combination of MU-MIMO THP and user scheduling to achieve both high system capacity and fairness

Energy-aware user scheduling for downlink multiuser-MIMO systems

Simplified Capacity-Based User Scheduling Algorithm for Multiuser MIMO Systems with Block Diagonalization

Contact Info

Product

Resources

About