| Paper ID | SPTM-18.5 |
| Paper Title |
TIME-DOMAIN CONCENTRATION AND APPROXIMATION OF COMPUTABLE BANDLIMITED SIGNALS |
| Authors |
Holger Boche, Ullrich Mönich, Technical University of Munich, Germany |
| Session | SPTM-18: Sampling Theory, Analysis and Methods |
| Location | Gather.Town |
| Session Time: | Thursday, 10 June, 15:30 - 16:15 |
| Presentation Time: | Thursday, 10 June, 15:30 - 16:15 |
| Presentation |
Poster
|
| Topic |
Signal Processing Theory and Methods: [SMDSP] Sampling, Multirate Signal Processing and Digital Signal Processing |
| IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
| Virtual Presentation |
Click here to watch in the Virtual Conference |
| Abstract |
We study the time-domain concentration of bandlimited signals form a computational point of view. To this end we employ the concept of Turing computability that exactly describes what can be theoretically computed on a digital machine. A previous definition of computability for bandlimited signals is based on the idea of effective approximation with finite Shannon sampling series. In this paper we provide a different definition that uses the time-domain concentration of the signals. For computable bandlimited signals with finite L^p-norm, we prove that both definitions are equivalent. We further show that local computability together with the computability of the L^p-norm imply the computability of the signal itself. This provides a simple test for computability. |
