Generalizations of the sampling theorem: Seven decades after Nyquist
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
The sampling theorem is one of the most basic and fascinating topics in engineering sciences. The most well-known form is Shannon's uniform-sampling theorem for bandlimited signals. Extensions of this to bandpass signals and multiband signals, and to nonuniform sampling are also well-known. The connection between such extensions and the theory of filter banks in DSP has been well established. This paper presents some of the less known aspects of sampling, with special emphasis on non bandlimited signals, pointwise stability of reconstruction, and reconstruction from nonuniform samples. Applications in multiresolution computation and in digital spline interpolation are also reviewed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A theory for multiresolution signal decomposition: the wavelet representation
Mallat, S. G. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192463 · Cited by 21,372 · cited 2×
“Mallat [8] proposed a clever way to avoid such filtering byoversampling at a much higher resolution.”
BackgroundDaubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Communication in the presence of noise
Shannon, C. E. (1949) · Proceedings of the IRE · doi:10.1109/jrproc.1949.232969 · Cited by 6,539
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004 · cited 1×
“Recall that L2 denotes the Hilbert space [7] of functions with finite energy ‖x(t)‖2 = ∫ |x(t)|2dt.”
BackgroundMultirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
Self-citationCertain Topics in Telegraph Transmission Theory
Nyquist, H. (1928) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1928.5055024 · Cited by 3,089
The Shannon sampling theorem—Its various extensions and applications: A tutorial review
Jerri, A. J. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10771 · Cited by 1,749 · cited 2×
“multiband signals, and to nonuniform sampling are also well-known [ 6 ], [22].”
BackgroundSampling-50 years after Shannon
Unser, M. (2000) · Proceedings of the IEEE · doi:10.1109/5.843002 · Cited by 1,358 · cited 2×
“Then, use the -fold upsampler or expander [20] indicated as , followed by the interpolation filter which is obtained by sampling using the finer spacing .”
BackgroundMethod
Cited by
Robust Recovery of Signals From a Structured Union of Subspaces
Eldar, Y. C., & Mishali, M. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030471 · Cited by 1,044
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Xampling: Signal Acquisition and Processing in Union of Subspaces
Mishali, M., Eldar, Y. C., & Elron, A. J. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161472 · Cited by 311
A Theory for Sampling Signals From a Union of Subspaces
Lu, Y. M., & Do, M. N. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914346 · Cited by 286
Metadata
- Authors
- Vaidyanathan, P. P.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2001
- Volume
- 48
- Issue
- 9
- Pages
- 1094-1109
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2148909075
- Cited by
- 223
- References
- 25
- FWCI
- 6.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.