• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.17-21
• /
• 2002

Least mean square(LMS) algorithm one of the most popular algorithm in adaptive signal processing because of the simplicity and the small computation. But the convergence speed of time domain adaptive algorithm is slow when the spread width of eigen values is wide. Moreover we have to choose the step size well for convergency. in this paper, ie use adaptive algorithm of wavelet transform. And we propose a new wavelet based adaptive algorithm of wavelet transform. And we propose a high speed wavelet based adaptive algorithm with variable step size, which is linear to absolute value of error signal. We applied this algorithm to adaptive noise canceler. Simulation results are presented to compare the performance of the proposed algorithm with the usual algorithms.

• Journal of Power Electronics
• /
• v.15 no.6
• /
• pp.1619-1627
• /
• 2015

This paper presents a power system harmonic elimination using the mixed adaptive linear neural network and variable step-size leaky least mean square (ADALINE-VSSLLMS) control algorithm based active power filter (APF). The weight vector of ADALINE along with the variable step-size parameter and leakage coefficient of the VSSLLMS algorithm are automatically adjusted to eliminate harmonics from the distorted load current. For all iteration, the VSSLLMS algorithm selects a new rate of convergence for searching and runs the computations. The adopted shunt-hybrid APF (SHAPF) consists of an APF and a series of 7^th tuned passive filter connected to each phase. The performance of the proposed ADALINE-VSSLLMS control algorithm employed for SHAPF is analyzed through a simulation in a MATLAB/Simulink environment. Experimental results of a real-time prototype validate the efficacy of the proposed control algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.27-32
• /
• 2021

This paper evaluates the equalization performance of FC-MMA adaptive equalization algorithm by the fixed step size that is used for the minimization of the intersymbol interference which occurs in the time dispersive communication channel. The FC-MMA has a fast convergence speed in order to adapts the new environment more rapidly in case of the time varying charateristics and the abnormal situation like as outage of the communication channel. But the algorithms operates in adative method, convegence speed is depend on fixed step size for adaptation. For this situation, its performance was evaluated by changing the step size value, the residual isi and maximum distortion and MSE performance index which means the convergence characteristics are widely adapted in the adaptive equalizer, SER were applied. As a result of computer simulation, the large step size can improves the convergence speed for reaching the steady state, but has a poor performance compared to small step size in residual values after steady state. The research result shows that the FC-MMA algorithm is applied the large step size for rapidly reaching the steady state in initial time, then adjust the small step size after reaching the steady state for reducing the residual values for equalization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.305-311
• /
• 2008

In this paper, we proposed an algorithm for adaptive noise cancellation (ANC) using the variable step size normalized least mean square (VSSNLMS) in real-time automobile environment. As a basic algorithm for ANC, the LMS algorithm has been used for its simplicity. However, the LMS algorithm has problems of both convergence speed and estimation accuracy in real-time environment. In order to solve these problems, the VSSLMS algorithm for ANC is considered in nonstationary environment. By computer simulation using real-time data acquisition system(USB 6009), VSSNLMS algorithm turns out to be more effective than the LMS algorithm in both convergence speed and estimation accuracy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.67-72
• /
• 2019

This paper evaluates the performance of CCA (Compact Constellation Algorithm) adaptive equalization algorithm by varying the step size for minimization of the distortion effect in the communication channel. The CCA combines the conventional DDA and RCA algorithm, it uses the constant modulus of the transmission signal and the considering the output of decision device by the power of compact slice weighting value in order to improving the initial convergence characteristics and the equalization noise by misadjustment in the steady state. In this process, the compact slice weight values were fixed, and the performance of CCA adaptive equalization algorithm was evaluated by the varing the three values of step size for adaptation. As a result of computer simulation, it shows that the smaller step size gives slow convergence speed, but gives excellent performance after at steady state. Especially in SER performance, the small step size gives more robustness that large values.

• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.99-108
• /
• 1999

In this paper, a new robust adaptive algorithm is proposed to improve the performance of AEC without computational burden. The proposed adaptive algorithm is based on NLMS algorithm, and its step-size is varied with the reference input signal power and the desired signal power. Its step-size is normalized by the sum of the powers of the reference input signal and the desired signal. When the near-end speaker's speech and noise are applied into the microphone, the step-size becomes small and the misalignment of coefficients are reduced. The convergence speed is comparable to NLMS algorithm at AEC application because the echo signals are attenuated about 10∼20 dBSPL. The characteristics of this algorithm is also analyzed and compared with conventional ones in this paper.

• Atmosphere
• /
• v.33 no.4
• /
• pp.331-341
• /
• 2023

A numerical forecasting models usually predict future states by performing time integration considering fixed static time-steps. A time-step that is too long can cause model instability and failure of forecast simulation, and a time-step that is too short can cause unnecessary time integration calculations. Thus, in numerical models, the time-step size can be determined by the CFL (Courant-Friedrichs-Lewy)-condition, and this condition acts as a necessary condition for finding a numerical solution. A static time-step is defined as using the same fixed time-step for time integration. On the other hand, applying a different time-step for each integration while guaranteeing the stability of the solution in time advancement is called an adaptive time-step. The adaptive time-step algorithm is a method of presenting the maximum usable time-step suitable for each integration based on the CFL-condition for the adaptive time-step. In this paper, the adaptive time-step algorithm is applied for the Korean Integrated Model (KIM) to determine suitable parameters used for the adaptive time-step algorithm through the monthly verifications of 10-day simulations (during January and July 2017) at about 12 km resolution. By comparing the numerical results obtained by applying the 25 second static time-step to KIM in Supercomputer 5 (Nurion), it shows similar results in terms of forecast quality, presents the maximum available time-step for each integration, and improves the calculation efficiency by reducing the number of total time integrations by 19%.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1175-1178
• /
• 1998

we propose the Walsh-Hadamard Transform adaptive filter with time-varying step size. The performance of the proposed algorithm is evealuated in system identification where computer simulations are performed for both time-invariant and time-varying system. It is shown that the proposed algorithm produces good results compared with similar algorithms under different conditions, particularly in case of time-varying circumstance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.823-828
• /
• 1992

A novel steepest descent adaptive filter algorithm, which uses the instantaneous stochastic gradient for the steepest descent direction, is derived from a newly devised performance index function. The performance function for the new algorithm is improved from that for the LMS in consideration that the stochastic steepest descent method is utilized to minimize the performance index iterativly. Through mathematical analysis and computer simulations, it is verified that there are substantial improvements in convergence and misadjustments even though the computational simplicity and the robustness of the LMS algorithm are hardly sacrificed. On the other hand, the new algorithm can be interpreted as a variable step size adaptive filter, and in this respect a heuristic method is proposed in order to reduce the noise caused by the step size fluctuation.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.958-959
• /
• 2015

This paper proposes adaptive incremental conductance(A-IC) algorithm for maximum power point tracking(MPPT) control of photovoltaic. Conventional Perturbation & Observation(PO) and IC MPPT control algorithm generally uses fixed step size. A small fixed step size will cause the tracking speed to decrease and tracking accuracy of the MPP will decrease due to large fixed step size. Therefore, this paper proposes N-IC MPPT algorithm that adjust automatically step size according to operating conditions. To improve tracking speed and accuracy, when operating point is far from maximum power point(MPP), step size uses maximum value and when operating point is near from MPP, step size uses variable step size that adjust according to slope of P-V curve. The validity of MPPT algorithm proposed in this paper prove through compare with conventional IC MPPT algorithm.