DocumentCode
2025051
Title
Approximation and Convergence Behavior of Spectral Factorization Methods
Author
Boche, H. ; Pohl, V.
Author_Institution
Tech. Univ. Berlin, Berlin
fYear
2007
fDate
24-29 June 2007
Firstpage
1131
Lastpage
1135
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.
Keywords
matrix decomposition; polynomial approximation; stochastic processes; approximative polynomial; error approximation; spectral density; spectral factorization; stochastic process; trigonometric polynomial; Approximation methods; Convergence; Filtering theory; Information filtering; Information theory; Linear approximation; Mobile communication; Polynomials; Stochastic processes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557375
Filename
4557375
Link To Document