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 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.
Original language | English |
---|---|
Title of host publication | IEEE International Conference on Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. |
Publisher | IEEE |
Publication date | 2009 |
ISBN (Print) | 978-1-4244-2353-8 |
DOIs | |
Publication status | Published - 2009 |
Event | 2009 IEEE International Conference on Acoustics, Speech and Signal Processing - Taipei, Taiwan, Province of China Duration: 19 Apr 2009 → 24 Apr 2009 Conference number: 34 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4912736 |
Conference
Conference | 2009 IEEE International Conference on Acoustics, Speech and Signal Processing |
---|---|
Number | 34 |
Country/Territory | Taiwan, Province of China |
City | Taipei |
Period | 19/04/2009 → 24/04/2009 |
Internet address |
Bibliographical note
Copyright: 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEEKeywords
- minimum-phase systems
- Communications
- prefiltering
- fast QL-factorization