Turing computability of Fourier transforms of bandlimited and discrete signals
The Fourier transform is an important operation in signal processing. However, its exact
computation on digital computers can be problematic. In this paper we consider the …
computation on digital computers can be problematic. In this paper we consider the …
Turing meets circuit theory: Not every continuous-time LTI system can be simulated on a digital computer
Solving continuous problems on digital computers gives generally only approximations of
the continuous solutions. It is therefore crucial that the error between the continuous solution …
the continuous solutions. It is therefore crucial that the error between the continuous solution …
Algorithmic computability of the signal bandwidth
The bandwidth of a bandlimited signal is an important number that is relevant in many
applications and concepts. For example, according to the Shannon sampling theorem, the …
applications and concepts. For example, according to the Shannon sampling theorem, the …
On the arithmetic complexity of the bandwidth of bandlimited signals
The bandwidth of a signal is an important physical property that is of relevance in many
signal-and information-theoretic applications. In this paper we study questions related to the …
signal-and information-theoretic applications. In this paper we study questions related to the …
Optimal sampling rate and bandwidth of bandlimited signals—an algorithmic perspective
The bandwidth of a bandlimited signal is a key quantity that is relevant in numerous
applications. For example, it determines the minimum sampling rate that is necessary to …
applications. For example, it determines the minimum sampling rate that is necessary to …
Effective approximation of bandlimited signals and their samples
Shannon's sampling theorem is of high importance in signal processing, because it links the
continuous-time and discrete-time worlds. For bandlimited signals we can switch from one …
continuous-time and discrete-time worlds. For bandlimited signals we can switch from one …
Turing meets Shannon: Computable sampling type reconstruction with error control
The conversion of analog signals into digital signals and vice versa, performed by sampling
and interpolation, respectively, is an essential operation in signal processing. When digital …
and interpolation, respectively, is an essential operation in signal processing. When digital …
Computing upper and lower bounds for the bandwidth of bandlimited signals
The bandwidth of a signal is an important physical property that is of relevance in many
signal processing applications. In this paper we study questions related to the computability …
signal processing applications. In this paper we study questions related to the computability …
Arithmetic Complexity of Frequency-Domain Representations of Time-Computable Signals
H Boche, YN Böck - 2023 IEEE International Symposium on …, 2023 - ieeexplore.ieee.org
The duality between time-and frequency-domain representations of information-carrying
signals is an established cornerstone of information theory. In terms of computability and …
signals is an established cornerstone of information theory. In terms of computability and …
Can every analog system be simulated on a digital computer?
A Turing machine is a model describing the fundamental limits of any realizable computer,
digital signal processor (DSP), or field programmable gate array (FPGA). This paper shows …
digital signal processor (DSP), or field programmable gate array (FPGA). This paper shows …