The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Shannon sampling theorem—Its various extensions and applications: A tutorial review
Abstract
It has been almost thirty years since Shannon introduced the sampling theorem to communications theory. In this review paper we will attempt to present the various contributions made for the sampling theorems with the necessary mathematical details to make it self-contained. We will begin by a clear statement of Shannon's sampling theorem followed by its applied interpretation for time-invariant systems. Then we will review its origin as Whittaker's interpolation series. The extensions will include sampling for functions of more than one variable, random processes, nonuniform sampling, nonband-limited functions, implicit sampling, generalized functions (distributions), sampling with the function and its derivatives as suggested by Shannon in his original paper, and sampling for general integral transforms. Also the conditions on the functions to be sampled will be summarized. The error analysis of the various sampling expansions, including specific error bounds for the truncation, aliasing, jitter and parts of various other errors will be discussed and summarized. This paper will be concluded by searching the different recent applications of the sampling theorems in other fields, besides communications theory. These include optics, crystallography, time-varying systems, boundary value problems, spline approximation, special functions, and the Fourier and other discrete transforms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - I
Slepian, D., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03976.x · Cited by 2,492
Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty - II
Landau, H. J., & Pollak, H. O. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03977.x · Cited by 839
Cited by
Capacity Limits of Optical Fiber Networks
Essiambre, R.-J., Kramer, G., Winzer, P. J., Foschini, G. J., & Goebel, B. (2010) · Journal of Lightwave Technology · doi:10.1109/jlt.2009.2039464 · Cited by 2,362
Jiang, P., Qian, X., & Yang, R. (2018) · Journal of Applied Physics · doi:10.1063/1.5046944 · Cited by 424
Low-dose CT reconstruction via edge-preserving total variation regularization
Tian, Z., Jia, X., Yuan, K., Pan, T., & Jiang, S. B. (2011) · Physics in Medicine and Biology · doi:10.1088/0031-9155/56/18/011 · Cited by 396
Johansson, H., & Lowenborg, P. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.804089 · Cited by 176
Optimising sampling rates for accelerometer-based human activity recognition
Khan, A., Hammerla, N., Mellor, S., & Plötz, T. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2016.01.001 · Cited by 171
Metadata
- Authors
- Jerri, A. J.
- Venue
- Proceedings of the IEEE
- Published
- 1977
- Volume
- 65
- Issue
- 11
- Pages
- 1565-1596
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2084052726
- Cited by
- 1,749
- References
- 3
- FWCI
- 11.04
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Shannon sampling theorem—Its various extensions and applications: A tutorial review. https://app.cochat.ai/papers/10.1109/proc.1977.10771
- The paper
- Jerri, A. J. (1977). The Shannon sampling theorem—Its various extensions and applications: A tutorial review. Proceedings of the IEEE. https://doi.org/10.1109/proc.1977.10771
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.