Nonuniform sampling

Nonuniform sampling is a branch of sampling theory involving results related to the Nyquist–Shannon sampling theorem. Nonuniform sampling is based on Lagrange interpolation and the relationship between itself and the (uniform) sampling theorem. Nonuniform sampling is a generalisation of the Whittaker–Shannon–Kotelnikov (WSK) sampling theorem.

The sampling theory of Shannon can be generalized for the case of nonuniform samples, that is, samples not taken equally spaced in time. The Shannon sampling theory for non-uniform sampling states that a band-limited signal can be perfectly reconstructed from its samples if the average sampling rate satisfies the Nyquist condition.^[1] Therefore, although uniformly spaced samples may result in easier reconstruction algorithms, it is not a necessary condition for perfect reconstruction.

The general theory for non-baseband and nonuniform samples was developed in 1967 by Henry Landau.^[2] He proved that the average sampling rate (uniform or otherwise) must be twice the occupied bandwidth of the signal, assuming it is a priori known what portion of the spectrum was occupied. In the late 1990s, this work was partially extended to cover signals for which the amount of occupied bandwidth was known, but the actual occupied portion of the spectrum was unknown.^[3] In the 2000s, a complete theory was developed (see the section Beyond Nyquist below) using compressed sensing. In particular, the theory, using signal processing language, is described in this 2009 paper.^[4] They show, among other things, that if the frequency locations are unknown, then it is necessary to sample at least at twice the Nyquist criteria; in other words, you must pay at least a factor of 2 for not knowing the location of the spectrum. Note that minimum sampling requirements do not necessarily guarantee numerical stability.

Lagrange (polynomial) interpolation

For a given function, it is possible to construct a polynomial of degree n which has the same value with the function at n + 1 points.^[5]

Let the n + 1 points to be $z_{0},z_{1},\ldots ,z_{n}$ , and the n + 1 values to be $w_{0},w_{1},\ldots ,w_{n}$ .

In this way, there exists a unique polynomial $p_{n}(z)$ such that

p_{n}(z_{i})=w_{i},{\text{ where }}i=0,1,\ldots ,n.

^[6]

Furthermore, it is possible to simplify the representation of $p_{n}(z)$ using the interpolating polynomials of Lagrange interpolation:

I_{k}(z)={\frac {(z-z_{0})(z-z_{1})\cdots (z-z_{{k-1}})(z-z_{{k+1}})\cdots (z-z_{n})}{(z_{k}-z_{0})(z_{k}-z_{1})\cdots (z_{k}-z_{{k-1}})(z_{k}-z_{{k+1}})\cdots (z_{k}-z_{n})}}

^[7]

From the above equation:

I_{k}(z_{j})=\delta _{{k,j}}={\begin{cases}0,&{\text{if }}k\neq j\\1,&{\text{if }}k=j\end{cases}}

As a result,

p_{n}(z)=\sum _{{k=0}}^{n}w_{k}I_{k}(z)

p_{n}(z_{j})=w_{j},j=0,1,\ldots ,n

To make the polynomial form more useful:

G_{n}(z)=(z-z_{0})(z-z_{1})\cdots (z-z_{n})

In that way, the Lagrange Interpolation Formula appears:

p_{n}(z)=\sum _{{k=0}}^{n}w_{k}{\frac {G_{n}(z)}{(z-z_{k})G'_{n}(z_{k})}}

^[8]

Note that if $f(z_{j})=p_{n}(z_{j}),j=0,1,\ldots ,n,$ , then the above formula becomes:

f(z)=\sum _{{k=0}}^{n}f(z_{k}){\frac {G_{n}(z)}{(z-z_{k})G'_{n}(z_{k})}}

Whittaker–Shannon–Kotelnikov (WSK) sampling theorem

Whittaker tried to extend the Lagrange Interpolation from polynomials to entire functions. He showed that it is possible to construct the entire function^[9]

C_{f}(z)=\sum _{{n=-\infty }}^{\infty }f(a+nW){\frac {\sin[\pi (z-a-nW/W)]}{[\pi (z-a-nW/W)]}}

which has the same value with $f(z)$ at the points $z_{n}=a+nW$

Moreover, $C_{f}(z)$ can be written in a similar form of the last equation in previous section:

C_{f}(z)=\sum _{n=-\infty }^{\infty }f(z_{n}){\frac {G(z)}{G'(z_{n})(z-z_{n})}},{\text{ where }}G(z)=\sin[\pi (z-z_{n})/W]{\text{ and }}z_{n}=a+nW

When a = 0 and W = 1, then the above equation becomes almost the same as WSK theorem:^[10]

If a function f can be represented in the form

f(t)=\int _{{-\sigma }}^{\sigma }e^{{jxt}}g(x)\,dx\qquad (t\in {\mathbb {R}}),\qquad \forall g\in L^{2}(-\sigma ,\sigma ),

then f can be reconstructed from its samples as following:

f(t)=\sum _{{k=-\infty }}^{\infty }f\left({\frac {k\pi }{\sigma }}\right){\frac {\sin(\sigma t-k\pi )}{\sigma t-k\pi }}\qquad (t\in {\mathbb {R}})

Nonuniform sampling

For a sequence $\{t_{k}\}_{{k\in {\mathbb {Z}}}}$ satisfying^[11]

D=\sup _{{k\in {\mathbb {Z}}}}|t_{k}-k|<{\frac {1}{4}},

then

f(t)=\sum _{{k=-\infty }}^{\infty }f(t_{k}){\frac {G(t)}{G'(t_{k})(t-t_{k})}},\qquad \forall f\in B_{\pi }^{2},\qquad (t\in {\mathbb {R}}),

{\text{ where }}G(t)=(t-t_{0})\prod _{{k=1}}^{\infty }\left(1-{\frac {t}{t_{k}}}\right)\left(1-{\frac {t}{t_{{-k}}}}\right),

and

B_{\sigma }^{2}.

is Bernstein space

{\text{and }}f(t)

is uniformly convergent on compact sets.^[12]

The above is called the Paley–Wiener–Levinson theorem, which generalize WSK sampling theorem from uniform samples to non uniform samples. Both of them can reconstruct a band-limited signal from those samples, respectively.

References

↑ Nonuniform Sampling, Theory and Practice (ed. F. Marvasti), Kluwer Academic/Plenum Publishers, New York, 2000
↑ H. J. Landau, “Necessary density conditions for sampling and interpolation of certain entire functions,” Acta Math., vol. 117, pp. 37–52, Feb. 1967.
↑ see, e.g., P. Feng, “Universal minimum-rate sampling and spectrum-blind reconstruction for multiband signals,” Ph.D. dissertation, University of Illinois at Urbana-Champaign, 1997.
↑ Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals, Moshe Mishali and Yonina C. Eldar, in IEEE Trans. Signal Processing, March 2009, Vol 57 Issue 3
↑ Marvasti 2001, p. 124.
↑ Marvasti 2001, pp. 124–125.
↑ Marvasti 2001, p. 126.
↑ Marvasti 2001, p. 127.
↑ Marvasti 2001, p. 132.
↑ Marvasti 2001, p. 134.
↑ Marvasti 2001, p. 137.
↑ Marvasti 2001, p. 138.

F. Marvasti, Nonuniform sampling: Theory and Practice. Plenum Publishers Co., 2001, pp. 123–140.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.