• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.232-240
• /
• 2011

While the water-filling algorithm is an efficient power allocation method that maximizes the ergodic capacity of adaptive MIMO systems, its excessive residual power causes spectrum loss in real systems employing discrete modulation indices. In this paper we propose new power allocation algorithms that improve the spectral efficiency of MIMO systems by efficiently reallocating the residual power of the water-filling algorithm. We apply the proposed algorithms to the adaptive turbo-coded MIMO system to verify their performance through computer simulation in various environments. Simulation results show that the spectral efficiency of the proposed algorithms is better than that of the water-filling algorithm by about 8.9% at SNR of 20dB in Rayleigh fading environments.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.129-132
• /
• 1987

This paper presents an emergency control algorithms for viability crisis following abnormal condition as well as a sudden major supply outage and line outage. The algorithm considers the effect of voltage-reactive power control for determining the load shedding quantities and generation reallocation. The problem is decomposed into a P-problem and a Q-problem. The former minimizes system frequency deviation from nominal value and the latter minimizes voltages violation of load buses. The optimization problem is solved by a reduced gradient technique which can handle a great number of inequality constraints very efficiently. It has been found that the use of the proposed algorithm for 6-Bus system restore the abnormal system during the viability crisis to the normal state.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.263-271
• /
• 2023

In the (3,3) close combat model based on the Lanchester Square Law, this study proposes a plan to optimally allocate residual combat power after the battle to other battlefields. As soon as the two camps of three units can grasp each other's information and predict the battle pattern immediately after the battle began, the Time Zero Allocation of Force (TZAF) scenario was used to initially allocate combat power to readjust the combat model. It reflects travel time, which is a "field friction" in which physical distance exists from battlefields that support combat power to battlefields that are supported. By developing existing studies that try to examine the effect of travel time on the battlefield through the combat model, this study forms a (3,3) combat model, which is a large number of minimum units. In order to achieve the combat purpose, the principle of optimal combat force operation is presented by examining the aspect that support combat power is allocated to the two battlefields and the consequent battle results. Through this, various scenarios were set in consideration of the travel time and the situation of the units, and differentiated results were obtained. Although the most traditional, it can be used as the basic logic of the training or the commander's decision-making system using the actual war game model.

• Journal of Advanced Navigation Technology
• /
• v.24 no.5
• /
• pp.415-422
• /
• 2020

Federal Communications Commissions (FCC) has adopted a new rule that can provide a 1,200 MHz unlicensed spectrum to maximize the public benefits in the 5.925 ~ 7.125 GHz(6 GHz) band by expanding unlicensed broadband into the 6 GHz band while also ensuring that licensed services that operate in the band continue to thrive. In Korea, the M/W band of 6 GHz has been reallocated to introduce unlicensed services in the 6 GHz band. Considering the national interests, the entire 1,200 MHz will be supplied for the indoor uses, but only the 500 MHz of the lower bandwidth (5925 ~ 6425 MHz) will for the outdoor uses under the limited power to protect the incumbent services. The introduction of unlicensed devices is being actively promoted through the reallocation of the 6 GHz M/W band, but since it is desperately necessary to prepare technical requirements to operate them in Korea. In this paper, the US 6 GHz unlicensed rules has been analyzed, these results will be utilized for establishing Korean technical standards with the unlicensed spectrum expansion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1072-1078
• /
• 2008

In this paper, we propose an efficient superposition coding multiplexing(SCM) method based on power allocation in descending order for fading broadcast channels in which per-user minimum and maximum rate constraints are considered in order to maximize the transmission effectiveness. It consists of three steps as follows. In the first step, a user group is selected to maximize the number of users with whom a transmitter can communicate instantaneously. In the second step, per-user power allocation for each user is done in descending order of transmit power by determining a maximum allowable interference power from all subsequent interfering users in order to guarantee its corresponding minimum rate, and then a residual power is calculated. The final step is performed if some power remains even after the second step. In this step, additional power allocation is performed up to the maximum transmit power to provide the maximum rate to the corresponding user, again in ascending order, starting from the last user in descending order. But, this method does not require power reallocation to subsequent users because tentative power allocation in the second step has been performed in descending order to guarantee the minimum rate for each user, taking into account the maximum allowable interference power from all the subsequent users. Therefore, the proposed method gets more efficient in term of computational complexity when per-user minimum as well as maximum rate constraints exist, especially as the number of users increases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.11-17
• /
• 2009

This paper presents a new adaptive relay selection scheme for a regenerative orthogonal frequency division multiplexing access(OFDMA) relay network with fairness constrains. In the Proposed scheme, we select the best M relays out of a set of K potential relays to maximize system capacity. Among these selected relays, subcarriers are reallocated to satisfy fairness constraints as well as to minimize the degradation of the system performance. Afterwards, power allocation is performed for each subcarrier based on the water-filling method to enhance the performance improvement. By using the trade-off relationship between the system capacity and the fairness, the modified version of proposed scheme is also investigated.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.41-49
• /
• 2017

Theoretical modelling and computational results for frequency coordination are presented over mobile base station and fixed wireless systems in urban or sub-urban area. Computational results with key parameters needed for interference analysis are performed and discussed in terms of system characteristics, propagation model, protection ratio, frequency dependent rejection, and discrimination angle with signal-interference plane. Based upon minimum coupling loss methodology, calculated interference powers of victim receiver for assumed system parameters are compared with maximum allowable interference power derived from protection ratio as functions of discrimination angle and distance including height-gain model in urban or sub-urban area. The proposed method is applicable for technical analysis on co-existence or interoperability for the various wireless systems, mandatory for frequency coordination or reallocation process.

• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.395-404
• /
• 2010

Solid-State Disks (SSDs) have been currently considered as a promising candidate to replace hard disks, due to their significantly short access time, low power consumption, and shock resistance. SSDs, however, have drawbacks such that their write throughput and life span are decreased by random-writes, nearly regardless of SSDs controller designs. Previous studies have mostly focused on better designs of SSDs controller and reducing the number of write operations to SSDs. We suggest another method that reallocates data pages that tend to be simultaneously written to contiguous blocks. Our method gathers write operations during a period of time and generates write traces. After transforming each trace to a set of transactions, our method mines frequent itemsets from the transactions and reallocates the pages of the frequent itemsets. In addition, we introduce an algorithm that reallocates the pages of the frequent itemsets with moderate time complexity. Experiments using TPC-C workload demonstrated that our method successfully reduce 6% of total logical block access.