Conference paper
Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization
This paper presents a novel approach for computing both the minimum-phase filter and the associated all-pass filter in a computationally efficient way using the fast QL-factorization. A desirable property of this approach is that the complexity is independent on the size of the matrix which is QL-factorized, and thereby the complexity scales with the required precision of the filters and the filter length.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2009 |
| Pages: | 2697-2700 |
| Proceedings: | 2009 IEEE International Conference on Acoustics, Speech and Signal Processing |
| ISBN: | 1424423538 , 1424423546 , 9781424423538 and 9781424423545 |
| ISSN: | 2379190x and 15206149 |
| Types: | Conference paper |
| DOI: | 10.1109/ICASSP.2009.4960179 |
Communication systems Delay estimation Feedback Informatics Mathematical model Maximum likelihood detection Maximum likelihood estimation Multipath channels Polynomials Signal processing all-pass filter all-pass filters complexity scales computational complexity matrix decomposition minimum phase prefilter computation minimum-phase filter
