• Title, Summary, Keyword: user set selection

Search Result 71, Processing Time 0.041 seconds

Joint Optimization of User Set Selection and Transmit Power Allocation for Orthogonal Random Beamforming in Multiuser MIMO Systems

  • Kang, Tae-Sung;Seo, Bangwon
    • 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.

Novel User Selection Algorithm for MU-MIMO Downlink System with Block Diagonalization (Block Diagonalization을 사용하는 하향링크 시스템에서의 MU-MIMO 사용자 스케쥴링 기법)

  • Kim, Kyunghoon
    • Journal of the 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.

An Efficient User Selection Algorithm in Downlink Multiuser MIMO Systems with Zero-Forcing Beamforming (하향링크 다중 사용자 MIMO 시스템에서의 Zero-Forcing 빔 형성을 이용한 효과적인 사용자 선택 기법)

  • Go, Hyun-Sung;Oh, Tae-Youl;Choi, Seung-Won
    • 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.

Optimal user selection and power allocation for revenue maximization in non-orthogonal multiple access systems

  • Pazhayakandathil, Sindhu;Sukumaran, Deepak Kayiparambil;Koodamannu, Abdul Hameed
    • ETRI Journal
    • /
    • v.41 no.5
    • /
    • pp.626-636
    • /
    • 2019
  • A novel algorithm for joint user selection and optimal power allocation for Stackelberg game-based revenue maximization in a downlink non-orthogonal multiple access (NOMA) network is proposed in this study. The condition for the existence of optimal solution is derived by assuming perfect channel state information (CSI) at the transmitter. The Lagrange multiplier method is used to convert the revenue maximization problem into a set of quadratic equations that are reduced to a regular chain of expressions. The optimal solution is obtained via a univariate iterative procedure. A simple algorithm for joint optimal user selection and power calculation is presented and exhibits extremely low complexity. Furthermore, an outage analysis is presented to evaluate the performance degradation when perfect CSI is not available. The simulation results indicate that at 5-dB signal-to-noise ratio (SNR), revenue of the base station improves by at least 15.2% for the proposed algorithm when compared to suboptimal schemes. Other performance metrics of NOMA, such as individual user-rates, fairness index, and outage probability, approach near-optimal values at moderate to high SNRs.

Reinforcement Learning Method Based Interactive Feature Selection(IFS) Method for Emotion Recognition (감성 인식을 위한 강화학습 기반 상호작용에 의한 특징선택 방법 개발)

  • Park Chang-Hyun;Sim Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.666-670
    • /
    • 2006
  • This paper presents the novel feature selection method for Emotion Recognition, which may include a lot of original features. Specially, the emotion recognition in this paper treated speech signal with emotion. The feature selection has some benefits on the pattern recognition performance and 'the curse of dimension'. Thus, We implemented a simulator called 'IFS' and those result was applied to a emotion recognition system(ERS), which was also implemented for this research. Our novel feature selection method was basically affected by Reinforcement Learning and since it needs responses from human user, it is called 'Interactive feature Selection'. From performing the IFS, we could get 3 best features and applied to ERS. Comparing those results with randomly selected feature set, The 3 best features were better than the randomly selected feature set.

Intelligent Channel Selection based on User History Data (메타 데이터를 이용한 채널 선택)

  • 최만석;최형석;오상욱;설상훈
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • /
    • pp.189-192
    • /
    • 2001
  • In this paper, we propose a method of loaming user preference for set-top box scenario. Our proposed method analyzes user history data to learn user preference and then automatically suggest the list of TV programs to the user under the assumption that the TV programs are regularly repeated on time and daily basis. We used MPEG-7 MDS to describe user history data. The experiment results show the proposed method yielded a good performance.

  • PDF

