• ETRI Journal
• /
• 제37권1호
• /
• pp.11-20
• /
• 2015

This paper deals with optimal power allocation for channel estimation of orthogonal frequency-division multiplexing uplinks in time-varying channels. In the existing literature, the estimation of time-varying channel response in an uplink environment can be accomplished by estimating the corresponding channel parameters. Accordingly, the optimal power allocation studied in the literature has been in terms of minimizing the mean square error of the channel estimation. However, the final goal for channel estimation is to enable the application of coherent detection, which usually means high spectral efficiency. Therefore, it is more meaningful to optimize the power allocation in terms of capacity. In this paper, we investigate capacity with imperfect channel estimation. By exploiting the derived capacity expression, an optimal power allocation strategy is developed. With this developed power allocation strategy, improved performance can be observed, as demonstrated by the numerical results.

• 산업공학
• /
• 제17권2호
• /
• pp.142-148
• /
• 2004

The objective of bridge construction cost allocation is to distribute in a fair and rational manner the bridge construction costs among those vehicles using the bridge. In most bridge construction cost allocation studies, bridge construction costs are mainly distributed according to traffic load(gross vehicle weight), without any consideration of bridge capacity requirements(the number of lanes). In this paper, a bridge cost allocation method for considering both traffic capacity and traffic loads is developed. The proposed method is based on cooperative game theory, particularly two concepts known as the Aumann-Shapley (A-S) value and Shapley value. This method can help to analyze the impact of traffic capacity costs. By applying the proposed method to an example, traffic capacity cost is found to be high so that traffic capacity should be considered to allocate the bridge construction costs to vehicle classes in a more equitable manner.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2007년도 학술대회
• /
• pp.55-58
• /
• 2007

An adaptive subcarrier allocation scheme based on comparative superiority of opportunity cost between groups is proposed for the enhancement of system capacity and its simple implementation at the base station of a multiuser OFDM system. The proposed algorithm is similar to the blockwise or the decentralized subcarrier allocation algorithm proposed by Xiaowen et al and Alen et al, respectively. In the proposed algorithm, however, all subcarriers are grouped according to the coherence bandwidth and the comparative superiority concept, which swaps the groups between users if the system capacity is increased, is adopted for the enhancement of system capacity. In addition, the proposed algorithm provides a simple solution for the conflict problem among users by reallocating only the conflicted groups and unassigned groups instead of reallocating entire groups. Simulation results demonstrate that the proposed algorithm increases the system capacity effectively over a static, an adaptive blockwise, and a decentralized subcarrier allocation algorithms.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.257-266
• /
• 2012

A decode-and-forward two-way relay system benefits from orthogonal frequency division multiplexing (OFDM) and relay transmission. In this paper, we consider a decode-and-forward two-way relay system over OFDMwith two strategies: A joint subcarrier matching algorithm and a power allocation algorithm operating with a total power constraint for all subcarriers. The two strategies are studied based on average capacity using numerical analysis by uniformly allocating power constraints for each subcarrier matching group. An optimal subcarrier matching algorithm is proposed to match subcarriers in order of channel power gain for both transmission sides. Power allocation is defined based on equally distributing the capacity of each hop in each matching group. Afterward, a modified water-filling algorithm is also considered to allocate the power among all matching groups in order to increase the overall capacity of the network. Finally, Monte Carlo simulations are completed to confirm the numerical results and show the advantages of the joint subcarrier matching, power allocation and water filling algorithms, respectively.

• 한국항공운항학회지
• /
• 제25권3호
• /
• pp.101-107
• /
• 2017

Demand for air transportation in Korea keeps increasing, and the number of airport operations also grows as a result. The major two airports in Korea, Incheon International Airport and Gimpo International Airport, share the metropolitan airspace, which is crowd with air traffic. As air traffic increases in the metropolitan airspace, the demand for the airport operations would outnumber the capacities of these airports. However, there is a room to efficiently manage the shortage of the airport capacity due to the different distributions of operations in these airports. This study presents a dynamic slot allocation that allows exchanging slots according to the traffic demand. The dynamic allocation mitigates the airports' capacity problem but the airspace capacity itself should be increased in order to tackle the problem fundamentally.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

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

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

• 융합정보논문지
• /
• 제11권5호
• /
• pp.9-16
• /
• 2021

이진 변조 비직교 다중접속에서 1+1 용량 영역을 달성하는 주제에 대한, 다시 말해, 총 전력은 얼마나 필요한가와 이때 전력은 어떻게 할당해야 되는가에 대한 연구가 다소 미흡하다. 본 논문에서는, 허용 가능한 손실범위 안에서, 2PAM 비직교 다중 접속의 1+1 용량 영역을 달성할 수 있는 평균 총 전송 전력을 고찰한다. 다음으로, 충분한 평균 총 전력을 기반으로 1+1 용량 영역을 달성할 수 있는 전력 할당 계수를 계산한다. 그리고, 수치적 결과를 통해서 0.008 미만의 허용 가능한 손실 범위 안에서, 근접 1+1 용량 영역이 달성됨을 보여준다. 또한, 수치상으로 근접 1+1 용량 영역을 달성하는 양 사용자의 전력 할당 계수를 계산한다. 결론적으로 2PAM 비직교 다중 접속이 근접 1+1 용량 영역에서 동작하기 위해, 적절한 전력 할당과 함께, 적당한 총 전력이 비직교 다중접속 설계에서 계산될 수 있다.

• 대한산업공학회지
• /
• 제35권3호
• /
• pp.185-193
• /
• 2009

We consider a two-fare, two-period airline seat capacity allocation problem where consumers may choose different options in purchasing an airline ticket. A consumer may decide to wait for reopening of the same fare class ticket which is originally intended to buy, or may buy a different fare class ticket within the same period, if the originally requested fare is unavailable. We investigate the impact of the consumer buying behavior on the optimal solutions and the expected revenue.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.63-73
• /
• 2000

Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm to solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.