• 전자공학회논문지B
• /
• 제33B권2호
• /
• pp.187-196
• /
• 1996

This paper introduces the concept of fixed weights and proposes an algorithm for classification by adding this concept to vector space separation method in LVQ. The proposed algorithm is based on competitive learning. It uses fixed weightsfor generality and fast adaptation efficient radius for new weight creation, and L1 distance for fast calcualtion. It can be applied to many fields requiring adaptive learning with the support of generality, real-tiem processing and sufficient training effect using smaller data set. Recognition rate of over 98% for the train set and 94% for the test set was obtained by applying the suggested algorithm to on-line handwritten recognition.

• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.432-441
• /
• 2006

As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

• Journal of Power Electronics
• /
• 제16권6호
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• 조명전기설비학회논문지
• /
• 제22권7호
• /
• pp.37-42
• /
• 2008

In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

• 정보통신설비학회논문지
• /
• 제10권2호
• /
• pp.53-61
• /
• 2011

This research presents an adaptive fast motion estimation (ME) computation on the stage of uneven multi-hexagon grid search (UMHGS) algorithm included in an unsymmetrical-cross multi-hexagon-grid search (UMHexagonS) in H.264 standard. The proposed adaptive method is based on statistical analysis and previously obtained motion vectors to reduce the computational complexity of ME. For this purpose, the algorithm is decomposed into three processes: skipping, terminating, and reducing search areas. Skipping and terminating are determined by the statistical analysis of the collected minimum SAD (sum of absolute difference) and the search area is constrained by the slope of previously obtained motion vectors. Simulation results show that 13%-23% of ME time can be reduced compared with UMHexagonS, while still maintaining a reasonable PSNR (peak signal-to-noise ratio) and average bitrates.

• 대한전자공학회논문지
• /
• 제19권5호
• /
• pp.12-19
• /
• 1982

현재까지의 적응 필터(adaptive filter)의 설계 방법을 대별하면 국부 파라미타 최적화(local parameter optimization)방법[1]과 안정성(stability)을 주한점으로 하는 방법[1-3] 의 두 가지로 된다. 그리고 이들 중에서 비교적 간단한 방법은 로칼 파라미터 최적화 방법으로서, 이것에서는 스티피스트-디샌트(steepest-descent)방법[15]을 이용하는 LMS 알고리즘을 대표적인 것으로 들 수 있다. 적응 필터의 설계에 있어서 가장 중요한 것은 수검 속도를 높이는 일이다. 본 논문은 적응 비순환 필터의 설계를 위한 고속 수검 알고리즘을 개발하는 문제에 관하여 연구한 것으로, 적응 이득(adaptation-gain)을 적절히 조정함으로써, 종래 사용되어 오던 LMS 알고리즘 및 그의 변형인 여러 알고리즘에 비하여 수검 속도를 높일 수 있으며 동시에 안정성이 높은 새로운 알고리즘을 제시하였다. 그리고 제안된 알고리즘을 이용한 적응 필터의 특성 배선 문제를 다각도로 검토하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.172-177
• /
• 1988

In this paper, a new fast algorithm of FIR least squares filter with linear phase is presented. The general unknown statistics case is considered, whereby only sample records of the data are available. Taking advantage of the near-to-Toeplitz+Hankel structure of the resulting normal equation, a fast algorithm which gurantees the linear phase constraint, is developed that recursively produces the filter coefficient of linear phase FIR filter for a single block of data.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.395-397
• /
• 2007

In this paper, a Gauss-Seidel fast affine projection (GS-FAP) algorithm developed for the linear active noise control (ANC) is further utilized for nonlinear ANC of a 2nd-order Volterra systems with a nonlinear primary path and a noisy secondary path. The simulation results, obtained by applying adaptive Volterra filtering, show that the proposed approach yields more stable and faster nonlinear AN.C, compared with the conventional methods for the nonlinear ANC in case of noisy plant models.

• Journal of Electrical Engineering and Technology
• /
• 제5권1호
• /
• pp.28-35
• /
• 2010

This paper presents new Adaptive Linear Combination Structure (ADALINE) for tracking/estimating voltage-current phasor and frequency of power system. To estimate the phasors and frequency from sampled data, the algorithm assumes that orthogonal coefficients and speed of angular frequency of power system are unknown parameters. With adequate sampled data, the estimation problem can be considered as a linear weighted least squares (LMS) problem. In addition to determining the phasors (orthogonal coefficients), the procedure estimates the power system frequency. The main algorithm is verified through a computer simulation and data from field. The proposed algorithm is tested with transient and dynamic behaviors during power swing, a step change of frequency upon islanding of small generators and disconnection of load. The algorithm shows a very high accuracy, robustness, fast response time and adaptive performance over a wide range of frequency, from 10 to 2000 Hz.

• The Journal of the Acoustical Society of Korea
• /
• 제23권2E호
• /
• pp.40-43
• /
• 2004

In moving jammer environments, the performance of conventional adaptive beamformer is severely degraded and the robust adaptive beamformer requires additional sensors to obtain desired performances. Therefore, it is necessary to develop efficient algorithm without any additional requirement of the number of sensors, etc. In this paper, we introduce a fast adaptive algorithm with variable forgetting factor, which does not have any additional requirements. From the computer simulations, we obtain the better performances than those of other techniques for the arrays with various aperture lengths.