• ETRI Journal
• /
• v.28 no.2
• /
• pp.155-161
• /
• 2006

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.2
• /
• pp.42-46
• /
• 2018

Adaptive signal processing is quite important in various signal and communication environments. In adaptive signal processing methods since the least mean square(LMS) algorithm is simple and robust, it is used everywhere. As the step is varied in the variable step(VS) LMS algorithm, the fast convergence speed and the small excess mean square error can be obtained. Various variable step LMS algorithms are researched for better performances. But in some of variable step LMS algorithms the computational complexity is quite large for better performances. The fixed step LMS algorithm with a low computational complexity merit and the variable step LMS algorithm with a fast convergence merit are combined in the proposed sporadic step algorithm. As the step is sporadically updated, the performances of the variable step LMS algorithm can be maintained in the low update rate using Fibonacci sequence. The performances of the proposed variable step LMS algorithm are proved in the adaptive equalizer.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.1
• /
• pp.80-86
• /
• 2002

This paper describes to extend the MLFMA(Multi-Level Fast Multipole Algorithm) for three-dimensional capacitance computation in the case of conductors embedded in an arbitrary dielectric medium. The triangular meshes are used and refined in the area which has heavy charge density. This technique is applied to the capacitance extraction of three-dimensional structures with multiple dielectrics. The results show good convergence with the comparable accuracy, and this adaptive technique coupled with MLFMA is useful to reduce computing time and the number of elements with least additional computational efforts in large three dimensional problems.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.34-42
• /
• 1992

This paper presents two fast least-squares lattice algorithms for adaptive nonlinear filters equipped with bilinear system models. The lattice filters perform a Gram-Schmidt orthogonalization of the input data and have very good numerical properties. Furthermore, the computational complexity of the algorithms is an order of magnitude snaller than previously algorithm is an order of magnitude smaller than previously available methods. The first of the two approaches is an equation error algorithm that uses the measured desired response signal directly to comprte the adaptive filter outputs. This method is conceptually very simple`however, it will result in biased system models in the presence of measurement noise. The second approach is an approximate least-squares output error solution. In this case, the past samples of the output of the adaptive system itself are used to produce the filter output at the current time. Results of several experiments that demonstrate and compare the properties of the adaptive bilinear filters are also presented in this paper. These results indicate that the output error algorithm is less sensitive to output measurement noise than the squation error method.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.310-316
• /
• 2002

In this paper, we propose an adaptive search range decision algorithm for fast motion estimation of video coding. Block matching algorithm for motion vector estimation that improves coding efficiency by reduction of temporal redundancy has trade-off problem between the motion vector accuracy and the complexity. The proposed algorithm playing as a pre-processing of fast motion estimation adaptively determines the motion search range by the local statistics of neighboring motion vectors. resulting in dramatic reduction of the computational cost without the loss of coding efficiency. Experimental results show the capability of the proposed algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.6
• /
• pp.143-157
• /
• 1994

This paper is concerned with the position control of electrohydraulic servo system under parameter variation. An adaptive sliding mode control which uses the direct parameter estimation scheme, is proposed to design a robust controller for fast and accurate control of the system. It is shown that the adaptive sliding mode control algorithm is robust and effective in attaining fast and accurate position control of system under time-dependent parameter variation. It is also shown experimentally that chattering phenomena in a sliding mode control can significantly be reduced by using boundary layer technique, and that new approach in sliding mode control introducing a term proportional to the distance between the current state and the sliding surface in the control law is effective to obtain fast response and to increase stability of the system. Computer simulation on the dynamic performance of the control system is also presented.

• 전기의세계
• /
• v.30 no.12
• /
• pp.822-831
• /
• 1981

Many different schemes of the adaptive observer and controller have been developed for both continuous and discrete systems. In this paper we have presented a new scheme of the reduced order adaptive observer for the single input discrete linear time invariant plant. The output equation of the plant, is transformed into the bilinear form in terms of system parameters and the states of the state variable filters. Using the plant output equation the discrete implicit adaptive observer based on the similar philosophy to Nuyan and Carroll is derived and the parameter adaptation algorithm is derived based on the exponentially weighted least square method. The adaptive model following control system is also constructed according to the proposed observer scheme. The proposed observer and controller are rather than simple structure and have a fast adaptive algorithm, so it may be expected that the scheme is suitable to the practical application of control system design. The effectiveness of the algorithm and structure is illustrated by the computer simulation of a third order system. The simulation results show that the convergence speed is proportinal to the increasing of weighting factor alpha, and that the full order and reduced order observer have similar convergence characteristics.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.5
• /
• pp.1002-1011
• /
• 2013

This paper proposes the new adaptive protection algorithm for inverse-time overcurrent relays (OCRs) to ensure their proper operating time and protective coordination. The application of the proposed algorithm requires digital protection relays with microcontroller and memory. The operating parameters of digital OCRs are adjusted based on the available data whenever system conditions (system with distributed generation (DG)) vary. Moreover, it can reduce the calculation time required to determine the operating parameters for achieving its purpose. To verify its effectiveness, several case studies are performed in time-domain simulation. The results show that the proposed adaptive protection algorithm can keep the proper operating time and provide the protective coordination time interval with fast response.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.