• Journal of electromagnetic engineering and science
• /
• 제4권2호
• /
• pp.93-96
• /
• 2004

In this paper we introduce a new escalator(ESC) structure-based adaptation algorithm. The proposed algorithm is independent of eigenvalues spread ratio(ESR) of channel and has faster convergence speed than that of the conventional ESC algorithms. This algorithm combines the fast adaptation ability of least square methods and the orthogonalization property of the ESC structure. From the simulation results the proposed algorithm shows superior convergence speed and no slowing down of convergence speed when we increase the ESR of the channel.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 추계학술대회 논문집 전력기술부문
• /
• 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).

• 한국전자파학회논문지
• /
• 제19권9호
• /
• pp.1058-1064
• /
• 2008

본 논문에서는 RF(Radio Frequency) 중계기에서 그룹화 CMA(Constant Modulus Algorithm)와 LMS(Least Mean Square) 알고리즘을 이용하여 적응 필터를 적용시킨 새로운 혼합 간섭 제거기를 제안한다. 송신 안테나에서 수신안테나로 궤환되는 신호는 수신 시스템의 성능을 저하시킨다. 제안한 간섭 제거기는 그룹화 CMA 알고리즘 간섭 제거 기법을 적용시키기 때문에 기존 구조보다 나은 채널 적응 성능과 낮은 MSE(Mean Square Error)을 가진다. 이 구조는 기존 비선형 간섭 제거기에 비해 같은 MSE(Mean Square Error)에 대한 반복수와 하드웨어 복잡도를 줄여준다. 즉, 제안한 알고리즘은 LMS 알고리즘에 비해 평균 자승 에러가 적응 상수에 따라 2.5 dB 또는 4 dB 정도 낮은 값을 보였다. 또한, VSS(Variable Step Size)-LMS 알고리즘에 비해 수렴 속도가 빠르고, 비슷한 평균 자승 에러를 가진다.

• 한국정밀공학회지
• /
• 제20권11호
• /
• pp.100-107
• /
• 2003

This paper represents a disturbance compensation control for attenuating disturbance responses. In the consideration of the requirements on the model accuracy in the model based compensator designs, an experimental feed forward compensator design based on adaptive estimation by Filtered-x least mean square (FXLMS) algorithm is proposed. The convergence properties of the FXLMS algorithm are discussed and its conditions for the asymptotic convergence are derived theoretically. The effectiveness of the proposed method and the theoretical proof are verified by computer simulation.

• The Journal of the Acoustical Society of Korea
• /
• 제25권2E호
• /
• pp.43-48
• /
• 2006

Abstract-Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. Simulations demonstrate that DLS outperforms ordinary least square for certain types of deconvolution problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1379-1382
• /
• 1997

We introduce a fast implementation of the adaptive transversal filter which uses least-mean-square(LMS) algorithm. The fast Hadamard transform(FHT) is used for the implementation of the filter. By using the proposed filter we can get the significant time reduction in computatioin over the conventional time domain LMS filter at the cost of a little performance. By computer simulation, we show the comparison of the propsed Hadamard-domain filter and the time domain filter in the view of multiplication time, mean-square error and robustness for noise.

• 한국통신학회논문지
• /
• 제25권5B호
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• 한국통신학회논문지
• /
• 제40권1호
• /
• pp.88-95
• /
• 2015

본 논문은 비선형적 최소제곱법을 위한 효율적인 위치추정기법 연구를 하였다. 비선형적 최소제곱 방식은 선형적 최소제곱 방식에 비해 정확도가 높으며 거리 오차에 대해서 보다 강인한 추세를 보이지만 회기적인 방법을 취하기 때문에 계산 량이 매우 많아지는 단점이 있다. 본 논문에서는 비선형적 최소제곱 위치 추정 방식인 Newton method와 Levenberg-Marquardt 방식을 이용하였을 때 추정 위치 정확도와 복잡도 간의 기회비용 관점에서 효율적인 알고리즘을 제시하여 계산 량을 줄이면서 성능 열화를 방지할 수 있는 기법을 제시하였다. 시뮬레이션 결과로 추정 위치 정확도와 회기(iteration) 횟수를 구하고 선형적 방식의 위치 추정 성능, 기존의 비선형적 방식, 제안한 방식에 대해 비교 분석하여 제안한 알고리즘을 검증하였다.

• The Journal of the Acoustical Society of Korea
• /
• 제23권4E호
• /
• pp.103-107
• /
• 2004

In this Paper, we propose an algorithm called partitioned recursive least square (PRLS) that involves a procedure that partitions a large data matrix into small matrices, applies RLS scheme in each of the small sub matrices and assembles the whole size estimation vector by concatenation of the sub-vectors from RLS output of sub matrices. Thus, the algorithm should be less complex than the conventional RLS and maintain an almost compatible estimation performance.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.285-289
• /
• 1988

This paper suggests the way to improve the impulse response characteristics in 1-D and 2-D FIR digital filters design. The proposed a Least Square($L_2$) error algorithm of kaiser window is the better than $L_2$ error of the Remez Exchange(R.E.)algorithm.