• ETRI Journal
• /
• v.37 no.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.

• IE interfaces
• /
• v.17 no.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.08a
• /
• 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
• /
• v.14 no.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.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.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
• /
• v.13 no.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.

• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2011

In this paper, we propose the data stream allocation algorithms for maximizing sum capacity of downlink multiuser MIMO (Multiple-input Multiple-output) systems with BD (Block Diagonalization). The conventional BD precoding algorithms maximize the capacity by controlling power against channel gain of each user. In multiuser MIMO systems, however, the number of data streams for each user can be used to as another control parameter, which determines the capacity. This paper proposes the data stream allocation algorithm of BD for increasing capacity in multiuser MIMO systems. The proposed algorithm allocates unequal bit stream to each user based on channel matrix of each user for maximizing sum capacity. It is proved that proposed algorithm can achieve the significantly improved sum capacity by computer simulation.

• Journal of Convergence for Information Technology
• /
• v.11 no.5
• /
• pp.9-16
• /
• 2021

In binary-modulation non-orthogonal multiple access (NOMA), there has been rare researches for the 1+1 capacity region to be achieved; how much total power is required and what power allocation is assigned for this total power. In this paper, the average total transmitted power to achieve 1+1 capacity region of binary pulse amplitude modulation (2PAM) NOMA is investigated, with a tolerable loss. Then, based on the sufficient average total transmitted power, we calculate the power allocation coefficient to achieve 1+1 capacity region. Furthermore, it is shown by numerical results that with the tolerable loss less than 0.008, near 1+1 capacity region is achieved. We also calculate numerically the power allocation coefficient for both users to achieve near 1+1 capacity region. As a result, for 2PAM NOMA to operate near 1+1 capacity region, proper total power with appropriate power allocation could be calculated in design of NOMA systems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.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.

• Journal of the Korea Society for Simulation
• /
• v.9 no.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.