• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.15-24
• /
• 1998

This paper proposes a new template matching algorithm and its chip design. The CC and SAD algorithms require the massive amount of computation. Hence, several algorithms using quantization schemes have been proposed to reduce the amount of computation and its hardware cost. the proposed algorithm called the EMPPM improves at least 22% of the noise margin compared with the MPPM algorithm. In addition, the proposed architecture can reduce the gate count by more than 60% of that used in the SAD algorithm without usig quantization schemes and 28% of the MPPM algorithm. The VHDL models have been simulated by using the CADANCETEX>$^{TM}$ and logic synthesis has been performed by using the SYNOPSYSTEX>$^{TM}$ with $0.6\mu\textrm{m}$ SOG(sea-of-gate) cell library. The implemented chip consists of 35,829 gates, operates at 100 MHz (worst case 53 MHz) and performs the template maching with the speed of 200 Mpixels/sec.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.9
• /
• pp.27-35
• /
• 1994

It is known that a unified phase I-phase II semi-infinite optimization algorithm with a steerign parameter performs better than the original unified phase I-phase II algorithm. In this paper, the effect of the steering parameter is analized and a new algorithm is presented based on the facts that when the point x is far away from the feasible region, reaching to the feasible region is more important than minimizing the cost functio and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. It is also important to consider the relationship between the feasible direction and the gradient of the cost function. Even though changing the steering parameter does not change the rate of convergence of the algorithm, it is shown from examples that given new algorithm is more efficient than the previous ones.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.511-521
• /
• 2010

This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.5
• /
• pp.221-228
• /
• 2001

In this paper, a new control algorithm of series active power filter is proposed to reduce harmonic generated from nonlinear load in power system. In conventional control algorithm, harmonic current must be calculated firstly, and then compensation voltage was calculated by using the results but the proposed control algorithm can calculate compensation voltage directly. Compensating principle of proposed control algorithm is presented in detail. A combined system of series active filter and passive filter is composed in order to experiment. Experiment was carried out to verify proposed control algorithm of series active filter and experimental results are analyzed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.432-436
• /
• 2009

We have developed a new optimization algorithm termed simple bacteria cooperative optimization (sBCO) based on bacteria behavior patterns [1]. In [1], we have introduced the algorithm with basic operations and showed its feasibility with some function optimization problems. Since the sBCO was the first version with only basic operations, its performance was not so good. In this paper, we adopt a new operation, rank replacement, to the sBCO for improving its performance and compare its results to those of the simple genetic algorithm (sGA) which has been well known and widely used as an optimization algorithm. It was found from the experiments with four function optimization problems that the sBCO with rank replacement was superior to the sGA. This shows that our algorithm can be a good optimization algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1235-1243
• /
• 2004

In this paper, a new blind equalizer algorithm is proposed which operates on dual mode and combines the benefits of both the Sign-Godard algorithm and the radius-directed algorithm The proposed algorithm has both the properties of good initial convergence of the Sign-Godard algorithm and low residual errors after convergence of the radius-directed algorith High order statistics are used for blind phase recovery and gor avoiding local minima. Simulation results show that the new algorithm has not only faster convergence rated but also lower residual errors than those of the conventional algorithms.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.591-598
• /
• 2014

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.81-89
• /
• 1997

This study is concerned with the scheduling problems in flexible manufacturing systems(FMSs). The scheduling problem in FMSs is a complex one when the number of machines and jobs are increased. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. The purpose of this study is to develope a machine and AGV dispatching algorithm. The proposed dispatching algorithm is a on-line scheduling algorithm considering the due date of parts and the status of the system in the scheduling process. In the new machine and AGV dispatching algorithm, a job priority is determined by LPT/LQS rules considering job tardiness. The proposed heuristic dispatching algorithm is evaluated by comparison with the existing dispatching rules such as LPT/LQS, SPT/LQS, EDD/LQS and MOD/LQS. The new dispatching algorithm is predominant to existing dispatching rules in 100 cases out of 100 for the mean tardiness and 89 cases out of 100 for the number of tardy jobs.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.79-86
• /
• 2002

This paper proposes a new algorithm for estimating ARMA model parameters. In estimating ARMA model parameters, several methods such as generalized least square method, instrumental variable method have been developed. Among these methods, the utilization of a bootstrap type algorithm is known as one of the effective approach for the estimation, but there are cases that it does not converge. Hence, in this paper, making use of a cross correlation function and utilizing the relation of structural a priori knowledge, a new bootstrap algorithm is developed. By introducing theoretical relations, it became possible to remove terms, which is liable to include much noise. Therefore, this leads to robust parameter estimation. It is shown by numerical examples that using this algorithm, all simulation cases converge while only half cases succeeded with the previous one. As for the calculation time, judging from the fact that we got converged solutions, our proposed method is said to be superior as a whole.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.8
• /
• pp.466-471
• /
• 2004

Electricity industries throughout the world are undergoing unprecedented changes. As a result, these changes lead to the separation of traditional integrated utilities and the introduction of competition in order that increase efficiency in electricity industry. Direct load control (DLC) system in competitive electricity market has a hierarchical interactive operation system, therefore, its control logic is also applied by bilateral interactive method that interchanges information related to interruptible load between operation hierarchies. Consequently, load curtailment allocation algorithm appropriate for new DLC system is required, and based on interchanged information, this algorithm should be implemented by most efficient way for each operation hierarchy. In this paper, we develop the load curtailment allocation algorithm in an emergency for new DLC system. Especially, the optimal algorithm for load aggregator (LA) that participates in competitive electricity market as a main operator for load management is developed.