• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.99-105
• /
• 2012

Recently, there are many user selection algorithms in multi user multiple-input multiple-output (MU-MIMO) systems. One of well-known user selection methods is Semi orthogonal user selection (SUS). It is an algorithm maximizing channel capacity. However, it is applicable only when user's antenna is one. We propose a generalized user selection algorithm regardless of the number of user's antennas. In the proposed scheme, Base station (Bs) selects the first user who has the highest determinant of channel and generates a user group that correlation with first user's channel is less than allowance of correlation. Then, each determinant of channels made up of first user's channel and a user's channel in the generated group is calculated and BS selects the next user who has the highest determinant of that. BS selects following users by repeating above procedure. In this paper, we get better performance because of selecting users who have the highest determinant of channel as well as allowance of correlation optimally calculated through matrix operations.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.14 no.3
• /
• pp.77-85
• /
• 2018

Multi-User Multiple-Input Multiple-Output (MU-MIMO) is the core technology for improving the channel capacity compared to Single-User MIMO (SU-MIMO) by using multiuser gain and spatial diversity. Key problem for the MU-MIMO is the user selection which is the grouping the users optimally. To solve this problem, we adopt Extreme Value Theory (EVT) at the beginning of the proposed algorithm, which defines a primary user set instead of a single user that has maximum channel power according to a predetermined threshold. Each user in the primary set is then paired with all of the users in the system to define user groups. By comparing these user groups, the group that produces a maximum sum rate can be determined. Through computer simulations, we have found that the proposed method outperforms the conventional technique yielding a sum rate that is 0.81 bps/Hz higher when the transmit signal to noise ratio (SNR) is 30 dB and the total number of users is 100.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.134-139
• /
• 1996

This paper discusses the user interface for content selection with a video-on-demand system. We suggest two modes for the selection process: active and passive. This paper analyses various video intensive user interfaces using logs of user operation to understand how users behave in each mode.

• Journal of Advanced Navigation Technology
• /
• v.15 no.1
• /
• pp.76-82
• /
• 2011

Most previous work on network selection in heterogeneous wireless networks has concentrated on the quality of the network alone. Therefore, users are not satisfied with network quality based network selection due to different user preferences. To solve this problem, we proposes a QoE-aware network selection algorithm that is based on the consumption patterns of user preferences which is divided into normal user, cost-sensitive user, quality-sensitive user and video quality as well as network quality. As a result of experiments, cost-sensitive user and quality-sensitive user are satisfied with enhanced QoE by 36% and 3% from the proposed network selection algorithm compared to the normal user, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.22-27
• /
• 2011

This paper proposes an efficient user selection algorithm that provides a maximum 셀 용량 based Multi-user MIMO system based on zero-forcing criterion. The proposed scheme forms a primary group of users whose channel power exceeds a predetermined threshold. Through computer simulations, we have found that the proposed method outperforms the conventional scheme yielding a sum rate that is 0.33 bps/Hz higher when the total numbers of users and transmit antennas in the cell are 100 and 4, respectively.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.879-884
• /
• 2012

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal-to-noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.494-499
• /
• 2009

In this paper, we provide an efficient method of user selection for achieving the maximum system throughput in downlink multiuser Multiple-Input Multiple-Output (MIMO) systems. A proposed method is for selecting a fine user set only with powers of each user channel and angles between them. This algorithm is simpler than SUS because there is no considering about the optimal value of correlation. The proposed method finds the user set toward maximizing system throughput, so it has high performance.