scholarly journals Shannon’s Sampling Theorem for Bandlimited Signals and Their Hilbert Transform, Boas-Type Formulae for Higher Order Derivatives—The Aliasing Error Involved by Their Extensions from Bandlimited to Non-Bandlimited Signals

Entropy ◽  
2012 ◽  
Vol 14 (11) ◽  
pp. 2192-2226 ◽  
Author(s):  
Paul L. Butzer ◽  
Gerhard Schmeisser ◽  
Rudolf L. Stens
Keyword(s):  
Hilbert Transform ◽  
Sampling Theorem ◽  
Higher Order ◽  
Aliasing Error ◽  
Bandlimited Signals ◽  
Shannon’S Sampling Theorem

scholarly journals Discrete sampling theorem to Shannon’s sampling theorem using the hyperreal numbers R

2021 ◽  
Vol 28 (2) ◽  
pp. 163-182
Author(s):  
José L. Simancas-García ◽  
Kemel George-González
Keyword(s):  
Computational Cost ◽  
Number System ◽  
Sampling Theorem ◽  
Discrete Sampling ◽  
Sampled Signal ◽  
Speed Up ◽  
Shannon’S Sampling Theorem ◽  
The Difference ◽  
Band Limited ◽  
Hyperreal Numbers

Shannon’s sampling theorem is one of the most important results of modern signal theory. It describes the reconstruction of any band-limited signal from a finite number of its samples. On the other hand, although less well known, there is the discrete sampling theorem, proved by Cooley while he was working on the development of an algorithm to speed up the calculations of the discrete Fourier transform. Cooley showed that a sampled signal can be resampled by selecting a smaller number of samples, which reduces computational cost. Then it is possible to reconstruct the original sampled signal using a reverse process. In principle, the two theorems are not related. However, in this paper we will show that in the context of Non Standard Mathematical Analysis (NSA) and Hyperreal Numerical System R, the two theorems are equivalent. The difference between them becomes a matter of scale. With the scale changes that the hyperreal number system allows, the discrete variables and functions become continuous, and Shannon’s sampling theorem emerges from the discrete sampling theorem.

Signal Recovery

2009 ◽  
Author(s):  
Robert J Marks II
Keyword(s):  
Interpolation Problem ◽  
Super Resolution ◽  
Sampling Theorem ◽  
Signal Recovery ◽  
Continuous Sampling ◽  
Bandlimited Signals ◽  
Special Cases ◽  
Extrapolation Problem ◽  
Definition Of

The literature on the recovery of signals and images is vast (e.g., [23, 110, 112, 257, 391, 439, 791, 795, 933, 934, 937, 945, 956, 1104, 1324, 1494, 1495, 1551]). In this Chapter, the specific problem of recovering lost signal intervals from the remaining known portion of the signal is considered. Signal recovery is also a topic of Chapter 11 on POCS. To this point, sampling has been discrete. Bandlimited signals, we will show, can also be recovered from continuous samples. Our definition of continuous sampling is best presented by illustration.Asignal, f (t), is shown in Figure 10.1a, along with some possible continuous samples. Regaining f (t) from knowledge of ge(t) = f (t)Π(t/T) in Figure 10.1b is the extrapolation problem which has applications in a number of fields. In optics, for example, extrapolation in the frequency domain is termed super resolution [2, 40, 367, 444, 500, 523, 641, 720, 864, 1016, 1099, 1117]. Reconstructing f (t) from its tails [i.e., gi(t) = f (t){1 − Π(t/T)}] is the interval interpolation problem. Prediction, shown in Figure 10.1d, is the problem of recovering a signal with knowledge of that signal only for negative time. Lastly, illustrated in Figure 10.1e, is periodic continuous sampling. Here, the signal is known in sections periodically spaced at intervals of T. The duty cycle is α. Reconstruction of f (t) from this data includes a number of important reconstruction problems as special cases. (a) By keeping αT constant, we can approach the extrapolation problem by letting T go to ∞. (b) Redefine the origin in Figure 10.1e to be centered in a zero interval. Under the same assumption as (a), we can similarly approach the interpolation problem. (c) Redefine the origin as in (b). Then the interpolation problem can be solved by discarding data to make it periodically sampled. (d) Keep T constant and let α → 0. The result is reconstructing f (t) from discrete samples as discussed in Chapter 5. Indeed, this model has been used to derive the sampling theorem [246]. Figures 10.1b-e all illustrate continuously sampled versions of f (t).

Reconstructing Digital Signals Using Shannon's Sampling Theorem

1997 ◽  
Vol 13 (2) ◽  
pp. 226-238 ◽  
Author(s):  
Joseph Hamill ◽  
Graham E. Caldwell ◽  
Timothy R. Derrick
Keyword(s):  
Time Series ◽  
Critical Frequency ◽  
Spline Interpolation ◽  
Series Representation ◽  
Sampling Theorem ◽  
Frequency Characteristics ◽  
Digital Data ◽  
Original Signal ◽  
Frequency Content ◽  
Shannon’S Sampling Theorem

Researchers must be cognizant of the frequency content of analog signals that they are collecting. Knowing the frequency content allows the researcher to determine the minimum sampling frequency of the data (Nyquist critical frequency), ensuring that the digital data will have all of the frequency characteristics of the original signal. The Nyquist critical frequency is 2 times greater than the highest frequency in the signal. When sampled at a rate above the Nyquist, the digital data will contain all of the frequency characteristics of the original signal but may not present a correct time-series representation of the signal. In this paper, an algorithm known as Shannon's Sampling Theorem is presented that correctly reconstructs the time-series profile of any signal sampled above the Nyquist critical frequency. This method is superior to polynomial or spline interpolation techniques in that it can reconstruct peak values found in the original signal but missing from the sampled data time-series.

Sign in / Sign up

Export Citation Format

Share Document