Skip to main content

Blind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3195))

Abstract

We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary and possibly also non-white. The proposed algorithm is based on a joint-diagonalization approach, where we search for a single polynomial matrix that jointly diagonalizes a set of measured spatiotemporal correlation matrices. In contrast to most other algorithms based on similar concepts, we define the underlying cost function entirely in the time-domain. Furthermore, we present an efficient implementation of the proposed algorithm which is based on fast convolution techniques.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kreyszig, E.: Introductory Functional Analysis with Applications. John Wiley & Sons, Chichester (1978)

    MATH  Google Scholar 

  2. Belouchrani, A., Abed-Meraim, K., Cardoso, J.F., Moulines, E.: A blind source separation technique using second-order statistics. IEEE Trans. Signal Processing 45, 434–444 (1997)

    Article  Google Scholar 

  3. Joho, M., Rahbar, K.: Joint diagonalization of correlation matrices by using Newton methods with application to blind signal separation. In: Proc. SAM, Rosslyn, VA, pp. 403–407 (2002)

    Google Scholar 

  4. Parra, L., Spence, C.: Convolutive blind separation of non-stationary sources. IEEE Trans. Speech and Audio Processing 8, 320–327 (2000)

    Article  Google Scholar 

  5. Rahbar, K., Reilly, J.P.: Blind source separation algorithm for MIMO convolutive mixtures. In: Proc. ICA, San Diego, CA, pp. 224–229 (2001)

    Google Scholar 

  6. Matsuoka, K., Nakashima, S.: Minimal distortion principle for blind source separation. In: Proc. ICA, San Diego, CA, pp. 927–932 (2001)

    Google Scholar 

  7. Joho, M.: A Systematic Approach to Adaptive Algorithms for Multichannel System Identification, Inverse Modeling, and Blind Identification. PhD thesis, ETH Zürich (2000)

    Google Scholar 

  8. Joho, M., Schniter, P.: Frequency-domain realization of a multichannel blind deconvolution algorithm based on the natural gradient. In: Proc. ICA, Nara, Japan, pp. 543–548 (2003)

    Google Scholar 

  9. Schobben, D.W.E.: Efficient Adaptive Multi-channel Concepts in Acoustics: Blind Signal Separation and Echo Cancellation. PhD thesis, Technical University Eindhoven (1999)

    Google Scholar 

  10. Krongold, B.S., Jones, D.L.: Blind source separation of nonstationary convolutively mixed signals. In: Proc. SSAP, Pocono Manor, PA, pp. 53–57 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joho, M. (2004). Blind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach. In: Puntonet, C.G., Prieto, A. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2004. Lecture Notes in Computer Science, vol 3195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30110-3_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30110-3_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23056-4

  • Online ISBN: 978-3-540-30110-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics