• 제목/요약/키워드: Recursive Least Squares

검색결과 173건 처리시간 0.038초

RLS (Recursive Least Squares)와 RTLS (Recursive Total Least Squares)의 결합을 이용한 새로운 FIR 시스템 인식 방법 (FIR System Identification Method Using Collaboration Between RLS (Recursive Least Squares) and RTLS (Recursive Total Least Squares))

  • 임준석;편용국
    • 한국음향학회지
    • /
    • 제29권6호
    • /
    • pp.374-380
    • /
    • 2010
  • 잡음이 섞인 입출력 신호를 갖는 시스템 인식 문제는 완전 최소 자승법 (Total Least Squares (TLS))으로 알려져 있다. 완전 최소 자승법의 성능은 입력 신호 부가 잡음 파워와 출력 신호 부가 잡음간의 분산비에 매우 민감하다. 본 논문에서는 TLS의 성능 향상을 위해서 LS (Least Squares)와의 결합을 제안한다. 그 한 형태로 재차적인 TLS (Recursive TLS)와 재차적인 LS (Recursive Least Squares)간의 결합 알고리즘을 제안한다. 이 결합은 잡음간 분산비에 강인한 결과를 낳았다. 모의실험을 통해 얻은 결과로부터 입력 신호에 신호대 잡음비가 5dB를 유지히는 잡음을 부가할 경우 입력 잡음과출력 잡음의 비 $\gamma$가 약 20 정도까지로 적용 범위가 확대되는 결과를 얻었다. 따라서 제안된 결합 방법이 기존의 TLS의 적용 범위를 넓힐 수 있음을 알 수 있다.

Adaptive System Identification Using an Efficient Recursive Total Least Squares Algorithm

  • Choi, Nakjin;Lim, Jun-Seok;Song, Joon-Il;Sung, Koeng-Mo
    • The Journal of the Acoustical Society of Korea
    • /
    • 제22권3E호
    • /
    • pp.93-100
    • /
    • 2003
  • We present a recursive total least squares (RTLS) algorithm for adaptive system identification. So far, recursive least squares (RLS) has been successfully applied in solving adaptive system identification problem. But, when input data contain additive noise, the results from RLS could be biased. Such biased results can be avoided by using the recursive total least squares (RTLS) algorithm. The RTLS algorithm described in this paper gives better performance than RLS algorithm over a wide range of SNRs and involves approximately the same computational complexity of O(N²).

A Coupled Recursive Total Least Squares-Based Online Parameter Estimation for PMSM

  • Wang, Yangding;Xu, Shen;Huang, Hai;Guo, Yiping;Jin, Hai
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권6호
    • /
    • pp.2344-2353
    • /
    • 2018
  • A coupled recursive total least squares (CRTLS) algorithm is proposed for parameter estimation of permanent magnet synchronous machines (PMSMs). TLS considers the errors of both input variables and output ones, and thus achieves more accurate estimates than standard least squares method does. The proposed algorithm consists of two recursive total least squares (RTLS) algorithms for the d-axis subsystem and q-axis subsystem respectively. The incremental singular value decomposition (SVD) for the RTLS obtained by an approximate calculation with less computation. The performance of the CRTLS is demonstrated by simulation and experimental results.

An Efficient Recursive Total Least Squares Algorithm for Training Multilayer Feedforward Neural Networks

  • Choi Nakjin;Lim Jun-Seok;Sung Koeng-Mo
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 2004년도 추계학술발표대회논문집 제23권 2호
    • /
    • pp.527-530
    • /
    • 2004
  • We present a recursive total least squares (RTLS) algorithm for multilayer feedforward neural networks. So far, recursive least squares (RLS) has been successfully applied to training multilayer feedforward neural networks. But, when input data contain additive noise, the results from RLS could be biased. Such biased results can be avoided by using the recursive total least squares (RTLS) algorithm. The RTLS algorithm described in this paper gives better performance than RLS algorithm over a wide range of SNRs and involves approximately the same computational complexity of $O(N^{2})$.

  • PDF

비스듬히 던진 물체의 공기저항을 고려한 재귀 최소 자승법 기반 실시간 포물선 운동 궤적 추정 (Real-time Projectile Motion Trajectory Estimation Considering Air Resistance of Obliquely Thrown Object Using Recursive Least Squares Estimation)

  • 정상윤;좌동경
    • 전기학회논문지
    • /
    • 제67권3호
    • /
    • pp.427-432
    • /
    • 2018
  • This paper uses a recursive least squares method to estimate the projectile motion trajectory of an object in real time. The equations of motion of the object are obtained considering the air resistance which occurs in the actual experiment environment. Because these equations consider air resistance, parameter estimation of nonlinear terms is required. However, nonlinear recursive least squares estimation is not suitable for estimating trajectory of projectile in that it requires a lot of computation time. Therefore, parameter estimation for real-time trajectory prediction is performed by recursive least square estimation after using Taylor series expansion to approximate nonlinear terms to polynomials. The proposed method is verified through experiments by using VICON Bonita motion capture system which can get three dimensional coordinates of projectile. The results indicate that proposed method is more accurate than linear Kalman filter method based on the equations of motion of projectile that does not consider air resistance.

