Former frequency-domain blind devolution algorithms need to consider a large number of frequency bins and recover the sources in different orders and with different amplitudes in each frequency bin,so they suffer from...Former frequency-domain blind devolution algorithms need to consider a large number of frequency bins and recover the sources in different orders and with different amplitudes in each frequency bin,so they suffer from permutation and amplitude indeterminacy troubles. Based on sliding discrete Fourier transform,the presented deconvolution algorithm can directly recover time-domain sources from frequency-domain convolutive model using single frequency bin. It only needs to execute blind sepa-ration of instantaneous mixture once there are no permutation and amplitude indeterminacy troubles. Compared with former algorithms,the algorithm greatly reduces the computation cost as only one frequency bin is considered. Its good and robust per-formance is demonstrated by simulations when the signal-to-noise-ratio is high.展开更多
基金Project (No. 2005EB040486) supported by the National Torch Program of China
文摘Former frequency-domain blind devolution algorithms need to consider a large number of frequency bins and recover the sources in different orders and with different amplitudes in each frequency bin,so they suffer from permutation and amplitude indeterminacy troubles. Based on sliding discrete Fourier transform,the presented deconvolution algorithm can directly recover time-domain sources from frequency-domain convolutive model using single frequency bin. It only needs to execute blind sepa-ration of instantaneous mixture once there are no permutation and amplitude indeterminacy troubles. Compared with former algorithms,the algorithm greatly reduces the computation cost as only one frequency bin is considered. Its good and robust per-formance is demonstrated by simulations when the signal-to-noise-ratio is high.
