@inproceedings{7c52246b230f4f21a517ba3706e472f2,
title = "The Solvability Complexity Index of Sampling-based Hilbert Transform Approximations",
abstract = "This paper determines the solvability complexity index (SCI) and a corresponding tower of algorithms for the computational problem of calculating the Hilbert transform of a continuous function with finite energy from its samples. It is shown that the SCI of these algorithms is equal to 2 and that the SCI is independent on whether the calculation is done by linear or by general (i.e. linear and/or non-linear) algorithms.",
keywords = "Computational complexity for continuous problems, Hilbert transform, sampling, towers of algorithms",
author = "Holger Boche and Volker Pohl",
note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 13th International Conference on Sampling Theory and Applications, SampTA 2019 ; Conference date: 08-07-2019 Through 12-07-2019",
year = "2019",
month = jul,
doi = "10.1109/SampTA45681.2019.9030934",
language = "English",
series = "2019 13th International Conference on Sampling Theory and Applications, SampTA 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2019 13th International Conference on Sampling Theory and Applications, SampTA 2019",
}