• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.59-65
• /
• 2008

In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.4
• /
• pp.329-341
• /
• 2011

The object of this paper is to compare the accuracy and the characteristic of various methods of solving the geodetic inverse problem for the geodesic lines which be in the standard case and special cases(antipodal, near antipodal, equatorial, and near equatorial situation) on the WGS84 reference ellipsoid. For this, the various algorithms (classical and recent solutions) to deal with the geodetic inverse problem are examined, and are programmed in order to evaluate the calculation ability of each method for the precise geodesic determination. The main factors of geodetic inverse problem, the distance and the forward azimuths between two points on the sphere(or ellipsoid) are determined by the 18 kinds of methods for the geodetic inverse solutions. After then, the results from the 17 kinds of methods in the both standard and special cases are compared with those from the Karney method as a reference. When judging these comparison, in case of the standard geodesics whose length do not exceed 100km, all of the methods show the almost same ability to Karney method. Whereas to the geodesics is longer than 4,000km, only two methods (Vincenty and Pittman) show the similar ability to the Karney method. In the cases of special geodesics, all methods except the Modified Vincenty method was not proper to solve the geodetic inverse problem through the comparison with Karney method. Therefore, it is needed to modify and compensate the algorithm of each methods by examining the various behaviors of geodesics on the special regions.

• Journal of Korean Society of Transportation
• /
• v.32 no.3
• /
• pp.239-247
• /
• 2014

In modern society, the transportation sector is having difficulties with mobility, safety, energy and environment issues so that solutions should be prepared progressively. Recently developed countries are paying greater attention to car-sharing systems as alternatives for relieving problems caused by increasing number of vehicles. Car-sharing systems are believed to keep the number of personal vehicles down and traffic congestion due to the fact that this system induces efficiency of vehicle operation. In this study, authors focused on solving the imbalance problem of car-sharing systems dynamically, to specifically improve one-way car sharing service. Therefore vehicle relocation algorithm was designed for maximizing profit of car sharing operators. For the application of the vehicle relocation algorithm among rental offices, we selected Haeundae-gu, Busan as the area of study. Rental offices have been designated to the zone centroid and we calculated the shortest path between rental offices by using TransCAD. In the study, we adapted MATLAB for the application of vehicle relocation algorithm. As the results, the total vehicle relocation time was estimated as 59.9 minutes. In addition, vehicle relocation algorithm was verified successfully by using Decision Tree method.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.784-795
• /
• 2016

In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1905-1912
• /
• 2017

In recent years, Ulaanbaatar, a capital of Mongolia has witnessed major problem that air quality reaches hazardous level during the winter season. Coal combustion for heating of every house in "Ger" district is main reason. One way to reduce the air pollution is mass usage of electric heater. However, there are several difficulties such as overload and degradation of transformers and other equipment used in distribution and transmission systems as well as power shortage occurrence in evening peak period due to residential consumption. This study aims to contribute for solving the air pollution and power shortage problem in Mongolia. One possible solution could be distributed generation (DG) with photovoltaic (PV) penetration. In this study, PV with energy storage (ES) hybrid system to reduce peak load is analyzed. We proposed the suitable structure of PV-ES hybrid for Mongolian household, and suggested several operation scenarios. Optimal operation algorithm is carried out based on a comparison aspect from economical, grid impact and PV penetration possibility. The economic analyse shows annual income of 520USD, and has a payback period of 8 years for selected scenario. The proposed PV-ES system structure is verified by experimentation set on the building rooftop in city center. The suggested scenario is planned to apply for system in further research.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.139-146
• /
• 2003

In this paper we demonstrate a cryptanalysis of the stream cipher LILI-128. Our approach to analysis on LILI-128 is to solve an overdefined system of multivariate equations. The LILI-128 keystream generato $r^{[8]}$ is a LFSR-based synchronous stream cipher with 128 bit key. This cipher consists of two parts, “CLOCK CONTROL”, pan and “DATA GENERATION”, part. We focus on the “DATA GENERATION”part. This part uses the function $f_d$. that satisfies the third order of correlation immunity, high nonlinearity and balancedness. But, this function does not have highly nonlinear order(i.e. high degree in its algebraic normal form). We use this property of the function $f_d$. We reduced the problem of recovering the secret key of LILI-128 to the problem of solving a largely overdefined system of multivariate equations of degree K=6. In our best version of the XL-based cryptanalysis we have the parameter D=7. Our fastest cryptanalysis of LILI-128 requires $2^{110.7}$ CPU clocks. This complexity can be achieved using only $2^{26.3}$ keystream bits.

