• Title/Summary/Keyword: Adaptive LMS algorithm

Search Result 403, Processing Time 0.026 seconds

A Study On ECLMS Using Estimated Correlation (추정상관을 이용한 ECLMS에 관한 연구)

  • 오신범;권순용;이채욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7A
    • /
    • pp.651-658
    • /
    • 2002
  • Although least mean square(LMS) algorithm is known to one of the most popular algorithm in adaptive signal processing because of the simplicity and the small computation, the choice of the step size reflects a tradeoff between the misadjustment and the speed of adaptation. In this paper, we present a new variable step size LMS algorithm, so-called ECLMS(Estimated correlation LMS), using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multiple-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

Convergence Acceleration of the LMS Algorithm Using Successive Data Orthogonalization (입력 신호의 연속적인 직교화를 통한 LMS 알고리즘의 수렴 속도 향상)

  • Shin, Hyun-Chool
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.90-94
    • /
    • 2008
  • It is well-blown that the convergence rate gets worse when an input signal to an adaptive filter is correlated. In this paper we propose a new adaptive filtering algorithm that makes the convergence rate much improved even for highly correlated input signals. By introducing an orthogonal constraint between successive input signal vectors we overcome the slow convergence problem of the LMS algorithm with the correlated input signal. Simulation results show that the proposed algerian yields fast convergence speed and excellent tracking capability under both time-invariant and time-varying environments, while keeping both computation and implementation simple.

Convergence Behavior of the filtered-x LMS Algorithm for Active Noise Caneller

  • Lee, Kang-Seung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.17 no.2E
    • /
    • pp.10-15
    • /
    • 1998
  • Application of the Filtered-X LMS adaptive filter to active noise cancellation requires to estimate the transfer characteristics between the output and the error signal of the adaptive canceler. In this paper, we derive an adaptive cancellation algorithm and analyze is convergence behavior when the acoustic noise is assumed to consist of multiple sinusoids. The results of the convergence analysis of the Filtered-X LMS algorithm indicate that the effects of parameter estimation inaccuracy on the convergence behavior of the algorithm are characterize by two distinct components : Phase estimation error and estimated magnitude. In particular, the convergence of the Filtered-X LMS algorithm is show to be strongly affected by the accuracy of the phase response estimate. Simulation results of the algorithm are presented which support the theoretical convergence analysis.

  • PDF

Adaptive Noise Reduction on the Frequency Domain using the Sign Algorithm.

  • Lee, Jae-Kyung;Yoon, Dal-Hwan;Min, Seung-Gi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.57-60
    • /
    • 2003
  • We have proposed the adaptive noise reduction algorithm using the MDFT. The algorithm proposed use the linear prediction coefficients of the AR method based on Sign algorithm that is the modified LMS instead of the least mean square(LMS). The signals with a random noise tracking performance are examined through computer simulations and confirmed that the high speed adaptive noise reduction processing system is realized with rapid convergence.

  • PDF

Adaptive Interference Cancellation Using CMA-Correlation Normalized LMS for WCDMA System

  • Han, Yong-Sik;Yang, Woon-Geun
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.155-158
    • /
    • 2010
  • In this article, we proposed a new interference canceller using the adaptive algorithm. We designed constant modulus algorithm-correlation normailized least mean square (CMA-CNLMS) for wireless system. This structure is normalized LMS algorithm using correlation between the desired and input signal for cancelling the interference signals in the wideband code division multiple access (WCDMA) system. We showed that the proposed algorithm could improve the Mean Square Error (MSE) performance of LMS algorithm. MATLAB (Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. The MSE value of the LMS with mu=0.0001 was measured as - 12.5 dB, and that of the proposed algorithm was -19.5 dB which showed an improvement of 7dB.

A BLMS Adaptive Receiver for Direct-Sequence Code Division Multiple Access Systems

  • Hamouda Walaa;McLane Peter J.
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.243-247
    • /
    • 2005
  • We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

A study on improvement of steady-state peformance and convergence rate in an adaptive noise canceller (적응잡음제거기의 정상상태 성능 및 수렴율 향상에 관한 연구)

  • 배종갑;김창기;박장식;손경식
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.4
    • /
    • pp.42-49
    • /
    • 1997
  • A conventional adaptive noise canceller (ANC) using LMS algorithm suffers from the misadjustment of adaptive filter weights due to the gradient-estimate noise by input speech signal at steady state. In this paper, an ANC is proposed which uses the combination of VSLMS (variable step size LMS) and SA (sign algorithm) to improve steady state performance and convergence rate. SA algorithm is applied in speech region to prevent the weights from perturbing by output speech of ANC and VSLMS algorithm is applied to improve convergence rate and channel tracking ability in silence region and adaptive transient region. In compute rsimulation, the performance of the proposed VSLMS-SA combination algorithm is much better than LMS algorithm and the algorithm, recently proposed by greenberg, with adaptation step-size parameter determine dby sum method in convergence rate, channel tracking and steady state performance.

  • PDF

A Da7a-Recycling Sign Algorithm for Adaptive Equalization (데이터 재활용 방식을 적용한 부호 알고리듬)

  • 김남용
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.2
    • /
    • pp.130-135
    • /
    • 2002
  • A new Sign algorithm which has improved convergence speed is presented. The data-recycling technique, whose coefficients are multiply adapted in a symbol time period by recycling the received data, is applied to Sign algorithm which has few multiplications. Sign algorithm has very few multiplications and is the most easily implemented, but it gives small rate of convergence relative to others. The proposed algorithm combines the advatage of Sign algorithm, few multiplications, and the virtue of Data-Recycling LMS algorithm, simplicity and fast convergence. The results of computer simulation show that the proposed algorithm has 2 times faster convergence rate than that of LMS algorithm. Comparing to Data-Recycling LMS algorithm, in similar convergence conditions, it requires half fewer multiplications.

Implementation of adaptive filters using fast hadamard transform (고속하다마드 변환을 이용한 적응 필터의 구현)

  • 곽대연;박진배;윤태성
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 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.

  • PDF

Effect of Gradient Vector Calculation Method On Adaptive Beamforming using LMS Algorithm (기울기 벡터 계산법이 LMS 알고리즘을 이용한 적응 빔포밍에 미치는 영향)

  • Kwang-Chol Chae;Ki-Ryang Cho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.3
    • /
    • pp.535-544
    • /
    • 2023
  • In this paper, we study the effect of gradient vector calculation method(analytical method, central finite difference method) on adaptive beamforming to control weight distribution during iterated calculation when LMS algorithm (repeating method) is used to realize desired beam pattern. To this end, a quasi-ideal beam having an arbitrarily set beam width, a rotating beam, and a multi-beam were reviewed as examples. Numerical experiments applied the step parameters of the appropriate values to the adaptive beamforming system through trial and error equally to the two calculations, and compared the convergence characteristics of objective functions that evaluate adaptability and error using two methods for calculating gradient vectors.