완전최소자승법을 이용한 잡음환경하에서 시스템의 적응 역 모델링 (Adaptive Inverse Modelling of Noisy System by Total Least Squares)

  • 황재섭
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1991년도 학술발표회 논문집
    • /
    • pp.23-27
    • /
    • 1991
  • RLS(Recursive Least Squares)나 LMS(Least mean square)등은 알고리듬 고유의 성질상 잡음이 섞인 시스템에 있어서는 올바른 역 모델링을 할 수 없다. 따라서, 잡음의 영향을 받지않는 견실한(robust) 모델 추정 알고리듬이 필요하다. 본 논문에서는 잡음환경하에 있는 시스템을역 모델링하는데 있어서, 잡음의 영향을 줄이기위해 완전최소자승법을 도입하고 기존의 최소자승법과 비교 실험하였다. 그리고, 이 방법의 적응 알고리듬을 제안하였으며, RLS(Recursive least squares)와 그 성능을 비교하여 타당성을 검토하였다.

  • PDF

반복형 위너 필터 방법에 기반한 재귀적 완전 최소 자승 알고리즘의 견실화 연구 (A study on robust recursive total least squares algorithm based on iterative Wiener filter method)

  • 임준석
    • 한국음향학회지
    • /
    • 제40권3호
    • /
    • pp.213-218
    • /
    • 2021
  • 입력과 출력에 동시에 잡음이 존재하는 경우 최소 자승법 보다는 완전 최소 자승법이 더 우수한 추정 성능을 보인다는 것이 알려져 있다. 완전 최소 자승법을 시계열 특성을 가지는 데이터에 적용할 경우 보다 실시간 성을 더하기 위해서 Recursive Total Least Squares(RTS) 알고리즘이 제안되어 있다. RTLS는 알고리즘 내에 존재하는 역행렬 계산에서 수치적인 불안정성을 지닌다. 본 논문에서는 RTLS와 유사한 수렴성을 지닐 뿐만 아니라 수치적 불안정성을 줄이기 위한 알고리즘을 제안한다. 이 알고리즘을 위해서 Iterative Wiener Filter(IWF)를 적용한 새로운 RTLS를 제안한다. 시뮬레이션을 통해서 수렴성이 기존의 RTLS와 유사할 뿐만 아니라 수치적 견실성이 기존 RTLS보다 향상되었다는 것을 보인다.

QR 분해법을 이용한 적응 쌍선형 격자 알고리듬 (QR-Decomposition based Adaptive Bbilinear Lattice Algorithms)

  • 안봉만;황지원;백흥기
    • 전자공학회논문지B
    • /
    • 제31B권10호
    • /
    • pp.32-43
    • /
    • 1994
  • This paper presents new QRD-based recursive least squares algorithms for bilinear lattice filter. Bilinear recursive least square lattice algorithms are derived by using the QR decomposition for minimization covariance matrix of predication error by applying Givens rotation to the bilinear recursive least squares lattics algorithms. The proposed algorithms are applied to the bilinear system identification to evaluate the performance of algoithms. Computer simulations show that the convergence properties of the proposed algorithms are superior to that of the algorithms proposed by Baik when signal includes the measurement noise.

  • PDF

Least-squares Lattice Laguerre Smoother

  • Kim, Dong-Kyoo;Park, Poo-Gyeon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.1189-1191
    • /
    • 2005
  • This paper introduces the least-squares order-recursive lattice (LSORL) Laguerre smoother that has order-recursive smoothing structure based on the Laguerre signal representation. The LSORL Laguerre smoother gives excellent performance for a channel equalization problem with smaller order of tap-weights than its counterpart algorithm based on the transversal filter structure. Simulation results show that the LSORL Laguerre smoother gives better performance than the LSORL transversal smoother.

  • PDF

A New Recursive Least-Squares Algorithm based on Matrix Pseudo Inverses (ICCAS 2003)

  • Quan, Zhonghua;Han, Soo-Hee;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.927-931
    • /
    • 2003
  • In this paper, a new Recursive Least-Squares(RLS) algorithm based on matrix pseudo-inverses is presented. The aim is to use the proposed new RLS algorithm for not only the over-determined but also the under-determined estimation problem. Compared with previous results, e.g., Jie Zhou et al., the derivation of the proposed recursive form is much easier, and the recursion form is also much simpler. Furthermore, it is shown by simulations that the proposed RLS algorithm is more efficient and numerically stable than the existing algorithms.

  • PDF