Abstract
Multi-microphone noise reduction plays an increasing and important role in acoustic communication systems. Existing multichannel noise reduction filters are commonly computed based on a single noise covariance matrix. Recently, an orthogonal noise signal decomposition was proposed that uses a single noise signal as a reference. Using this decomposition, it was possible to reformulate the noise reduction problem and derived a multichannel noise reduction filter that allows a tradeoff between the noise that is coherent and incoherent with respect to the reference signal. In this contribution, we analyze the previously proposed decomposition and propose an orthogonal decomposition that is based on a rank-one projection of all noise signals. The projection is chosen such that the total variance of the coherent noise component is maximized. To further improve the separation between coherent noise and incoherent noise, a rank- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Q</i> projection of the observed noise signals is proposed. The decomposed noise covariance matrix is then used to derive a minimum variance distortionless response beamformer that allows a tradeoff between coherent and incoherent noise reduction, and to form a constraint matrix for a linearly constrained minimum variance beamformer. The results of the performance evaluation demonstrate the advantage of the proposed decompositions over the previously proposed decomposition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Audio, Speech, and Language Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.