Parallel structure for sparse impulse response using moving window integration

Parallel structure for sparse impulse response using moving window integration

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A novel scheme is proposed to locate the dispersive region, whose location is essential for parallel echo cancellation. In the scheme, a first filter adapts to a subsampled version of the input signal to roughly identify the impulse response. After each adaptation, a squaring function and a moving window integration procedure are performed on the first filter, and the region with the maximum integration value is considered to be the dispersive region. Finally, a second short filter is used to precisely identify the active coefficients belonging to the located dispersive region to implement the actual echo cancellation. Simulation results suggest that the parallel structure improves its convergence speed 3 times and its computation can be reduced by 3/8 compared with the traditional NLMS algorithm by decreasing the filter length. Due to the more accurate estimate of the location, the misalignment noise of the proposed algorithm is at least 10 dB lower than that of the conventional dispersive region locating algorithm. Moreover, the proposed algorithm based on the parallel structure outperforms other sparse adaptive algorithms in all aspects.


    1. 1)
      • 1. Benesty, J., Gansler, T., Morgan, D. R., et al: ‘Advances in Network and Acoustic Echo Cancellation.New York: Springer, 2001..
    2. 2)
      • 2. Haykin, S.: ‘Adaptive filter theory’ (Prentice-Hall, Upper Saddle River, NJ, 2013, 5th edn.).
    3. 3)
      • 3. Murakami, Y., Yamagishi, M., Yukawa, M., et al: ‘A sparse adaptive filtering using time-varying soft-thresholding techniques’. Proc. of IEEE Int. Conf. on Acoustics, Speech, Signal Processing (ICASSP), Dallas, March 2010, pp. 37343737.
    4. 4)
      • 4. Deng, H., Doroslovacki, M.: ‘Proportionate adaptive algorithms for network echo cancellation’, IEEE Trans. Signal Process., 2006, 54, (5), pp. 17941804.
    5. 5)
      • 5. Shi, K., Ma, X., Zhou, G.T.: ‘An efficient acoustic echo cancellation design for systems with long room impulses and nonlinear loudspeakers’, Signal Process., 2009, 89, (2), pp. 121132.
    6. 6)
      • 6. Duttweiler, D.L.: ‘Proportionate normalized least-mean-squares adaptation in echo cancellers’, IEEE Trans. Speech Audio Process., 2000, 8, (5), pp. 508518.
    7. 7)
      • 7. Deng, H., Doroslovacki, M.: ‘Improving convergence of the PNLMS algorithm for sparse impulse response identification’, IEEE Signal Process. Lett., 2005, 12, (3), pp. 181184.
    8. 8)
      • 8. Ciochina, S., Paleologu, C., Benesty, J., et al: ‘An optimized proportionate adaptive algorithm for sparse system identification’. IEEE Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, USA, November 2015, pp. 15461550.
    9. 9)
      • 9. Li, N., Zhang, Y., Zhao, Y., et al: ‘An improved variable tap-length LMS algorithm’, Signal Process., 2009, 89, (5), pp. 908912.
    10. 10)
      • 10. Zhang, Y., Chambers, J.A., Sanei, S., et al: ‘A new variable tap-length LMS algorithm to model an exponential decay impulse response’, IEEE Signal Process. Lett., 2007, 14, (4), pp. 263266.
    11. 11)
      • 11. Duttweiler, D.L.: ‘Subsampling to estimate delay with application to echo cancelling’, IEEE Trans. Acoust. Speech Signal Process., 1983, 31, (5), pp. 10901099.
    12. 12)
      • 12. Dyba, R.A.: ‘Parallel structures for fast estimation of echo path pure delay and their applications to sparse echo cancellers’. 42nd Annual Conf. on Information Sciences and Systems, Princeton, USA, March 2008, pp. 241245.
    13. 13)
      • 13. Youhong, L., Fowler, R., Tian, W., et al: ‘Enhancing echo cancellation via estimation of delay’, IEEE Trans. Signal Process., 2005, 53, (11), pp. 41594168.
    14. 14)
      • 14. Bershad, N.J., Bist, A.: ‘Fast coupled adaptation for sparse impulse responses using a partial Haar transform’, IEEE Trans. Signal Process., 2005, 53, (3), pp. 966976.
    15. 15)
      • 15. Ribas, C.H.H., Bermudez, J.C.M., Bershad, N.J.: ‘Identification of sparse impulse response – design and implementation using the partial Haar block wavelet transform’, Signal Process., 2012, 22, (6), pp. 10731084.
    16. 16)
      • 16. Kechichian, P., Champagne, B.: ‘An improved partial Haar dual adaptive filter for rapid identification of a sparse echo channel’, Signal Process., 2009, 89, (5), pp. 710723.
    17. 17)
      • 17. Digital Network Echo Cancellers: ‘ITU-T recommendation G.168’, 2009.
    18. 18)
      • 18. Renwang, S.H.S., Gangfei, W.: ‘Study on sparse channel estimation algorithm based on compressive sensing for OFDM systems’. 32rd Int. Conf. on Communication Software and Networks, Xi'an, China, May 2011, pp. 368371.
    19. 19)
      • 19. Yamagishi, M., Yamada, I.: ‘Exploiting sparsity in feed-forward active noise control with adaptive Douglas-Rachford splitting’. Annual Summit and Conf. on Signal and Information Processing Association, Kaosiung, China, November 2013, pp. 16.
    20. 20)
      • 20. Paleologu, C., Benesty, J., Ciochina, S.: ‘A variable step-size affine projection algorithm designed for acoustic echo cancellation’, IEEE Trans. Audio, Speech, Lang. Process., 2008, 16, (8), pp. 14661478.
    21. 21)
      • 21. Benesty, J., Rey, H., Vega, L.R., et al: ‘A nonparametric VSS NLMS algorithm’, IEEE Signal Process. Lett., 2006, 13, (10), pp. 581584.

Related content

This is a required field
Please enter a valid email address