New algorithm for spectral factorization and its practical application
In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform...
Saved in:
| Published in: | ECC : 2001 European Control Conference : 4-7 September 2001 pp. 3104 - 3109 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding Journal Article |
| Language: | English |
| Published: |
IEEE
01.09.2001
|
| Subjects: | |
| ISBN: | 9783952417362, 395241736X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform routine (FFT), brings high computational efficiency and reliability. The power of the proposed procedure is employed in a particular practical application. Namely the problem of computing an H 2 -optimal inverse dynamic filter to an audio equipment is considered as it was proposed by M. Sternad and colleagues in [12] to improve behavior of moderate quality loudspeakers. Involved spectral factorization is resolved by our new method and its performance is compared with existing algorithms. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Conference-1 ObjectType-Feature-3 content type line 23 SourceType-Conference Papers & Proceedings-2 |
| ISBN: | 9783952417362 395241736X |
| DOI: | 10.23919/ECC.2001.7076408 |