• Journal of the military operations research society of Korea
• /
• v.35 no.2
• /
• pp.1-14
• /
• 2009

During wartime, the Air Force have to plan where, and how much, and what need to be distributed to surrounding local area from a chosen central bases. Each base, which has surplus more than needed amount of a certain material collected from near area of the base, is expected to distribute such surplus to other bases in shortage of it. By sending such surplus to other bases in shortage of the material, every base may get sufficient amount of all kinds of materials needed for each base during wartime. Because number of items of materials needed in each military bases during wartime are usually quite large and the frequencies of delivery from a place to other place are also pretty large if each item is delivered from a surplus place to other places in shortage, the Head Quarter of Air Force or the Logistics Command will face to difficulty to decide a reasonable delivery plan between bases for efficient and fast allocation of all materials needed to all bases during wartime. Therefore, this study suggests a solving algorithm with an established TC (transfer center: collecting and distributing center for all materials) to solve such a distribution and transportation problem.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1539-1547
• /
• 1999

캐리-세이브 가산기 (CSA)는 회로 설계 과정에서 빠른 연산 수행을 위해 가장 널리 이용되는 연산기 중의 하나이다. 그러나, 현재까지 산업체에서 CSA를 이용한 설계는 설계자의 경험에 따른 수작업에 의존하고 있고 그 결과 최적의 회로를 만들기 위해 매우 많은 시간과 노력이 소비되고 있다. 이에 따라 최근 CSA를 기초로 하는 회로 합성 자동화 기법에 대한 연구의 필요성이 대두되고 있는 상황에서, 본 논문은 연산 속도를 최적화하는 효율적인 CSA 할당 알고리즘을 제안한다. 우리는 CSA 할당 문제를 2단계로 접근한다: (1) 연산식의 멀티 비트 입력들만을 고려하여 최소 수행 속도 (optimal-delay)의 CSA 트리를 할당한다; (2) (1)에서 구한 CSA 트리의 수행 속도 증가가 최소화 (minimal increase of delay) 되는 방향으로 CSA들의 캐리 입력 포트들에 나머지 싱글 비트 입력들을 배정한다. 실제 실험에서 우리의 제안된 알고리즘을 적용하여 연산식들의 회로 속도를 회로 면적의 증가 없이 상당한 수준까지 줄일 수 있었다.Abstract Carry-save-adder (CSA) is one of the most widely used implementations for fast arithmetics in industry. However, optimizing arithmetic circuits using CSAs is mostly carried out by the designer manually based on his/her design experience, which is a very time-consuming and error-prone task. To overcome this limitation, in this paper we propose an effective synthesis algorithm for solving the problem of finding an allocation of CSAs with a minimal timing for an arithmetic expression. Specifically, we propose a two step approach: (1) allocating a delay-optimal CSA tree for the multi-bit inputs of the arithmetic expression and (2) determining the assignment of the single-bit inputs to carry inputs of the CSAs which leads to a minimal increase of delay of the CSA tree obtained in step (1). For a number of arithmetic expressions, we found that our approach is very effective, reducing the timing of the circuits significantly without increasing the circuit area.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.110-117
• /
• 2016

Applying the contrast enhancement algorithms to luminance values of color images is a widely used approach to enhance the contrast of color images. The results obtained by this approach have reduced saturation compared with that of the original images in spite of contrast enhancement without color degradation. Applying the contrast enhancement algorithm to each channel of color images is another approach for the contrast enhancement of color images. This method produces improved images in terms of contrast and saturation while the hue of original images is changed. In this paper, main cause of color degradation is analyzed and then solving the problem based on the analysis. The channel adaptive contrast enhancement method considering characteristics of each channel is also proposed to deal with color degradation. As a result, the proposed method enhances the contrast and saturation simultaneously without color degradation. Experimental results show that the proposed method outperforms the conventional methods not only on subjective evaluation but on objective criteria.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.3
• /
• pp.21-27
• /
• 2002

The digital watermarking methods have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia data. But it is still difficult to have been overcame the problem of the protection of property to multimedia data, such as digital images, digital video, and digital audio. This paper describes a watermarking algorithm that embeds non-linearly audio logo watermark data which is converted from audio signal of the ownership in the components of pixel intensities in an original image and that insists of ownership by hearing the audio signal transformed from the extracted audio logo through the speaker. Experimental results show that our algorithm using audio logo proposed in this paper is robust against attacks such as particularly lossy JPEG image compression.