By Topic

There exists no always convergent algorithm for the calculation of spectral factorization, Wiener filter, and Hilbert transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Boche, H. ; Technische Univ. Berlin ; Pohl, V.

Spectral factorization, Wiener filtering, and many other important operations in information theory and signal processing can be lead back to a Hilbert transform and a Poisson integral. Whereas the Poisson integral causes generally no problems, the Hilbert transform has a much more complicated behavior. This paper investigates the possibility to calculate the Hilbert transformftilde of a given continuous function f based on a finite set of sampling points of f. It shows that even if ftilde is continuous, no linear approximation operator exists which approximates arbitrary well from a finite number of sampling points of f, in general. Moreover, the paper characterizes the set of all functions for which such linear approximation operators exist and discusses some consequences for practical applications

Published in:

Information Theory, 2006 IEEE International Symposium on

Date of Conference:

9-14 July 2006