Approximation and convergence behavior of spectral factorization methods

Holger Boche, Volker Pohl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Common methods for the calculation of the spectral factorization rely on an approximation of the given spectral density by a trigonometric polynomial and a subsequent spectral factorization of this polynomial. Since the approximative polynomial should be factorized, the approximation method must be positive. The first part of this paper studies such approximation methods and deduces limitation on the approximation rate for linear methods which arise from the required positivity. The second part states a lower and an upper bound on the error in the spectral factor induced by the approximation of the spectral density. They show the dependency of the error on the regularity of the stochastic process and on the approximative degree.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages1131-1135
Number of pages5
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period24/06/0729/06/07

Fingerprint

Dive into the research topics of 'Approximation and convergence behavior of spectral factorization methods'. Together they form a unique fingerprint.

Cite this