The sampling window (Corresp.)

TL;DR: In this paper, an optimal sampling interpolation algorithm is developed that allows the accurate recovery of scattered or radiated fields over a sphere from a minimum number of samples, using the concept of the field equivalent (spatial) bandwidth, a central interpolation scheme is developed to compute the field in theta, phi coordinates, starting from its samples.

TL;DR: An optimal sampling interpolation algorithm which allows the accurate recovery of plane-rectangular near-field samples from the knowledge of the plane-polar ones is developed, and it is shown that it can be significantly greater than lambda /2 as the measurement place moves away from the source.

TL;DR: In this article, the relationship between information theory and the physics of wave propagation is discussed, and applications for sensing and signal reconstruction, wireless communication, and networks of multiple transmitters and receivers are reviewed.

TL;DR: The authors focus their attention on elevation input data, noting that natural surfaces exhibit fractal properties, and deals with the simulation of synthetic aperture radar raw signal of actual ground sites described in terms of sparse input data.

TL;DR: In this article, the authors consider a function of a variable x such that its Taylor expansion in any part of the plane of the complex variable x can be derived from its Taylor's expansion in another part by the process of analytic continuation.

TL;DR: A new series for the interpolation of band-limited functions is found by using an approximation to tho prolate spheroidal wave function as a convergence factor and it is shown that this bound is lower than other known bounds in many cases of interest.

TL;DR: In this paper, upper bounds on truncation errors were obtained for the Cardinal and Fogel sampling expansions, and for self-truncating versions of these two sampling expansions; these latter sampling expansions are "self truncating" in the sense that the upper bound on their truncation error is almost always much lower than the upper bounds of their prototype sampling expansions.

TL;DR: In this article, it was shown that the best possible dominant over the complex plane of the class of functions f{z] cannot have complex zeros, and that these results contain two theorems of S. Bernstein.