Abstract
Shannon gave the sampling theorem about the band-limited functions in 1948, but the Shannon’s theorem cannot adapt to the need of modern high technology. This paper gives a new high-speed sampling theorem which has a fast convergence rate, a high precision, and a simple algorithm. A practical example has been used to verify its efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jerry A. J., The Shannon sampling theorem, Proc. IEE, 1977, 65:1565–1596
Natterer F., Efficient evaluation of oversampled funtions, J. Comput. Appl. Math., 1986, 14:303–309
Author information
Authors and Affiliations
About this article
Cite this article
Peng, R. Data compression in information technology—High speed sampling theorems. J. of Shanghai Univ. 3, 7–17 (1999). https://doi.org/10.1007/s11741-999-0022-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11741-999-0022-7