• Title/Summary/Keyword: Recursive Least Squares (RLS) Algorithm

Search Result 52, Processing Time 0.022 seconds

Development of the structural health record of containment building in nuclear power plant

  • Chu, Shih-Yu;Kang, Chan-Jung
    • Nuclear Engineering and Technology
    • /
    • v.53 no.6
    • /
    • pp.2038-2045
    • /
    • 2021
  • The main objective of this work is to propose a reliable routine standard operation procedures (SOP) for structural health monitoring and diagnosis of nuclear power plants (NPPs). At present, NPPs have monitoring systems that can be used to obtain the quantitative health record of containment (CTMT) buildings through system identification technology. However, because the measurement signals are often interfered with by noise, the identification results may introduce erroneous conclusions if the measured data is directly adopted. Therefore, this paper recommends the SOP for signal screening and the required identification procedures to identify the dynamic characteristics of the CTMT of NPPs. In the SOP, three recommend methods are proposed including the Recursive Least Squares (RLS), the Observer Kalman Filter Identification/Eigensystem Realization Algorithm (OKID/ERA), and the Frequency Response Function (FRF). The identification results can be verified by comparing the results of different methods. Finally, a preliminary CTMT healthy record can be established based on the limited number of earthquake records. It can be served as the quantitative reference to expedite the restart procedure. If the fundamental frequency of the CTMT drops significantly after the Operating Basis Earthquake and Safe Shutdown Earthquake (OBE/SSE), it means that the restart actions suggested by the regulatory guide should be taken in place immediately.

A Study on the Recursive Identification of Modal Parameters (회귀적 방법에 의한 모우드 변수 규명에 관한 연구)

  • 고장욱;이재응
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.04a
    • /
    • pp.147-152
    • /
    • 1995
  • 실험에 의한 모우드 해석 방법들은 1980년대부터 활발히 연구되어 많은 새로운 방법들이 개발되어 발표되었다. 그러나 개발된 대부분의 방법들은 측정된 데이타를 일괄처리하는 밸치(또는 off-line) 방법들이다. 최근에는 시간에 따라서 변하는 구조물의 동특성을 규명하는 분야에 모우드 해석 방법이 응용되어 사용되고 있다. 이러한 응용분야에서는 모우드 변수들의 변화되는 값을 새로운 데이타가 샘플링 될 때마다 그 값들을 수정하면서 추정할 수 있는 회귀적인(recursive 또는 on-line) 방법을 사용하여야 한다. Davies와 Hammond[1]는 회귀적 선형 자승법(Recursive Least Squares : RLS)을 이용하여 모우드 변수를 구하고 이를 벧치방법인 Instrumental Variable 방법과 Fourier 방법의 결과와 비교하였다. 그러나, 그 결과에서 보여준것처럼 RLS 방법은 잡음 대 시호비가 낮을 때에만 모우드 변수 값들을 정확하게 추정할 수 있었다. Sundararajan과 Montgomrey[2]는 회귀적 선형 최소자승 격자필터(lattice filter)를 이용하여 구조물의 차수(order)와 고유진동형, 그리고 진폭을 결정한 후 이를 토대로 회귀적 gradient형태의 방정식 오차 규명 방법(equation-error identification algorithm)에 의하여 모우드 변수들을 추정하였다. 이 방법은 2차원 격자구조물의 모우드 변수 추정에 사용되었으며, 또한 적응모우드제어에도 성공적으로 이용되었다. 그러나, 이 방법도 잡음 대 신호비가 낮은 환경에서만 사용할 수 있다는 단점이 있다. 위에서 언급한 방법들은 모두 RLS 방법을 기초로 하여 개발되었으나, RLS 방법은 전형적인 결정적(deterministic)방법으로서 잡음이 섞인 데이타를 처리하기에는 부적절한 방법임이 널리 알려진 사실이다[3]. 최근에 Ben Mrad와 Fassois[4]는 신호에 잡음이 존재하여도 이를 잘 처리할 수 있는 확률적(stochastic) 방법을 개발하여 기존의 결정적 방법들과 그 결과를 비교하였다. 그러나, 개발된 방법은 응답 신호에 백색잡음(white noise)이 섞이는 특수한 경우에만 사용할 수 있게 만들어져서 이 방법의 실질적인 적용에는 어려움이 있다. 본 연구에서는 기존의 방법들의 단점을 극복할 수 있는 새로운 회귀적 모우드 변수 규명 방법을 개발하였다. 이는 Fassois와 Lee가 ARMAX모델의 계수를 효율적으로 추정하기 위하여 개발한 뱉치방법인 Suboptimum Maximum Likelihood 방법[5]를 기초로 하여 개발하였다. 개발된 방법의 장점은 응답 신호에 유색잡음이 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.

  • PDF

Frequency-Domain RLS Algorithm Based on the Block Processing Technique (블록 프로세싱 기법을 이용한 주파수 영역에서의 회귀 최소 자승 알고리듬)

  • 박부견;김동규;박원석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.240-240
    • /
    • 2000
  • This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

  • PDF

