• Journal of electromagnetic engineering and science
• /
• v.4 no.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.

• 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).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.9
• /
• pp.1058-1064
• /
• 2008

In this paper, we proposed a new hybrid interference canceller using the adaptive filter with Grouped CMA(Constant Modulus Algorithm)-LMS(Least Mean Square) algorithm in the RF(Radio Frequency) repeater. The feedback signal generated from transmitter antenna to receiver antenna reduces the performance of the receiver system. The proposed interference canceller has better channel adaptive performance and a lower MSE(Mean Square Error) than conventional structure because it uses the cancellation method of Grouped CMA algorithm. This structure reduces the number of iterations fur the same MSE performance and hardware complexity compared to conventional nonlinear interference canceller. Namely, MSE values of the proposed algorithm were lower than those of LMS algorithm by 2.5 dB and 4 dB according to step sizes. And the proposed algorithm showed fast speed of convergence and similar MSE performance compared to VSS(Variable Step Size)-LMS algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.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
• /
• v.25 no.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.10a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.88-95
• /
• 2015

This paper presents the study of the efficient localization algorithm for non-linear least square estimation. Although non-linear least square(NLS) estimation algorithms are more accurate algorithms than linear least square(LLS) estimation, NLS algorithms have more computation loads because of iterations. This study proposed the efficient algorithm which reduced complexity for small accuracy loss in NLS estimation. Simulation results show the accuracy and complexity of the localization system compared to the proposed algorithm and conventional schemes.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.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.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• 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.