• Journal of electromagnetic engineering and science
• /
• 제9권3호
• /
• pp.124-129
• /
• 2009

Although the maximum sum-rate capacity of multiple-input multiple output(MIMO) broadcast channels(BCs) can be achieved by dirty-paper coding(DPC), the results were obtained without fairness considerations in uncorrelated MIMO channels. In this paper, we propose new multiuser scheduling algorithms, which find a best user set for approaching the maximum sum-rate capacity while maintaining fairness among users. We analyze the performance of the proposed algorithms using zero-forcing dirty paper coding(ZF-DPC) in the correlated MIMO BCs for throughput and delay fairness, respectively. Numerical results demonstrate that a large time window can reduce the average throughput difference between users, but it increases head-of-line(HOL) delay jitters in the case of delay fairness.

• 한국위성정보통신학회논문지
• /
• 제6권1호
• /
• pp.19-27
• /
• 2011

본 논문에서는 블록 대각화 프리코딩 기법을 사용하는 다중 사용자 MIMO 하향링크 시스템에서 전체 채널 용량을 최대화하기 위한 데이터 스트림 할당 기법을 제안한다. 기존의 블록 대각화 프리코딩 기법은 모든 사용자에게 동일한 수의 데이터 스트림을 할당하고 water-filling에 의한 전력제어 만으로 전체 채널 용량을 최대화함으로써 데이터 스트림의 수의 차이에 의한 채널 용량의 이득을 스스로 제한했다. 제안하는 블록 대각화 프리코딩의 데이터 스트림 할당 기법은 시스템의 전체 채널 용량을 최대화하기 위하여 평균 채널이득, 순시 채널 이득의 크기를 비교하여 채널 이득이 좋은 사용자에게 많은 수의 데이터 스트림을 할당하고 water-filling을 통한 전력 제어를 하는 방법으로 채널 이득에 대한 채널 용량을 최대화 시킨다. 본 논문에서 제안된 데이터 스트림 할당 기법을 이용하여 시스템의 성능을 향상시킬 수 있음을 모의실험을 통해 증명했다.

• 디지털산업정보학회논문지
• /
• 제14권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.

• 한국통신학회논문지
• /
• 제34권12A호
• /
• pp.1006-1013
• /
• 2009

본 논문에서는 블록 대각화 기법을 사용하는 다중 사용자 MIMO (Multiple-Input Multiple-Output) 하향링크 채널 환경에서 모든 사용자의 성능을 동일하게 보장하기 위하여 데이터 스트림의 수를 할당하는 기법을 제안한다. 기존의 연구들은 전체 채널 용량의 최대화에 중점을 두고 있고, 각 사용자의 채널 환경에 따라서 채널 용량이 불균등하게 분배되어 사용자 간의 차이가 크다. 뿐만 아니라, water-filling 기법을 사용하여 전력을 제어함으로써, 채널 이득이 작은 사용자는 매우 작은 채널 용량만을 가질 수 있었다. 또한, 대부분의 연구에서는 모든 사용자에 대해 동일한 수의 데이터 스트림을 사용함으로써, 스스로 데이터 스트림의 분배에 의한 추가적인 이득을 제한했다. 본 논문에서는 사용자 채널의 크기에 따라 데이터 스트림을 분배하여 모든 사용자에게 균등한 채널 용량을 보장하는 조건에서 이를 최대화하는 기법을 제안하고 모의실험을 통하여 제안된 기법이 기존의 기법에 비해 송신전력과 채널 용량의 이득이 더 큰 것을 확인한다.

• Management Science and Financial Engineering
• /
• 제19권2호
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• The Korean Journal of Physiology
• /
• 제6권1호
• /
• pp.39-42
• /
• 1972

This study was carried out on the energy expenditure and physical capacity of 504 persons from 17 occupations. The energy expenditure was measured by indirect calorimetry using a Douglas' bag and Scholander's gas analyser. The physical capacity was determined by the Harvard's step test and the maximum oxygen consumption using a treadmill. The assessment of the daily energy expenditure for each subject was made by the factorial method using a record of the activies throughout 24 hours of every survey day. The total daily energy expenditure is the sum of all energy expenditure. This was calculated by multiplying the caloric value of the metabolic rate by the time spent on each activity. Most of the occupations involved moderate or heavy work.

• 한국통신학회논문지
• /
• 제35권2A호
• /
• pp.121-127
• /
• 2010

이 논문에서는 다중 사용자 무선통신 환경에서 전송률-형평성 트레이드오프를 임의로 제어할 수 있는 계산이 효율적인 전송률-형평성 제어 스케줄링 알고리즘을 제안한다. 제안되는 스케줄링 기준은 최대의 전송률 합을 추구하는 스케줄링 기준과 최대의 형평성을 추구하는 스케줄링 기준을 제어 인자에 따라 전송률과 형평성을 조정할 수 있도록 선형적으로 결합한다. 이때, 선형 결합을 통한 전송률-형평성 트레이드오프 제어를 위하여 스케줄링 기준의 단위와 최적화 방향을 일치시키는 것이 필요하다. 제안된 알고리즘은 이러한 조건들을 만족시키기 위하여 순시 전송률과 평균 제공 전송률을 스케줄링 기준으로 결정하고, 이들을 제어 인자를 사용하여 최적화 방향이 일치하도록 선형적으로 결합하여 제어 인자 값에 따라 다양한 전송률형평성 성능을 제공할 수 있도록 한다. 추가적인 계산 간소화를 위하여 순시 전송률에 대한 높은 SNR (signal-to-noise ratio) 근사화 관계를 이용한다. 모의 실험을 통하여 독립적인 레일리 페이딩 다중 사용자 채널에서 제안된 스케줄링 알고리즘에 대하여 제어 인자 값에 따른 전송률과 형평성 성능을 분석하였고, 순시 전송률의 높은 SNR 근사화 관계를 이용한 성능 분석도 이루어졌다. 모의실험 결과, 제안된 스케줄링 알고리즘은 최대 전송률을 추구하는 스케줄링과 최대 형평성을 추구하는 스케줄링 사이에서 전송률-형평성 성능을 임의로 조절할 수 있음을 확인할 수 있었고, 근사화 결과도 만족스러운 결과를 얻을 수 있었다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• Journal of Electrical Engineering and Technology
• /
• 제12권4호
• /
• pp.1397-1405
• /
• 2017

As the introduction of wind power is steadily increasing, negative effects of wind power become more important. To operate a power system more reliable, the system operator needs to recognize the maximum required capacity of available generators for a certain period. For recognizing the maximum capacity, this paper proposes a methodology to determine an optimal reserve requirement considering wind power, for the certain period in the mid-term perspective. As wind speed is predicted earlier, the difference of the forecasted and the actual wind speed becomes greater. All possible forecast errors should be considered in determining optimal reserve, and they are represented explicitly by the proposed matrix form in this paper. In addition, impacts of the generator failure are also analyzed using the matrix form. Through three main stages which are the scheduling, contingency and evaluation stages, costs associated with power generation, reserve procurement and the usage, and the reliability cost are calculated. The optimal reserve requirement is determined so as to minimize the sum of these costs based on the cost/reliability analysis. In case study, it is performed to analyze the impact of wind power penetration on the reserve requirement, and how major factors affect it.