National Academy Science Letters

, Volume 41, Issue 2, pp 85–89 | Cite as

Robust Variable Zero Attractor Controller Based ZA-LMS Algorithm for Variable Sparsity Environment

  • S. Radhika
  • Sivabalan Arumugam
Short Communication


The zero attraction least mean square algorithm (ZA-LMS) provides excellent performance than LMS algorithm when the system is sparse. But when the sparsity level decreases, the performance of ZA-LMS is worse than standard LMS. Hence a novel approach is proposed to work in variable sparsity environment, i.e. the fixed zero attractor controller is replaced by a variable one and the variation is done by comparing the instantaneous error with a threshold which is based on steady state mean square error (MSE) of standard LMS algorithm. Simulations were performed to compare the proposed variable ZA-LMS (VZA-LMS) algorithm with LMS and ZA-LMS algorithms. The proposed algorithm is tested for non sparse, semi sparse and sparse systems and it is found that it converges to a steady state value equal to LMS when the system is non sparse and in case of sparse and semi sparse systems, the steady state MSE is less than LMS and ZA-LMS, thus making the algorithm robust against variable sparsity conditions.


Least mean square algorithm Sparsity Steady state mean square error Zero attraction Convergence 


  1. 1.
    Schreiber W (1995) Advanced television systems for terrestrial broadcasting. Proc IEEE 83(6):958–981CrossRefGoogle Scholar
  2. 2.
    Radecki J, Zilic Z, Radecka K (2002) Echo cancellation in IP networks. In: Proceedings of the 45th Midwest Symposium Circuits Systems vol, 2, pp 219–222Google Scholar
  3. 3.
    Hansler E (1992) The hands-free telephone problem—an annotated bibliography. Sig Process 27(3):259–271CrossRefGoogle Scholar
  4. 4.
    Haykin SS (2007) Adaptive filter theory. Pearson Education IndiaGoogle Scholar
  5. 5.
    Duttweiler DL (2000) Proportionate normalized least mean square adaptation in echo cancellers. IEEE Trans Speech Audio Process 8(5):508–518CrossRefGoogle Scholar
  6. 6.
    Deng H, Doroslovacki M (2005) Improving convergence of the PNLMS algorithm for sparse impulse response identification. IEEE Signal Process Lett 12(3):181–184ADSCrossRefGoogle Scholar
  7. 7.
    Chen Y, Gu Y, Hero AO (2009) Sparse LMS for system identification. ICASSP Taiwan, pp 3125–3128Google Scholar
  8. 8.
    Gu Y, Jin J, Mei S (2009) l0 Norm constraint LMS algorithm for sparse system identification. IEEE Signal Process Lett 16(9):774–777ADSCrossRefGoogle Scholar
  9. 9.
    Shi K, Shi P (2010) Convergence analysis of sparse LMS algorithms with l1-norm penalty. Sig Process 90(12):3289–3293CrossRefzbMATHGoogle Scholar
  10. 10.
    Das BK, Chakraborty M (2014) Sparse adaptive filtering by an adaptive convex combination of the LMS and the ZA-LMS algorithms. IEEE Trans Circuits Syst I Regul Pap 61(5):1499–1507MathSciNetCrossRefGoogle Scholar
  11. 11.
    Sayed AH (2003) Fundamentals of adaptive filtering. Wiley, New YorkGoogle Scholar

Copyright information

© The National Academy of Sciences, India 2018

Authors and Affiliations

  1. 1.Faculty of Electrical and Electronics EngineeringSathyabama UniversityChennaiIndia
  2. 2.NEC Mobile Networks Excellence CentreChennaiIndia

Personalised recommendations