DocumentCode
3521956
Title
Efficient minimum-phase prefilter computation using fast QL-factorization
Author
Hansen, Morten ; Christensen, Lars P B
Author_Institution
Inf. & Math. Modelling, Tech. Univ. of Denmark, Lyngby
fYear
2009
fDate
19-24 April 2009
Firstpage
2697
Lastpage
2700
Abstract
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 fast QL-factorization. A desirable property of this approach is that the complexity is independent of the size of the matrix being QL-factorized. Instead, the complexity scales with the required precision of the filters as well as the filter length.
Keywords
all-pass filters; computational complexity; matrix decomposition; all-pass filter; complexity scales; fast QL-factorization; minimum phase prefilter computation; minimum-phase filter; Communication systems; Delay estimation; Feedback; Informatics; Mathematical model; Maximum likelihood detection; Maximum likelihood estimation; Multipath channels; Polynomials; Signal processing; Communications; fast QL-factorization; minimum-phase systems; prefiltering;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on
Conference_Location
Taipei
ISSN
1520-6149
Print_ISBN
978-1-4244-2353-8
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2009.4960179
Filename
4960179
Link To Document