Jump to content

Poisson summation formula: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
add a sentence
same info, easier to follow
Line 3: Line 3:
== Definition ==
== Definition ==


For appropriate functions<ref>{{EquationNote|Eq.1}} assumes &fnof; is integrable and <math>\sum_{k=-\infty}^{\infty}\left|\hat f\left(\frac{k}{T}\right)\right|<\infty.</math>&nbsp; {{harv|Grafakos|2004}}</ref>, &fnof;, the Poisson summation formula may be stated as''':'''
The Poisson summation formula may be stated as''':''' {{harv|Pinsky|2002}} {{harv|Zygmund|1968}}


:<math>\sum_{n=-\infty}^\infty f(nT)=\frac{1}{T}\sum_{n=-\infty}^\infty \hat f\left(\frac{n}{T}\right),</math>
{{NumBlk|:|<math>\underbrace{\sum_{n=-\infty}^{\infty} f(t + nT)}_{\varphi_T(t)
} = \frac{1}{T} \sum_{k=-\infty}^{\infty} \hat f\left(\frac{k}{T}\right)\ e^{2\pi i \frac{k}{T} t},</math>|{{EquationRef|Eq.1}}}}


where <math>\hat f</math> is the Fourier transform<ref>
where


:<math>\hat{f}(\nu)\ \stackrel{\mathrm{def}}{=}\int_{-\infty}^{\infty} f(x)\ e^{-2\pi i\nu x}\, dx.</math>
<math>\hat{f}(\nu)\ \stackrel{\mathrm{def}}{=}\int_{-\infty}^{\infty} f(x)\ e^{-2\pi i\nu x}\, dx.</math></ref> of <math>f,\,</math> &nbsp;<math>\varphi_T</math> is a periodic extension of <math>f,\,</math> and <math>T</math> is the period of <math>\varphi_T.</math>


There is a second version of the Poisson summation formula that is equivalent for nice enough functions, and which relies on the notion of a periodic extension.


For ''t''=0&nbsp; {{EquationNote|Eq.1}} reduces<ref>{{harv|Pinsky|2002}}{{harv|Zygmund|1968}}</ref> to''':'''
The ''Periodic extension'' of a function is a new function formed by shifting the original function by multiples of some period, '''T''', and adding all the copies together. The periodic extension of a function &fnof;(''t'') can be written''':'''


{{NumBlk|:|<math>\sum_{n=-\infty}^\infty f(nT)=\frac{1}{T}\sum_{k=-\infty}^\infty \hat f\left(\frac{k}{T}\right),</math>|{{EquationRef|Eq.2}}}}
:<math>
\varphi_T(t)\ \stackrel{\mathrm{def}}{=}\ \sum_{n=-\infty}^{\infty} f(t + nT).</math>


which holds under the less restrictive conditions that 0 is a point of continuity of φ<sub>''T''</sub>(''t''). This may fail to be the case even when both <math>f</math> and <math>\hat{f}</math> are continuous and the sums converge absolutely {{harv|Katznelson|1976}}.
Assuming <math>f</math> is integrable and that <math>\sum_{k=-\infty}^{\infty}\left|\hat f\left(\frac{k}{T}\right)\right|<\infty,</math>&nbsp; it can be shown below that''':''' {{harv|Grafakos|2004}}


=== Notes ===
{{NumBlk|:|<math>\varphi_T(t) = \frac{1}{T} \sum_{k=-\infty}^{\infty} \hat f\left(\frac{k}{T}\right)\ e^{2\pi i \frac{k}{T} t}.</math>|{{EquationRef|Eq.1}}}}
{{reflist}}


For the special case ''t''=0&nbsp; {{EquationNote|Eq.1}} reduces to the version of the Poisson summation formula given above. The first version holds under the less restrictive conditions that 0 is a point of continuity of φ<sub>''T''</sub>(''t''). This may fail to be the case even when both <math>f</math> and <math>\hat{f}</math> are continuous and the sums converge absolutely {{harv|Katznelson|1976}}.


==Intuitive derivation of the Poisson summation formula==
==Derivation of the Poisson summation formula==


