Abstract

Dereverberation technology is needed in a wide range of speech applications as reverberation often greatly degrades the quality and intelligibility of the speech signal of interest captured by microphones. The commonly used weighted-prediction-error method generally requires long prediction-error filters to remove the reverberation components, which makes it computationally expensive. To deal with this issue, this paper proposes a computationally efficient dereverberation algorithm based on tensor decomposition in which the long prediction-error filter is decomposed into a group of short sub-filters through multiple Kronecker products. Consequently, the high dimensional cross-correlation matrix that needs to be inverted in the dereverberation algorithm is then converted into a set of low dimensional matrices, which leads to significant reduction in the computational complexity. Simulation results demonstrate the properties of the proposed algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.