A Frequency Allocation Method for Cognitive Radio Using the Fuzzy Set Theory (퍼지 집합 이론을 활용한 무선인지 주파수 할당 알고리즘)

  • Lee, Moon-Ho;Lee, Jong-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.745-750
    • /
    • 2008
  • In a cognitive radio based system, quality of service (QoS) for the secondary user must be maintained as much as possible even while that of the primary user is protected all he time. In particular, switching wireless links for the secondary user during the transmission of multimedia data causes delay and information loss, and QoS degradations occur inevitably. The efficient resource management scheme is necessary to support the seamless multimedia service to the secondary user. This paper proposes a novel frequency selection method based on Multi-Criteria Decision Making (MCDM), in which uncertain parameters such as received signal strength, cell load, data rate, and available bandwidth are considered during the decision process for the frequency selection with the fuzzy set theory. Through simulation, we show that our proposed frequency selection method provides a better performance than the conventional methods which consider the received signal strength only.

Device-to-Device assisted user clustering for Multiple Access in MIMO WLAN

  • Hongyi, Zhao;Weimin, Wu;li, Lu;Yingzhuang, Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2972-2991
    • /
    • 2016
  • WLAN is the best choice in the place where complex network is hard to set up. Intelligent terminals are more and more assembled in some areas now. However, according to IEEE 802.11n/802.11ac, the access-point (AP) can only serve one user at a single frequency channel. The spectrum efficiency urgently needs to be improved. In theory, AP with multi-antenna can serve multiple users if these users do not interfere with each other. In this paper, we propose a user clustering scheme that could achieve multi-user selection through the mutual cooperation among users. We focus on two points, one is to achieve multi-user communication with multiple antennas technique at a single frequency channel, and the other one is to use a way of distributed users' collaboration to determine the multi-user selection for user clustering. Firstly, we use the CSMA/CA protocol to select the first user, and then we set this user as a source node using users' cooperation to search other proper users. With the help of the users' broadcast cooperation, we can search and select other appropriate user (while the number of access users is limited by the number of antennas in AP) to access AP with the first user simultaneously. In the network node searching, we propose a maximum degree energy routing searching algorithm, which uses the shortest time and traverses as many users as possible. We carried out the necessary analysis and simulation to prove the feasibility of the scheme. We hope this work may provide a new idea for the solution of the multiple access problem.

Semi-automatic Field Morphing : Polygon-based Vertex Selection and Adaptive Control Line Mapping

  • Kwak, No-Yoon
    • International Journal of Contents
    • /
    • v.3 no.4
    • /
    • pp.15-21
    • /
    • 2007
  • Image morphing deals with the metamorphosis of one image into another. The field morphing depends on the manual work for most of the process, where a user has to designate the control lines. It takes time and requires skills to have fine quality results. It is an object of this paper to propose a method capable of realizing the semi-automation of field morphing using adaptive vertex correspondence based on image segmentation. The adaptive vertex correspondence process efficiently generates a pair of control lines by adaptively selecting reference partial contours based on the number of vertices that are included in the partial contour of the source morphing object and in the partial contour of the destination morphing object, in the pair of the partial contour designated by external control points through user input. The proposed method generates visually fluid morphs and warps with an easy-to-use interface. According to the proposed method, a user can shorten the time to set control lines and even an unskilled user can obtain natural morphing results as he or she designates a small number of external control points.

Interactive Feature selection Algorithm for Emotion recognition (감정 인식을 위한 Interactive Feature Selection(IFS) 알고리즘)

  • Yang, Hyun-Chang;Kim, Ho-Duck;Park, Chang-Hyun;Sim, Kwee-Bo
    • Journal of Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.647-652
    • /
    • 2006
  • This paper presents the novel feature selection method for Emotion Recognition, which may include a lot of original features. Specially, the emotion recognition in this paper treated speech signal with emotion. The feature selection has some benefits on the pattern recognition performance and 'the curse of dimension'. Thus, We implemented a simulator called 'IFS' and those result was applied to a emotion recognition system(ERS), which was also implemented for this research. Our novel feature selection method was basically affected by Reinforcement Learning and since it needs responses from human user, it is called 'Interactive Feature Selection'. From performing the IFS, we could get 3 best features and applied to ERS. Comparing those results with randomly selected feature set, The 3 best features were better than the randomly selected feature set.