Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization

Morten Hansen; Lars P.B. Christensen

doi:10.1109/ICASSP.2009.4960179

Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization

Morten Hansen, Lars P.B. Christensen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

359 Downloads (Pure)

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	https://doi.org/10.1109/ICASSP.2009.4960179
Publication status	Published - 2009
Event	IEEE International Conference on Acoustics, Speech and Signal Processing 2009 - Taipei, Taiwan, Province of China Duration: 19 Apr 2009 → 24 Apr 2009 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4912736

Conference

Conference	IEEE International Conference on Acoustics, Speech and Signal Processing 2009
Country/Territory	Taiwan, Province of China
City	Taipei
Period	19/04/2009 → 24/04/2009
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4912736

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 IEEE

Keywords

minimum-phase systems
Communications
prefiltering
fast QL-factorization

Access to Document

10.1109/ICASSP.2009.4960179

Hansen - ICASSP09Final published version, 128 KB

Cite this

@inproceedings{4b99322850a846eb96e3d380f5a308f5,

title = "Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization",

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.",

keywords = "minimum-phase systems, Communications, prefiltering, fast QL-factorization",

author = "Morten Hansen and Christensen, {Lars P.B.}",

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 IEEE; IEEE International Conference on Acoustics, Speech and Signal Processing 2009, ICASSP 2009 ; Conference date: 19-04-2009 Through 24-04-2009",

year = "2009",

doi = "10.1109/ICASSP.2009.4960179",

language = "English",

isbn = "978-1-4244-2353-8",

booktitle = "IEEE International Conference on Acoustics, Speech and Signal Processing, 2009. ICASSP 2009.",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4912736",

}

Hansen, M & Christensen, LPB 2009, Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization. in IEEE International Conference on Acoustics, Speech and Signal Processing, 2009. ICASSP 2009.. IEEE, IEEE International Conference on Acoustics, Speech and Signal Processing 2009, Taipei, Taiwan, Province of China, 19/04/2009. https://doi.org/10.1109/ICASSP.2009.4960179

TY - GEN

T1 - Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization

AU - Hansen, Morten

AU - Christensen, Lars P.B.

N1 - 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 IEEE

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - minimum-phase systems

KW - Communications

KW - prefiltering

KW - fast QL-factorization

U2 - 10.1109/ICASSP.2009.4960179

DO - 10.1109/ICASSP.2009.4960179

M3 - Article in proceedings

SN - 978-1-4244-2353-8

BT - IEEE International Conference on Acoustics, Speech and Signal Processing, 2009. ICASSP 2009.

PB - IEEE

T2 - IEEE International Conference on Acoustics, Speech and Signal Processing 2009

Y2 - 19 April 2009 through 24 April 2009

ER -

Efficient Minimum-Phase Prefilter Computation Using Fast QL-Factorization

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this