• Title/Summary/Keyword: RLS algorithm

Search Result 178, Processing Time 0.033 seconds

A new blind adaptive method using RLS algorithm with Decision direction method

  • Kwon, Tae-song;Yoo, Sung-kyun;Kwak, Kyung-sup
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1586-1589
    • /
    • 2002
  • RLS algorithm is a kind of the adaptive algorithms in smart antennas and adapts the weight vector using the difference between the output signal of array antennas and the known training sequence. In this paper, we propose a new algorithm based on the RLS algorithm. It calculates the error signal with reference signal derived from blind scheme. Simulation results show that the proposed algorithm yields more user capacity by 67∼74% than other blind adaptive algorithms(LS-DRMTA, LS-DRMTCMA) at the same BER and the beamformer forms null beams toward interference signals and the main beam toward desired signal.

  • PDF

A Systolic Array Structured Decision Feedback Equalizer based on Extended QR-RLS Algorithm (확장 QR-RLS 알고리즘을 이용한 시스토릭 어레이 구조의 결정 궤환 등화기)

  • Lee Won Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11C
    • /
    • pp.1518-1526
    • /
    • 2004
  • In this paper, an algorithm using wavelet transform for detecting a cut that is a radical scene transition point, and fade and dissolve that are gradual scene transition points is proposed. The conventional methods using wavelet transform for this purpose is using features in both spatial and frequency domain. But in the proposed algorithm, the color space of an input image is converted to YUV and then luminance component Y is transformed in frequency domain using 2-level lifting. Then, the histogram of only low frequency subband that may contain some spatial domain features is compared with the previous one. Edges obtained from other higher bands can be divided into global, semi-global and local regions and the histogram of each edge region is compared. The experimental results show the performance improvement of about 17% in recall and 18% in precision and also show a good performance in fade and dissolve detection.

An Improved RLS Algorithm Using A Subband Decomposition (서브밴드 분해를 이용한 개선된 RLS 알고리즘)

  • 주상영;이동규;이두수
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.73-76
    • /
    • 2000
  • 본 논문에서는 음향반향제거기를 구현하기 위한 적응알고리즘을 제안한다 특히 긴 임펄스 응답을 가지는 시스템의 식별을 위해 웨이블릿 필터를 사용하여 입력신호를 서브밴드로 분해함으로써 기존의 RLS알고리즘의 계산량을 줄여 수렴속도를 향상시켰다. 이 과정에서 적응필터를 다위상 구조로 구성하여 컨벌루션 과정을 병렬처리가 가능하도록 하였다. 제안된 알고리즘의 성능분석을 위하여 실제 음성신호를 입력신호로 하여 컴퓨터 모의실험을 수행하였으며 전대역 RLS알고리즘과 비교하였다.

  • PDF

Implementation of Speed Sensorless Induction Motor drives by Fast Learning Neural Network using RLS Approach

  • Kim, Yoon-Ho;Kook, Yoon-Sang
    • Proceedings of the KIPE Conference
    • /
    • 1998.10a
    • /
    • pp.293-297
    • /
    • 1998
  • This paper presents a newly developed speed sensorless drive using RLS based on Neural Network Training Algorithm. The proposed algorithm has just the time-varying learning rate, while the wellknown back-propagation algorithm based on gradient descent has a constant learning rate. The number of iterations required by the new algorithm to converge is less than that of the back-propagation algorithm. The theoretical analysis and experimental results to verify the effectiveness of the proposed control strategy are described.

  • PDF

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

  • Quan, Zhonghua;Han, Soo-Hee;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • 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

Gauss Newton Variable forgetting factor RLS algorithm for Time Varying Parameter Estimation. (Gauss Newton Variable Forgetting Factor Recursive Least Squares 알고리듬을 이용한 시변 신호 추정)

  • Song Seongwook;Lim Jun-Seok;Sung Koeng-Mo
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.173-176
    • /
    • 2000
  • 시변 신호 추적 특성을 향상시키기 위하여, Gauss-Newton Variable Forgetting Factor RLS (GN-VFF-RLS) Algorithm을 제안한다. 최적화된 망각인자를 가정한 기존의 RLS 알고리듬과 비교하여, 제안된 방법은 특히 신호의 변화가 급격히 일어날 경우 주목할만한 추정 성능의 향상을 보여준다. 제안된 알고리듬의 시변 추정 특성을 신호 대 잡음비와 시변 정도에 대하여 모의 실험하고 기존의 추정 알고리듬들과 비교한다.

  • PDF

Estimation of Voltage Instability Index Using RLS(Recursive Least Square) (RLS(Recursive Least Square)를 이용한 전압안정도 지수 평가)

  • Jeon, Woong-Jae;Lee, Byong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2006.11a
    • /
    • pp.279-281
    • /
    • 2006
  • A Voltage Instability Predictor(VIP) estimates the proximity of a power system to voltage collapse in real time. Voltage Instability Index(Z-index) from VIP algorithm is estimated using LS(Least Square) method. But this method has oscillations and noise of result due to the system's changing conditions. To suppress oscillations, a larger data window needs to be used. In this paper. I propose the new other method which improves that weakness. It uses RLS(Recursive Least Square) to estimate voltage instability index without a large moving data window so this method is suitable for on-line monitor and control in real time. In order to verify effectiveness of the algorithm using RLS method, the method is tested on HydroQuebec system in real time digital simulator(HYPERSIM).

  • PDF

RLS Adaptive IIR Filters Based on Equation Error Methods Considering Additive Noises

  • Muneyasu, Mitsuji;Kamikawa, Hidefumi;Hinamoto, Takao
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.215-218
    • /
    • 2000
  • In this paper, a new algorithm for adaptive IIR filters based on equation error methods using the RLS algorithm is proposed. In the proposed algorithm, the concept of feedback of the scaled output error proposed by tin and Unbehauen is employed and the forgetting factor is varied in adaptation process for avoiding the accumulation of the estimation error for additive noise . The proposed algorithm has the good convergence property without the parameter estimation error under the existence of mea-surement noise.

  • PDF

Kernel RLS Algorithm Using Variable Forgetting Factor (가변 망각인자를 사용한 커널 RLS 알고리즘)

  • Lim, Jun-Seok;Pyeon, Yong-Guk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1793-1801
    • /
    • 2015
  • In a recent work, kernel recursive least-squares tracker (KRLS-T) algorithm has been proposed. It is capable of tracking in non-stationary environments using a forgetting mechanism built on a Bayesian framework. The forgetting mechanism in KRLS-T is implemented by a fixed forgetting factor. In practice, however, we frequently meet that the fixed forgetting factor cannot handle time-varying system effectively. In this paper we propose a new KRLS-T with a variable forgetting factor. Experimental results show that proposed algorithm can handle time-varying system more effectively than the KRLS-T.

Two regularization constant selection methods for recursive least squares algorithm with convex regularization and their performance comparison in the sparse acoustic communication channel estimation (볼록 규준화 RLS의 규준화 상수를 정하기 위한 두 가지 방법과 희소성 음향 통신 채널 추정 성능 비교)

  • Lim, Jun-Seok;Hong, Wooyoung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.5
    • /
    • pp.383-388
    • /
    • 2016
  • We develop two methods to select a constant in the RLS (Recursive Least Squares) with the convex regularization. The RLS with the convex regularization was proposed by Eksioglu and Tanc in order to estimate the sparse acoustic channel. However the algorithm uses the regularization constant which needs the information about the true channel response for the best performance. In this paper, we propose two methods to select the regularization constant which don't need the information about the true channel response. We show that the estimation performance using the proposed methods is comparable with the Eksioglu and Tanc's algorithm.