Skip to main content

An Efficient Memory-Improved Proportionate Affine Projection Sign Algorithm Based on l 0-Norm for Sparse System Identification

  • Conference paper
  • First Online:
Foundations of Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 277))

Abstract

An efficient MIP-APSA (EMIP-APSA) is proposed via incorporating l 0-norm as a better measure of sparseness into a recently presented memory-improved proportionate affine projection sign algorithm (MIP-APSA) to enhance performance for sparse system identification. Also, to reduce computational complexity of EMIP-APSA, we achieve a simple implementation of the EMIP-APSA (SEMIP-APSA) while maintaining the consistent performance in terms of convergence rate and steady-state misalignment. Simulation results demonstrate that the proposed EMIP-APSA and SEMIP-APSA obtain a lower steady-state misalignment in comparison with the MIP-APSA for sparse system identification in the impulsive noise environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Duttweiler DL (2008) Proportionate normalized least mean square adaptation in echo cancellers. IEEE Trans Speech Audio Process 8(5):508–518

    Article  Google Scholar 

  2. Benesty J, Gay SL (2002) An improved PNLMS algorithm. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), II-1881–II-1884

    Google Scholar 

  3. Paleologu C, Benesty J, Ciochina S (2008) A variable step-size affine projection algorithm designed for acoustic echo cancellation. IEEE Trans Audio Speech Lang Process 16(8):1466–1478

    Google Scholar 

  4. Albu F, Paleologu C, Ciochina S (2012) New variable step size affine projection algorithms. In: Proceedings of IEEE COMM 2012, Bucharest, Romania, pp 63–66

    Google Scholar 

  5. Gansler T, Benesty J, Gay SL, Sondhi M (2000) A robust proportionate affine projection algorithm for network echo cancellation. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), Istanbul, Turkey, pp 793–796

    Google Scholar 

  6. Hoshuyama O, Goubran RA, Sugiyama A (2004) A generalized proportionate variable step-size algorithm for fast changing acoustic environments. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), Montreal, Canada, IV–161–IV–164

    Google Scholar 

  7. Paleologu C, Ciochina S, Benesty J (2010) An efficient proportionate affine projection algorithm for echo cancellation. IEEE Signal Process Lett 17(2):165–168

    Google Scholar 

  8. Shao T, Zheng YR, Benesty J (2010) An affine projection sign algorithm robust against impulsive interferences. IEEE Signal Process Lett 17(4):327–330

    Article  Google Scholar 

  9. Ni JG, Li F (2012) Efficient implementation of the affine projection sign algorithm. IEEE Signal Process Lett 19(1):24–26

    Article  Google Scholar 

  10. Shin J, Yoo J, Park P (2012) Variable step-size affine projection sign algorithm. Electron Lett 48(9):483–485

    Article  Google Scholar 

  11. Yang ZL, Zheng YR, Grant SL (2011) Proportionate affine projection sign algorithms for sparse system identification in impulsive interference. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), Prague, 4068–4071

    Google Scholar 

  12. Yang ZL, Zheng YR, Grant SL (2011) Proportionate affine projection sign algorithms for network echo cancellation. IEEE Trans Audio Speech Lang Process 19(8):2273–2284

    Article  Google Scholar 

  13. Albu F, Kwan HK (2012) Memory improved proportionate affine projection sign algorithm. Electron Lett 48(20):1279–1281

    Article  Google Scholar 

  14. Gu YT, Jin J, Mei S (2009) l 0 Norm constraint LMS algorithm for sparse system identification. IEEE Signal Process Lett 16(9):774–777

    Article  Google Scholar 

  15. Su GL, Jin J, Gu YT, Wang J (2012) Performance analysis of l 0 norm constraint least mean square algorithm. IEEE Trans Signal Process 60(5):2223–2234

    Article  MathSciNet  Google Scholar 

  16. Paleologu C, Benesty J, Ciochin S (2010) An improved proportionate NLMS algorithm based on the l 0 norm. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP), Dallas, pp 309–312

    Google Scholar 

Download references

Acknowledgment

This work was partially supported by National Science Foundation of P. R. China (Grant: 61271340 and 61071183), the State 863 projects (Grant: 2011AA110501), the Sichuan Provincial Youth Science and Technology Fund (Grant: 2012JQ0046), and the Fundamental Research Funds for the Central Universities (Grant: SWJTU12CX026).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, Y., Zhao, H. (2014). An Efficient Memory-Improved Proportionate Affine Projection Sign Algorithm Based on l 0-Norm for Sparse System Identification. In: Wen, Z., Li, T. (eds) Foundations of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54924-3_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54924-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54923-6

  • Online ISBN: 978-3-642-54924-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics