• 제목/요약/키워드: Differential forgetting factor

검색결과 3건 처리시간 0.02초

다중 재귀 최소 자승 추정 알고리즘 기반 모빌리티의 회전체 건전성 모니터링 방법 개발 (Development of a Method for Health Monitoring of Rotating Object for Mobility based on Multiple RLS Algorithm)

  • 라한별;이지웅;오광석
    • 자동차안전학회지
    • /
    • 제16권2호
    • /
    • pp.51-59
    • /
    • 2024
  • This study presents a method for health monitoring of rotating objects for mobility based on multiple recursive least squares(RLS) algorithms. The performance degradation of the rotating objects causes low handing / low driving performances and even fatal accidents. Therefore, health monitoring algorithm of rotating objects is one of the important technologies for mobility fail-safe and maintenance areas. In order for health monitoring of rotating objects, four recursive least squares algorithms with forgetting factor were designed in this study. The health monitoring algorithm proposed in this study consists of two steps such as uncertainty estimation and parameter changes estimation. In order to improve estimation accuracy, time delay function was applied to the estimated signals based on the first order differential equation and forgetting factors used for the RLS were reasonably tuned. The health monitoring algorithm was constructed in Matlab/Simulink environment and simulation-based performance evaluation was conducted using DC motor model. The evaluation results showed that the proposed algorithm estimates the actual parameter differences reasonably using velocity and current information.

연속시간 하중최소자승 식별기의 최소고우치 결정 (Determination of Minimum Eigenvalue in a Continuous-time Weighted Least Squares Estimator)

  • Kim, Sung-Duck
    • 대한전기학회논문지
    • /
    • 제41권9호
    • /
    • pp.1021-1030
    • /
    • 1992
  • When using a least squares estimator with exponential forgetting factor to identify continuous-time deterministic system, the problem of determining minimum eigenvalue is described in this paper. It is well known fact that the convergence rate of parameter estimates relies on various factors consisting of the estimator and especially, theirproperties can be directly affected by all eigenvalues in the parameter error differential equation. Fortunately, there exists only one adjusting eigenvalue in the given estimator and then, the parameter convergence rates depend on this minimum eigenvalue. In this note, a new result to determine the minimum eigenvalue is proposed. Under the assumption that the input has as many spectral lines as the number of parameter estimates, it can be proven that the minimum eigenvalue converges to a constant value, which is a function of the forgetting factor and the parameter estimates number.

  • PDF

Efficient Noise Estimation for Speech Enhancement in Wavelet Packet Transform

  • Jung, Sung-Il;Yang, Sung-Il
    • The Journal of the Acoustical Society of Korea
    • /
    • 제25권4E호
    • /
    • pp.154-158
    • /
    • 2006
  • In this paper, we suggest a noise estimation method for speech enhancement in nonstationary noisy environments. The proposed method consists of the following two main processes. First, in order to receive fewer affect of variable signals, a best fitting regression line is used, which is obtained by applying a least squares method to coefficient magnitudes in a node with a uniform wavelet packet transform. Next, in order to update the noise estimation efficiently, a differential forgetting factor and a correlation coefficient per subband are used, where subband is employed for applying the weighted value according to the change of signals. In particular, this method has the ability to update the noise estimation by using the estimated noise at the previous frame only, without utilizing the statistical information of long past frames and explicit nonspeech frames by voice activity detector. In objective assessments, it was observed that the performance of the proposed method was better than that of the compared (minima controlled recursive averaging, weighted average) methods. Furthermore, the method showed a reliable result even at low SNR.