Exponentially decaying time-recursive blind deconvolution algorithm for speech dereverberation

Author

Zhao, Ping-ya ; Reilly, James P.

Author_Institution

Commun. Res. Lab., McMaster Univ., Hamilton, Ont., Canada

fYear

1995

fDate

15-18 Oct 1995

Firstpage

127

Lastpage

130

Abstract

We present a time-recursive fast algorithms for adaptive blind deconvolution as applied to nonstationary speech dereverberation. The algorithm has a computational complexity of 30L+3 multiplications and divisions per recursion (MADPR) and uses an exponentially decaying data window, where L is the length of an acoustic impulse response (AIR). Besides the adaptive property, the time-recursive algorithm can also handle the so-called “tail” problem

Keywords

acoustic signal processing; computational complexity; deconvolution; recursive estimation; reverberation; speech processing; transient response; acoustic impulse response; adaptive blind deconvolution; adaptive property; blind deconvolution algorithm; computational complexity; exponentially decaying data window; exponentially decaying time-recursive algorithm; multiplications; multiplications and divisions per recursion; nonstationary speech dereverberation; speech dereverberation; tail problem; time-recursive fast algorithms; Computational complexity; Convolution; Deconvolution; Degradation; Loudspeakers; Microphones; Signal processing; Signal restoration; Speech processing; Telephony;

fLanguage

English

Publisher

ieee

Conference_Titel

Applications of Signal Processing to Audio and Acoustics, 1995., IEEE ASSP Workshop on

Conference_Location

New Paltz, NY

Print_ISBN

0-7803-3064-1

Type

conf

DOI

10.1109/ASPAA.1995.482974

Filename

482974