Nonlinear Lattice Algorithms using QRD and Channel Decomposition (QR 분해와 채널 분해법을 이용한 비선형 격자 알고리듬)

  • 안봉만;백흥기
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.10
    • /
    • pp.1326-1337
    • /
    • 1995
  • In this paper, we transformed the bilinear filter into an equivalent linear multichannel filter and derived QR decomposition based recursive least squares algorithms for bilinear lattice filters. We also defined order update relation of the forward and the backward input vectors by using the channel decomposition. The forward and the backward data matrices were defined by using the forward and the backward input vectors and orthogonalized with the QR decomposition. we can obtain the lattice equations of the bilinear filters by using the channel decomposition. we can be derived the lattice equations of the bilinear filters using this decomposition process which are the same as the lattice equations derived by Baik, we can use the coefficient transformation algorithm proposed by Baik. We derived the equation error and the output error algorithm of the QRD based RLS bilinear lattice algorithm. Also, we evaluated the performance of the proposed algorithms through the system identification of the bilinear system.

  • PDF

Number Plate Detection System by Using the Night Images

  • Yoshimori, S.;Mitsukura, Y.;Fukumi, M.;Akamatsu, N.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1249-1253
    • /
    • 2003
  • License plate recognition is very important in an automobile society. This is because, since plate detection accuracy has large influence on subsequent number recognition, it is very important. However, it is very difficult to do it, because a background and a body color of cars are similar to that of the license plate. In this paper, we propose a new thresholds determination method in the various background by using the real-coded genetic algorithm (RGA). By using RGA, the most likely plate colors are decided under various lighting conditions. First, the average brightness Y values of images are calculated. Next, relationship between the Y value and the most likely plate color thresholds (upper and lower bounds)are obtained by RGA. The relationship between thresholds decided from RGA and brightness average is aproximate by using the recursive least squares (RLS) algorithm. In the case of plate detection, thresholds are decided from these functions.

  • PDF

Identification of DC-Link Capacitance for Single-Phase AC/DC PWM Converters

  • Pu, Xing-Si;Nguyen, Thanh Hai;Lee, Dong-Choon;Lee, Suk-Gyu
    • Journal of Power Electronics
    • /
    • v.10 no.3
    • /
    • pp.270-276
    • /
    • 2010
  • In this paper, a capacitance estimation scheme for DC-link capacitors for single-phase AC/DC PWM converters is proposed. Under the no-load condition, a controlled AC current (30[Hz]) is injected into the input side, which then causes AC voltage ripples at the DC output side. Or, a controlled AC voltage can be directly injected into the DC output side. By extracting the AC voltage/current and power components on the DC output side using digital filters, the capacitance value can be calculated, where the recursive least squares (RLS) algorithm is used. The proposed methods can be simply implemented with software only and additional hardware is not required. From the experiment results, a high accuracy estimation of capacitances less than 0.85% has been obtained.

Adaptive Control of A One-Link Flexible Robot Manipulator (유연한 로보트 매니퓰레이터의 적응제어)

  • 박정일;박종국
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.5
    • /
    • pp.52-61
    • /
    • 1993
  • This paper deals with adaptive control method of a robot manipulator with one-flexible link. ARMA model is used as a prediction and estimation model, and adaptive control scheme consists of parameter estimation part and adaptive controller. Parameter estimation part estimates ARMA model's coefficients by using recursive least-squares(RLS) algorithm and generates the predicted output. Variable forgetting factor (VFF) is introduced to achieve an efficient estimation, and adaptive controller consists of reference model, error dynamics model and minimum prediction error controller. An optimal input is obtained by minimizing input torque, it's successive input change and the error between the predicted output and the reference output.

  • PDF

Mean Square Projection Error Gradient-based Variable Forgetting Factor FAPI Algorithm (평균 제곱 투영 오차의 기울기에 기반한 가변 망각 인자 FAPI 알고리즘)

  • Seo, YoungKwang;Shin, Jong-Woo;Seo, Won-Gi;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.177-187
    • /
    • 2014
  • This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

Estimation of ESR in the DC-Link Capacitors of AC Motor Drive Systems with a Front-End Diode Rectifier

  • Nguyen, Thanh Hai;Le, Quoc Anh;Lee, Dong-Choon
    • Journal of Power Electronics
    • /
    • v.15 no.2
    • /
    • pp.411-418
    • /
    • 2015
  • In this paper, a new method for the online estimation of equivalent series resistances (ESR) of the DC-link capacitors in induction machine (IM) drive systems with a front-end diode rectifier is proposed, where the ESR estimation is conducted during the regenerative operating mode of the induction machine. In the first place, a regulated AC current component is injected into the q-axis current component of the induction machine, which induces the current and voltage ripple components in the DC-link. By processing these AC signals through digital filters, the ESR can be estimated by a recursive least squares (RLS) algorithm. To acquire the AC voltage across the ESR, the DC-link voltage needs to be measured at a double sampling frequency. In addition, the ESR current is simply reconstructed from the stator currents and switching states of the inverter. Experimental results have shown that the estimation error of the ESR is about 1.2%, which is quite acceptable for condition monitoring of the capacitor.

Transform Domain Active Noise Control for Broadband Noise (광대역 소음의 변환영역 능동소음제어)

  • Kim, Jong-Boo;Lee, Tae-Pyo;Yim, Kook-Hyun
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.35T no.2
    • /
    • pp.48-55
    • /
    • 1998
  • The main drawback of filtered-X LMS(FXLMS) algorithm for the ANC of broadband noises is its low convergence speed when the filtered reference signals are strongly correlated, producing a large eigenvalue ratio in correlation matrix. This correlation can be caused either by autocorrelation of the signals of the reference sensors, or by coupling between the error path which introduces intercorrelation in the filtered reference signals. In this paper, we introduce a transform domain FXLMS(TD-FXLMS) algorithm that has a high convergence speed by orthogonal transform's decorrelation properties.

  • PDF