• The Journal of the Acoustical Society of Korea
• /
• v.38 no.3
• /
• pp.283-289
• /
• 2019

RLS (Recursive-least-squares) algorithm is known to have good convergence and excellent error level after convergence. However, there is a disadvantage that numerical instability is included in the algorithm due to inverse matrix calculation. In this paper, we propose an algorithm with no matrix inversion to avoid the instability aforementioned. The proposed algorithm still keeps the same convergence performance. In the proposed algorithm, we adopt an averaged gradient-based step size as a self-adjusted step size. In addition, a variable forgetting factor is introduced to provide superior performance for time-varying channel estimation. Through simulations, we compare performance with conventional RLS and show its equivalency. It also shows the merit of the variable forgetting factor in time-varying channels.

• Journal of Korea Multimedia Society
• /
• v.8 no.6
• /
• pp.753-760
• /
• 2005

This paper introduces a variable step-size adaptive algorithm for blind source separation. From the frequency characteristics of mixed input signals, we need to adjust the convergence speed regularly in each frequency bin. This algorithm varies a step-size according to the magnitude of input at each frequency bin. This guarantee of the regular convergence in each frequency bin would become more efficient in separation performances than conventional fixed step-size FDICA. Computer simulation results show the improvement of about 5 dB in signal to interference ratio (SIR) and the better separation quality.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.119-124
• /
• 1996

Variable step size LMS(VS-LMS) algorithms improve performance of LMS algorithm by means of varying the step size. This paper presents a new VS-LMS algorithm using normalized absolute estimation error. Normalizing the estimation error to the expected valus of the desired signal, we determined the step size using the relative size of estimation error, Because parameters and computational load are less, our algorithm is easy to implement in hardware. The performance of the proposed algorithm is analyzed theoretically and estimated through simulations. Based on the theoretical analysis and computer simulations, the proposed algorithm is shown to be effective compared to conventional VS-LMS algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.2
• /
• pp.413-426
• /
• 2011

Two types of new methods with variable time steps are proposed in order to valuate binary options efficiently. Type I changes adaptively the size of the time step at each time based on the magnitude of the local error, while Type II combines two uniform meshes. The new methods are hybrid finite difference methods, namely starting the computation with a fully implicit finite difference method for a few time steps for accuracy then performing a ${\theta}$-method during the rest of computation for efficiency. Numerical experiments for standard European vanilla, binary and American options show that both Type I and II variable time step methods are much more efficient than the fully implicit method or hybrid methods with uniform time steps.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.2
• /
• pp.261-267
• /
• 2015

We study backward extensions of 2-variable weighted shifts with finite atomic Berger measure. We provide a necessary and sufficient condition for the subnormality of such extensions. As an application, we give a simple counterexample for the Curto-Muhly-Xia conjecture [10].

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.191-194
• /
• 2000

Frequency domain adaptive filter is effective to communication fields of many computational requirements. In this paper we propose a new variable step size algorithms which improves the convergence speed and reduces computational complexity for frequency domain adaptive filter. we compared MSE of the proposed algorithms with one of normalized FLMS using computer simulation of adaptive noise canceler based on synthesis speech.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.153-156
• /
• 2002

An adaptive predistorr is proposed to compensate for the nonlinear distortion of a high power amplifier (HPA) in 16 QAM system. It fumed out that the proposed predistorter using a variable step-size least mean square (VSSLMS) algorithm is stable and can reduce the Total Distortion (TD) to 0. 1dB at the HPA output backoff=0.0 dB.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.77-82
• /
• 2018

This paper is concerned with the performance analysis of a modified stop-and-go generalized multi-modulus algorithm (MSAG-GMMA) adaptive blind equalization algorithm with variable step size. The proposed algorithm multiplies the fixed step size by the error signal of the decision-oriented algorithm in the equalization coefficient update equation, and changes the step size according to the error size. Also, the MSAG-GMMA having a fixed step size is operated so as to maintain a fast convergence speed from a certain threshold to a steady state by determining the error signal size of the decision-directed algorithm, and when the MSAG-GMMA to work To evaluate the performance of the proposed algorithm, we use the ensemble ISI, ensemble-averaged MSE, and equalized constellation obtained from the output of the equalizer as the performance index. Simulation results show that the proposed algorithm has faster convergence speeds than MMA, GMMA, and MSAG-GMMA and has a small residual error in steady state.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1545-1550
• /
• 2021

We propose an optimal variable step size adjustment method for the simplified subband affine projection algorithm (Simplified SAP; SSAP) in a subband structure based on a polyphase decomposition technique. The proposed method provides an optimal step size derived to minimize the mean square deviation(MSD) at the time of updating the coefficients of the subband adaptive filter. Application of the proposed optimal step size in the SSAP algorithm using colored input signals ensures fast convergence speed and small steady-state error. The results of computer simulations performed using AR(2) signals and real voices as input signals prove the validity of the proposed optimal step size for the SSAP algorithm. Also, the simulation results show that the proposed algorithm has a faster convergence rate and good steady-state error compared to the existing other adaptive algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.72-75
• /
• 1988

Due to the fact that the set point regulation scheme by the variable structure control method concerns only the initial and final locations of a manipulator, many constraints may exist in the application of path tracking with obstracle avoidance. The variable structure parameter should be selected in the trajectory planning step by satisfying the constraints of the travel time and the path deviations This paper presents the selection algorithm of the variable structure parameters with the constraints of the system dynamics and the travel time and the path deviation. This study makes unify the trajectory planning and tracking control using the variable structure control method.