Information and communication theory, circuits Theorem
Landau's necessary density conditions for sampling
Statement
Let and let be a compact set of positive measure whose boundary has Lebesgue measure zero. Let be the space of band-limited functions with spectrum in : the whose Fourier transform vanishes outside . Let be uniformly discrete, that is, . Define the lower and upper Beurling densities
- If is a sampling set for , that is, there are with for all , then .
- If is an interpolation set for , that is, for every square-summable there is with for all , then .
Here is the Lebesgue measure of .
Remarks
Henry Landau proved these conditions in 1967. The proof compares the eigenvalues of two concentration operators: the operator that restricts to a large cube, and its discrete analogue on the samples in that cube. The number of eigenvalues of the first operator that are not close to or is small compared with the volume of the cube. The main count is .
Example: for and , the integers form a sampling and interpolation set, and . This is the critical case of the Nyquist–Shannon sampling theorem. So uniform sampling at the Nyquist rate is optimal, and no irregular scheme can sample stably at a lower average rate.
Since , the set is a sampling set if and only if the exponentials , , form a frame of . It is a sampling and interpolation set if and only if they form a Riesz basis of , and then both parts give .
Going deeper
For a student
The Shannon sampling theorem gives a sufficient condition for one regular lattice. Landau's theorem gives a necessary condition for every uniformly discrete set, measured by the Beurling densities. It shows that the Nyquist rate is sharp also for irregular sampling. It also implies that a Riesz basis of exponentials for must have uniform density exactly , which links it with the theory of nonharmonic Fourier series. The theorem has analogues for Gabor systems and for other spaces of functions with localized transforms.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Band-limited function concept
- Fourier transform concept
- Lp space concept
- Landau's necessary density conditions for sampling statement
Further reading
About this page
| Tag | XWV6VS7BQM |
|---|---|
| URI | m2://XWV6VS7BQM |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 94A20, 42C15, 30D15 |
| Status | This copy of the site has no build data. Run m2 status XWV6VS7BQM. |
| About | Band-limited function |
| Uses | Band-limited function, Fourier transform, Lp space |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.