The function φ<sub>''T''</sub>(''t'') is periodic, with period ''T''. It can therefore be expanded into a [[Fourier_series#Fourier_series_on_a_general_interval_.5Ba.2Cb.5D|Fourier series]],whose coefficients are given by''':'''
The right-hand side of {{EquationNote|Eq.1}} has the form of a [[Fourier_series#Fourier_series_on_a_general_interval_.5Ba.2Cb.5D|Fourier series]]. So it is sufficient to show that the Fourier series coefficients of <math>\varphi_T(t)</math> are <math>\frac{1}{T}\ \hat f\left(\frac{k}{T}\right)</math>, as follows''':'''


:<math>
:<math>
Line 50: Line 49:
\end{align}
\end{align}
</math>
</math>

Substitution of these coefficients into the Fourier series produces &nbsp;{{EquationNote|Eq.1}}.


==Applications of the Poisson summation formula==
==Applications of the Poisson summation formula==

Revision as of 13:26, 21 March 2009

The Poisson summation formula is an equation relating the Fourier series coefficients of the periodic extension of a function to values in the function's continuous Fourier transform. In other words, the periodic extension of a function in one domain is completely defined by discrete samples of the original function in the other domain. The Poisson summation formula was discovered by Siméon Denis Poisson and is sometimes called Poisson resummation.

Definition

For appropriate functions[1], ƒ, the Poisson summation formula may be stated as:

(Eq.1)

where is the Fourier transform[2] of   is a periodic extension of and is the period of


For t=0  Eq.1 reduces[3] to:

(Eq.2)

which holds under the less restrictive conditions that 0 is a point of continuity of φT(t). This may fail to be the case even when both and are continuous and the sums converge absolutely (Katznelson 1976).

Notes

  1. ^ Eq.1 assumes ƒ is integrable and   (Grafakos 2004)
  2. ^
  3. ^ (Pinsky 2002)(Zygmund 1968)


Derivation of the Poisson summation formula

The right-hand side of Eq.1 has the form of a Fourier series. So it is sufficient to show that the Fourier series coefficients of are , as follows:

With a change of variables this becomes:

Applications of the Poisson summation formula

The Poisson Summation formula may be used to give a proof of the Shannon Sampling theorem (Pinsky 2002). It also provides a connection between Fourier analysis on the circle and the real line. (Grafakos 2004).

Computationally, the Poisson summation formula is useful since a slowly converging summation in real space is guaranteed to be converted into a quickly converging equivalent summation in Fourier space. (A broad function in real space becomes a narrow function in Fourier space and vice versa.) This is the essential idea behind Ewald summation.

Convergence conditions

Some conditions restricting must naturally be applied to have convergence. A useful way to get around stating those precisely is to use the language of distributions. Let δ(t) be the Dirac delta function. Then if we write

summed over all integers n, we have that Δ is a distribution (a so-called Dirac comb), because applied to any test function we get a bi-infinite sum that has very small 'tails'. Then one may interpret the summation formula as saying that is its own Fourier transform.

Again this depends on precise normalization in the transform, but it conveys good information about the variance of the formula. For example, for constant a ≠ 0 it would follow that

is the Fourier transform of

Therefore we can always find a spacing λZ of the integers, such that placing a delta-function at each of those points is its own transform, and each normalization will have a corresponding valid formula. It also suggests a method of proof that is intuitive: put instead a Gaussian centered at each integer, calculate using the known Fourier transform of a Gaussian, and then let the width of all the Gaussians become small.

Generalizations

There is a version in n dimensions that is easy to formulate. Given a lattice Λ in Rn, there is a dual lattice Λ′ (defined by vector space or Pontryagin duality, as one wishes). Then the statement is that the sum of delta-functions at each point of Λ, and at each point of Λ′, are again Fourier transforms as distributions, subject to correct normalization.

This is applied in the theory of theta functions, and is a possible method in geometry of numbers. In fact in more recent work on counting lattice points in regions it is routinely used − summing the indicator function of a region D over lattice points is exactly the question, so that the LHS of the summation formula is what is sought and the RHS something that can be attacked by mathematical analysis.

Further generalisation to locally compact abelian groups is required in number theory. In non-commutative harmonic analysis, the idea is taken even further in the Selberg trace formula, but takes on a much deeper character.

Literature

  • J.J. Benedetto; G. Zimmermann: Sampling multipliers and the Poisson summation formula. J. Fourier Ana. App. 3(1997)5, Preprint online
  • J.R. Higgins: Five short stories about the cardinal series. Bull. AMS 12(1985)1, Online at Project Open Euclid
  • Grafakos, Loukas (2004), Classical and Modern Fourier Analysis, Pearson Education, Inc., pp. 253–257, ISBN 0-13-035399-X.
  • Katznelson, Yitzhak (1976), An introduction to harmonic analysis (Second corrected ed.), New York: Dover Publications, Inc, ISBN 0-486-63331-4
  • Pinsky, M. (2002), Introduction to Fourier Analysis and Wavelets., Brooks Cole.
  • Zygmund, Antoni (1968), Trigonometric series (2nd ed.), Cambridge University Press (published 1988), ISBN 978-0521358859.