• The Transactions of the Korean Institute of Power Electronics
• /
• v.5 no.4
• /
• pp.352-357
• /
• 2000

The vector control scheme is usually applied to the high performance induction motor drives. The PI controller is adopted traditionally to control the motor speed and currents in the vector control scheme. In this case, the dynamic performance of the induction motor is dependent on the PI gains and the gain optimization is necessary in order to get a good dynamic performance. But, it is very hard to optimize the PI gains uniquely within the speed control range because the equivalent model of the motor control system should be known exactly. In this paper, we propose the hybrid control scheme to remove the defects of PI controller. The hybrid control scheme includes the simplified fuzzy controller which operates in the transient state and the PI controller which operates in the steady state. The proposed scheme is applied to the vector control for induction motor, and the digital simulation and the experimental results are given to verify the proposed scheme.

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.17-22
• /
• 2008

Double-binary turbo code has been adopted as an error control code of various future communication systems including wireless metropolitan area networks(WMAN) due to its powerful error correction capability. One of the components affecting the performance of turbo code is internal interleaver. In 802.16 d/e system, an almost regular permutation(ARP) interleaver has been included as a part of specification, however it seems that the interleaver is not optimized in terms of decoding performance. In this paper, we propose three optimization methods for the interleaver based on spatial distance, spread and minimum distance between original and interleaved sequence. We find optimized interleaving parameters for each optimization method and evaluate the performances of the proposed methods by computer simulation under additive white Gaussian noise(AWGN) channel. Optimized parameters can provide up to 1.0 dB power gain over the conventional method and furthermore the obtainable gain does not require any additional hardware complexity.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.46-47
• /
• 2007

전력시스템안정기는 전력시스템의 저주파 댐핑을 효율적으로 향상시키기 위해 사용되는 제어기이다. 전력시스템안정기의 동적 특성은 위상 보상기의 이득과 시정수와 같은 선형 파라미터와 출력 리미터와 같이 비평활, 비선형 특성을 나타내는 비선형 파라미터에 영향을 받는다. 기존의 선형 제어 방법인 고유치 분석을 통한 선형 파라미터의 최적화 방법은 소신호 동작 범위에 대한 최적화 기법이기 때문에 큰 상정사고 시 효과적인 댐핑 향상을 보장할 수 없게 된다. 이를 극복하기 위하여 하이브리드 시스템에 신경회로망을 임베디드화하여 체계적인 방법으로 비선형 파라미터를 최적화한 후, 고유치 분석을 통해 선형 파라미터를 최적화함으로 전력시스템안정기의 성능 향상을 도모할 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.698-706
• /
• 2016

In order to move mobile robots to desired locations in a minimum time, optimal control problems have to be solved; however, their analytic solutions are almost impossible to obtain due to robot nonlinear equations. This paper presents a method to get optimal control gains of mobile robots using genetic algorithms. Since the optimal control gains of mobile robots depend on the initial conditions, the initial condition range is discretized to form some grid points, and genetic algorithms are applied to provide the optimal control gains for the corresponding grid points. The optimal control gains for general initial conditions may be obtained by use of neural networks. So the optimal control gains and the corresponding grid points are used to train neural networks. The trained neural networks can supply pseudo-optimal control gains. Finally simulation studies have been conducted to verify the effectiveness of the method presented in this paper.

• Proceedings of the KIPE Conference
• /
• 2011.07a
• /
• pp.388-389
• /
• 2011

본 논문에서는 서버용 전원 장치의 DC-DC단에 사용되는 디지털 전압 모드 제어기를 설계한다. 서버용 전원 장치는 2차 측에 고전류가 흐르는 사양으로 인하여 부하 전류에 따라 출력 인덕턴스 변화를 가지게 되며, hold-up time 규제를 만족하기 위하여 입력 전압의 변동 범위를 가진다. 이와 같은 조건은 제어기를 설계하는데 제약을 작용하게 되어 고정 이득을 가지는 방식에서는 최적화된 부하 변동 특성을 얻기 힘들다. 이와 같은 문제점을 해결하기 위하여 제어기의 이득 조정 기법을 제안하고 실험을 통하여 검증한다.

• Journal of the Korea Convergence Society
• /
• v.11 no.11
• /
• pp.195-201
• /
• 2020

This paper implemented quadcopter-type drone system and proposed the heuristic method for obtaining the optimum gain coefficients in order to minimize the settling time. Control system for quadcopter posture stabilization reads the posture data from accelerator and gyro sensor, revises the original posture data using Mahony filter, and drives 4 DC motors using PID controller. The first step of the proposed method is to obtain the gain coefficients using the Ziegler-Nichols method, and then determine the optimum gain coefficients using the heuristic method at the next 3 steps. The experimental result shows that the maximum overshoot decreases from 44.3 to 29.8 degrees and the settling time decreases from 2.6 to 1.7 seconds compared to the Ziegler-Nichols method. Therefore, we proved that the proposed method works well in quadcopter flight system with high motor noise while reducing trial and error to obtain the optimal PID gain coefficients.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.212-214
• /
• 2012

데이터 집약적인 대부분의 애플리케이션들은 규칙적인 메모리 접근 패턴과 동시에 불규칙적인 접근 패턴을 커널 코드에 포함하고 있다. 그 동안 대부분의 메모리 접근 패턴 최적화 기법은 규칙적인 패턴에 집중되어 있었다. 하지만 암호화/통신 관련 애플리케이션에서는 불규칙한 패턴으로 메모리 접근의 대부분을 구성하는 경우가 많다. 이러한 불규칙한 메모리 접근 패턴을 대상으로 온칩메모리를 효율적으로 사용하도록 최적화 기법을 일반화하여 설계하는 일은 어려운 작업이기 때문에 관련 연구분야에 큰 진전이 없는 실정이다. 우리는 불규칙 메모리 접근 패턴 최적화 문제를 해결하기 위하여 데이터 클러스터링 기법을 제안하였다. 클러스터링은 접근되는 데이터의 시공간 지역성을 계산하여 이득이 큰 데이터들을 하나의 블록으로 구성하여 온칩메모리에 상주시키는 기본단위로 사용하는 기법이다. 본 기법을 이용하면 기존의 캐시메모리에 비하여 약 19% 에너지 소모를 절감할 수 있다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.113-122
• /
• 2002

Control system modeling and optimal bending filter design for KSR-III (Korea Sounding Rocket III) are performed. Rigid rocket dynamics, aerodynamics, sloshing, structural bending, actuator dynamics, sensor dynamics and on-board computer characteristics are considered for control system modeling. Compensation for time-varying control system parameters is conducted by gain-scheduling. A filter to stabilize bending mode is designed using parameter optimization technique. Resultant attitude control system can satisfy required frequency domain stability margin.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.2
• /
• pp.37-43
• /
• 2009

In this study, multi-channel digital hearing aid algorithm for low power system is proposed. First, MDCT(Modified Discrete Cosine Transform) method converts time domain of input speech signal into frequency domain of it. Output signal from MDCT makes a group about each channel, and then each channel signal adjusts a gain using LCF(Loudness Compensation Function) table depending on hearing loss of an auditory person. Finally, compensation signal is composed by TDAC and IMDCT. Its all of process make progress 16-bit fixed-point operation. We use fast-MDCT instead of MDCT for reducing system complexity and previously computed tables instead of log computation for estimating a gain. This algorithm evaluate through computer simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.169-173
• /
• 2014

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.