| |
| |
|
|
|
|
| Adaptive Variable Step Size in LMS Algorithm Using Evolutionary Programming: VSSLMSEV
|
|
Full
text: |
 PDF(722.8KB) |
|
|
Source |
Signal Processing: An International Journal (SPIJ) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(5.42MB) |
|
Volume: 6 Issue: 2 |
| |
Pages: NULL |
|
Publication
Date: April 2012 |
|
ISSN
(Online): 1985-2339 |
|
|
|
|
|
Pages |
78 - 85 |
|
Author(s) |
|
|
|
Published
Date |
16-04-2012 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: Adaptive Equalization, LMS Algorithm, Evolutionary Programming |
|
|
| |
|
|
| No
record found |
| |
|
| |
|
|
| The Least Mean square (LMS) algorithm has been extensively used in many applications due to its simplicity and robustness. In practical application of the LMS algorithm, a key parameter is the step size. As the step size becomes large /small, the convergence rate of the LMS algorithm will be rapid and the steady-state mean square error (MSE) will increase/decrease. Thus, the step size provides a trade off between the convergence rate and the steady-state MSE of the LMS algorithm. An intuitive way to improve the performance of the LMS algorithm is to make the step size variable rather than fixed, that is, choose large step size values during the initial convergence of the LMS algorithm, and use small step size values when the system is close to its steady state, which results invariable step size Least Mean square (VSSLMS) algorithms. By utilizing such an approach, both a fast convergence rate and a small steady-state MSE can be obtained. Although many VSSLMS algorithmic methods perform well under certain conditions, noise can degrade their performance and having performance sensitivity over parameter setting. In this paper, a new concept is introduced to vary the step size based upon evolutionary programming (SSLMSEV) algorithm is described. It has shown that the performance generated by this method is robust and does not require any presetting of involved parameters in solution based upon statistical characteristics of signal |
| |
|
| |
|
| |
| 1 |
Solmaz, C.O.; Oruc, O.; Kayran, A.H.; “ Optimal step-size LMS equalizer algorithm “.Signal Processing and Communications Applications (SIU), 2011 IEEE . April 2011, pp.853 - 856
|
|
|
| 2 |
Wee-PengAng Farhang-Boroujeny, B,” A new class of gradient adaptive step size LMS algorithm” ,Signal Processing, IEEE Transactions on,2001, Volume: 49 Issue: 4 , pp: 805 – 810.
|
|
|
| 3 |
Krstajic, B. Stankovic, L.J. Uskokovic, Z. “an approach to variable step size LMS algorithm”. :Electronics Letters , Aug 2002 ,Volume: 38 Issue: 16,PP: 927 - 928 .
|
|
|
| 4 |
Saul B. Gelfand, Yongbin Wei, James V. Krogmeier, ,” The Stability of Variable Step-Size LMS Algorithms” IEEE transactions on signal processing, Vol. 47, NO. 12, December 1999.
|
|
|
| 5 |
R. Kwong and E. W. Johnston, “A variable step size LMS algorithm,” IEEE Trans. Signal Processing, vol. 40, pp. 1633–1642, July 1992.
|
|
|
| 6 |
V. J. Mathews and Z. Xie, “A stochastic gradient adaptive filter with gradient adaptive step size,” IEEE Trans. Signal Processing, vol. 41, pp. 2075–2087, June 1993.
|
|
|
| 7 |
Tao Dai; Shahrrava, B.,” Variable step-size NLMS and affine projection algorithms with variable smoothing factor “Circuits and Systems, 2005. 48th Midwest Symposium on, Aug. 2005, pp: 1530 - 1532 ,Vol. 2.
|
|
|
| 8 |
J. H. Husoy and M. S. E. Abadi “Unified approach to adaptive filters and their performance” IET Signal Processing, vol. 2 , No. 2 , pp. 97-109, 2008.
|
|
|
| 9 |
H. C . Shin and A. H. Sayed “Mean square performance of a family of affine projection algorithms” IEEE Trans. Signal Processing, vol. 52, pp. 90-102, 2004.
|
|
|
| |
|
| |
|
| |
| |
|
| |
|
| |
| |
|
| |
|
| |
|
| Ajjaiah H.B.M : Colleagues
|
|
| Prabhakar V. Hunagund : Colleagues
|
|
| Manoj Kumar Singh : Colleagues
|
|
| P.V.rao : Colleagues
|
|
|
|
|
|
|
|
|
|
|
