For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions f having an expansion in terms of orthogonal polynomials is thereby measured by a generalized mean value e{open}(f). Solving an optimization problem including the functional e{open}(f), we determine those polynomials out of a polynomial space that are optimally localized. We give explicit formulas for these optimally space localized polynomials and determine in the case of the Jacobi polynomials the relation of the functional e{open}(f) to the position variance of a well-known uncertainty principle. Further, we will consider the Hermite polynomials as an example on how to get optimally space localized polynomials in a non-compact setting. Finally, we investigate how the obtained optimal polynomials can be applied as filters in signal processing. © 2011 Springer Science+Business Media, LLC.
Optimally Space Localized Polynomials with Applications in Signal Processing
Erb W.
2012
Abstract
For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions f having an expansion in terms of orthogonal polynomials is thereby measured by a generalized mean value e{open}(f). Solving an optimization problem including the functional e{open}(f), we determine those polynomials out of a polynomial space that are optimally localized. We give explicit formulas for these optimally space localized polynomials and determine in the case of the Jacobi polynomials the relation of the functional e{open}(f) to the position variance of a well-known uncertainty principle. Further, we will consider the Hermite polynomials as an example on how to get optimally space localized polynomials in a non-compact setting. Finally, we investigate how the obtained optimal polynomials can be applied as filters in signal processing. © 2011 Springer Science+Business Media, LLC.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.