• Title/Summary/Keyword: 가변 step-size

Search Result 98, Processing Time 0.022 seconds

Variable Step Size Adaptive Algorithm using Instantaneous Absolute Value Based on System Generator (시스템 제너레이터 환경에서 순시 절대값을 이용한 가변스텝사이즈 적응알고리즘)

  • Lee, Chae-Wook;Ryu, Jeong-Tak
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.3
    • /
    • pp.1-6
    • /
    • 2016
  • As the convergence speed of time domain adaptive algorithm on the LMS(Least Mean Square) becomes slow when eigen value distribution width is spread, So variable step size algorithm is used widely. But it needs a lot of calculation load. In this paper we consider new algorithm, which can reduce calculations and improve convergence speed, uses instantaneous absolute value of average noise signal adapting the exponential function. For the performance of proposed algorithm is tested and simulated to system generator. As the result we show the variable step size adaptive algorithm in proportion to instantaneous absolute value is more stable and efficient than others.

Subband Affine Projection Algorithm Using Variable Step Size (가변 스텝사이즈를 이용한 부밴드 인접투사 알고리즘)

  • Choi, Hun;Bae, Hyeon-Deok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.2
    • /
    • pp.69-74
    • /
    • 2007
  • In signal processing applications with highly correlated input signals, subband affine projection algorithm and step size controlling is a good solution for improving the slow convergence rate and large computational complexity of LMS-type algorithms. This paper proposes a subband affine projection algorithm using a variable step size. The proposed method achieves fast convergence rate and small steady-state error with a small computational complexity by combining the SAP and step size controlling in a subband structure. Experimental results on highly correlated input signal show that the proposed method is superior to the conventional methods.

Design and Performance Evaluation of Micro Stepping Actuator with a Variable Step Size (가변 스텝 마이크로 액츄에이터의 설계 및 구동특성)

  • Lim, Y.M.;Kim, S.H.;Kwak, Y.K.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.7
    • /
    • pp.26-31
    • /
    • 1995
  • A new actuating mechanism suitable for a micro positioning device is developed using piezo-electric elements. The actuator can make a step movement of 0.5 .mu. m up to 3.5 .mu. m. The step size can be adjusted on demand. By repeating this step action, long distance movement is achieved. Precise positioning can be obtained by combining the coarse motion with the maximum step size and fine motion. Two types of fine motion have been proposed for a driving method. Firstly, feedback control bases on PID is applied. The experimental results for the two method are presented.

  • PDF

Individual Variable Step-Size Subband Affine Projection Algorithm (독립 가변 스텝사이즈 부밴드 인접투사 알고리즘)

  • Choi, Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.3
    • /
    • pp.443-448
    • /
    • 2022
  • This paper presents a subband affine projection algorithm with variable step size to improve convergence performance in adaptive filtering applications with long adaptive filters and highly correlated input signals. The proposed algorithm can obtain fast convergence speed and small steady-state error by using different step sizes for each adaptive sub-filter in the subband structure to which polyphase decomposition and noble identity are applied. The step size derived to minimize the mean square error of the adaptive filter at each update time shows better convergence performance than the existing algorithm using a variable step size. In order to confirm the convergence performance of the proposed algorithm, which is superior to the existing algorithm, computer simulations are performed for mean square deviation(MSD) for AR(1) and AR(2) colored input signals considering the system identification model.

A Performance Evaluation of Blind Equalization Algorithma for a Variable Step-Size MSAG-GMMA (가변 스텝 크기 MSAG-GMMA 적응 블라인드 등화 알고리즘의 성능 평가)

  • Jeong, Young-Hwa
    • 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.

Subband Affine Projection Adaptive Filter using Variable Step Size and Pipeline Transform (가변 적응상수와 파이프라인 변환을 이용한 부밴드 인접투사 적응필터)

  • Choi, Hun;Ha, Hong-Gon;Bae, Hyeon-Deok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.1
    • /
    • pp.104-110
    • /
    • 2009
  • In this paper, we suggest a new technique which employ the pipelined architecture for the implementation of the SAP adaptive filter using variable step size. According as SAP adaptive filter is sufficiently decomposed, a simplified SAP adaptive filter can be derived, and the weights of adaptive sub-filters can be updated by a simple formular without a matrix inversion. The convergence speed and the steady state error of the simplified SAP adaptive filter are improved by using variable step size. For practical implementation, the simplified SAP adaptive sub-filters are transformed by the pipeline technique.

Fast Wavelet Adaptive Algorithm Based on Variable Step Size for Adaptive Noise Canceler (Adaptive Noise Canceler에 적합한 가변 스텝 사이즈 고속 웨이블렛 적응알고리즘)

  • Lee Chae-Wook;Lee Jae-Kyun
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.8
    • /
    • pp.1051-1056
    • /
    • 2005
  • Least mean square(LMS) algorithm is 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, we use adaptive algorithm of wavelet transform. And we propose a new wavelet based adaptive algorithm of wavelet transform. And we propose a new 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.

  • PDF

Variable Step Size LMS Algorithm Using the Error Difference (오류 차이를 활용한 가변 스텝 사이즈 LMS 알고리즘)

  • Woo, Hong-Chae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.3
    • /
    • pp.245-250
    • /
    • 2009
  • In communications and signal processing area, a number of least mean square adaptive algorithms have been used because of simplicity and robustness. However the LMS algorithm is known to have slow and non-uniform convergence. Various variable step size LMS adaptive algorithms have been introduced and researched to speed up the convergence rate. A variable step size LMS algorithm using the error difference for updating the step size is proposed. Compared with other algorithms, simulation results show that the proposed LMS algorithm has a fast convergence. The theoretical performance of the proposed algorithm is also analyzed for the steady state.

Performance Comparison of Step-Size Update Methods for Modified CMA (변형된 CMA의 수렴상수 갱신 방법의 성능 비교)

  • Oh, Kil-Nam
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.9
    • /
    • pp.4147-4152
    • /
    • 2011
  • Compared to the constant modulus algorithm (CMA), the modified CMA (MCMA) is easy not only to improve the steady-state performance but also to be expanded to higher-order constellations by using fewer moduli with evenly spaced. In this paper, it is shown that the MCMA is sufficient to achieve satisfactory steady-state performance by applying a variable step-size to the MCMA without switching to an hard decision-directed algorithm. Two new methods varying the step-size are proposed, and the performance improvement of the MCMA with the new methods of variable step-size is presented as compared to the CMA and the fixed step-size MCMA through computer simulations.

Optimal Variable Step Size for Simplified SAP Algorithm with Critical Polyphase Decomposition (임계 다위상 분해기법이 적용된 SAP 알고리즘을 위한 최적 가변 스텝사이즈)

  • Heo, Gyeongyong;Choi, Hun
    • 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.