• Title/Summary/Keyword: Adaptive update algorithm

Search Result 121, Processing Time 0.031 seconds

An Integration Type Adaptive Compensator for a Class of Linearly Parameterized Systems (선형 파라미터화된 시스템에 대한 적분형 적응보상기)

  • Yoo Byung-Kook;Yang Keun-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.2
    • /
    • pp.82-88
    • /
    • 2005
  • A compensation scheme for a class of linearly parameterized systems is presented. The compensator consists of a typical linearizing control and an adaptive observer with integration type update law, which is based on Speed Gradient (SG) algorithm.. Instead of the intermediate functions of the compensation schemes suggested by other researchers, the proposed compensator is designed with some design functions which guarantee the growth, convexity, attainability, and pseudo gradient conditions in the update law. The scheme achieves the asymptotic stability of the tracking error and the boundedness of the estimation errors. A numerical example is given to demonstrate the validity of the proposed design.

  • PDF

AN EFFICIENT ALGORITHM FOR SLIDING WINDOW BASED INCREMENTAL PRINCIPAL COMPONENTS ANALYSIS

  • Lee, Geunseop
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.2
    • /
    • pp.401-414
    • /
    • 2020
  • It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.

Contents Adaptive MCTF Using JND (JND를 이용한 적응적 MCTF)

  • Heo, Jae-Seong;Ryu, Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.48-55
    • /
    • 2009
  • In scalable video coding, MCTF plays an important role for time-scalability and SNR-scalability. But there is image quality decreasing as MCTF level is increased because time interval of each frame is extended so that is hard to find suitable motion vector. In this paper, we propose an algorithm to prevent image quality from decreasing with unsuitable motion vector during MCTF update process using JND. We adapt JND to find errors within blocks of image and set a threshold which is used to add high frequency components during update process. We can overcome time-gap between frames and achieve better image quality through the proposed algorithm.

A New Adaptive Echo Canceller with an Improved Convergence Speed and NET Detection Performance (향상된 수렴속도와 근달화자신호 검출능력을 갖는 적응반향제기기)

  • 김남선;박상택;차용훈;윤일화;윤대희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.12
    • /
    • pp.12-20
    • /
    • 1993
  • In a conventional adaptive echo canceller, an ADF(Adaptive Digital Filter) with TDL(Tapped-Delay Line) structure modelling the echo path uses the LMS(Least Mean Square) algorithm to compute the coefficients, and NET detector using energy comparison method prevents the ADF to update the coefficients during the periods of the NET signal presence. The convergence speed of the LMS algorithm depends on the eigenvalue spread ratio of the reference signal and NET detector using the energy comparison method yields poor detection performance if the magnitude of the NET signal is small. This paper presents a new adaptive echo canceller which uses the pre-whitening filter to improve the convergence speed of the LMS algorithm. The pre-whitening filter is realized by using a low-order lattice predictor. Also, a new NET signal detection algorithm is presented, where the start point of the NET signal is detected by computing the cross-correlation coefficient between the primary input and the ADF output while the end point is detected by using the energy comparison method. The simulation results show that the convergence speed of the proposed adaptive echo canceller is faster than that of the conventional echo canceller and the cross-correlation coefficient yields more accurate detection of the start point of the NET signal.

  • PDF

Nonlinearity compensation for laser interferometer using adaptive algorithm (적응형 알고리즘에 의한 레이저 간섭계의 비선형성 오차 보정)

  • Lee, Woo-Ram;Hong, Min-Suk;Choi, In-Sung;You, Kwan-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.234-236
    • /
    • 2006
  • Because of its long measurement range and ultra-precise resolution. the heterodyne laser interferometer systems are very common in various industry area such as semiconductor manufacturing. However the periodical nonlinearity property caused from frequency mixing is an obstacle to improve the high measurement accuracy in nanometer scale. In this paper to minimize the effect of nonlinearity, we propose an adaptive nonlinearity compensation algorithm. We first compute compensation parameters using least square (LS) with the capacitance displacement sensor as a reference input. We then update the parameters with recursive LS (RLS) while the values are optimized to modify the elliptical phase into circular one. Through comparison with some experimental results of laser system, we demonstrate the effectiveness of our proposed algorithm.

  • PDF

AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION

  • Asadi, Soodabeh;Mansouri, Hossein;Zangiabadi, Maryam
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.6
    • /
    • pp.1831-1844
    • /
    • 2016
  • In this paper, we improve the full-Newton step infeasible interior-point algorithm proposed by Mansouri et al. [6]. The algorithm takes only one full-Newton step in a major iteration. To perform this step, the algorithm adopts the largest logical value for the barrier update parameter ${\theta}$. This value is adapted with the value of proximity function ${\delta}$ related to (x, y, s) in current iteration of the algorithm. We derive a suitable interval to change the parameter ${\theta}$ from iteration to iteration. This leads to more flexibilities in the algorithm, compared to the situation that ${\theta}$ takes a default fixed value.

Robust Adaptive Nonlinear Control for Tilt-Rotor UAV

  • Yun, Han-Soo;Ha, Cheol-Keun;Kim, Byoung-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.57-62
    • /
    • 2004
  • This paper deals with a waypoint trajectory following problem for the tilt-rotor UAV under development in Korea (TR-KUAV). In this problem, dynamic model inversion based on the linearized model and Sigma-Phi neural network with adaptive weight update are involved to realize the waypoint following algorithm for the vehicle in the helicopter flight mode (nacelle angle=0 deg). This algorithms consists of two main parts: outer-loop system as a command generator and inner-loop system as stabilizing controller. In this waypoint following problem, the position information in the inertial axis is given to the outer-loop system. From this information, Attitude Command/Attitude Hold logic in the longitudinal channel and Rate Command/Attitude Hold logic in the lateral channel are realized in the inner-loop part of the overall structure of the waypoint following algorithm. The nonlinear simulation based on the TR-KUAV is carried out to evaluate the stability and performance of the algorithm. From the numerical simulation results, the algorithm shows very good tracking performance of passing the waypoints given. Especially, it is observed that ACAH/RCAH logic in the inner-loop has the satisfactory performance due to adaptive neural network in spite of the model error coming from the linear model based inversion.

  • PDF

Convergence Analysis of Multiple Constrained Subband Affine Projection Algorithm (다중제한조건을 갖는 부밴드 AP 알고리즘의 수렴해석)

  • Kim, Young-Min;Sohn, Sang-Wook;Choi, Hun;Bae, Hyeon-Deok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.474-476
    • /
    • 2009
  • In the radio communication, such as echo cancellation and channel equalization, adaptive filtering is very practical. Its convergence behavior that is used for updating the weights depends on the correlation of the input signal and length of adaptive filter. Highly correlated input and long length of adaptive filter deteriorate the convergence behavior. To solve this problem, recently, subband affine projection algorithm which pre-whiten the correlation of the input and update the weights in subband structure has been presented. This paper presents convergence analysis method of multiple constrained subband affine projection algorithm.

  • PDF

LSU Message Count Controlled Link State Update Algorithm in QoS Routin (LSU 메시지 수를 제어 가능한 QoS 라우팅 링크 상태 갱신 알고리즘)

  • Cho, Kang-Hong;Kim, Nam-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.75-81
    • /
    • 2012
  • This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

A Robust Adaptive Friction Control of Robot Manipulators using Sliding Surface (슬라이딩 표면을 이용한 로봇 매니퓰레이터의 강건한 적응 마찰 제어)

  • Bae, Jun-Kyung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.11
    • /
    • pp.2139-2146
    • /
    • 2011
  • In this paper, a robust adaptive controller is proposed for trajectory tracking of robot manipulators with the unknown friction coefficient and bounded disturbance. A new adaptive control law is developed based on sliding mode and derived from the Lyapunov stability analysis. The introduction of a boundary layer solves the problem of chattering. The proposed adaptive controller is globally asymptotically stable and guarantees zero steady state error for joint positions. The estimated friction coefficients can also approach the actual coefficients asymptotically. A simulation example is provided to demonstrate the performance of the proposed algorithm.