Parseval's theorem

From Wikipedia, the free encyclopedia

In mathematics, Parseval's theorem usually refers to the result that the Fourier transform is unitary; loosely, that the sum (or integral) of the square of a function is equal to the sum (or integral) of the square of its transform. It originates from a 1799 theorem about series by Marc-Antoine Parseval, which was later applied to the Fourier series.

Although the term "Parseval's theorem" is often used to describe the unitarity of any Fourier transform, especially in physics and engineering, the most general form of this property is more properly called the Plancherel theorem.

Contents

Suppose that A(x) and B(x) are two Riemann integrable, complex-valued functions on R of period 2π with (formal) Fourier series

\sum_{n=-\infty}^\infty a_ne^{inx} and \sum_{n=-\infty}^\infty b_ne^{inx}

respectively. Then

\sum_{n=-\infty}^\infty a_n\overline{b_n} = \frac{1}{2\pi} \int_{-\pi}^\pi A(x)\overline{B(x)} dx,

where i is the imaginary unit and horizontal bars indicate complex conjugation.

Parseval, who apparently had confined himself to real-valued functions, actually presented the theorem without proof, considering it to be self-evident. There are various important special cases of the theorem. First, if A = B one immediately obtains:

\sum_{n=-\infty}^\infty |a_n|^2 = \frac{1}{2\pi} \int_{-\pi}^\pi |A(x)|^2 dx,

from which the unitarity of the Fourier series follows.

Second, one often considers only the Fourier series for real-valued functions A and B, which corresponds to the special case: a0 real, a_{-n} = \overline{a_n}, b0 real, and b_{-n} =\overline{b_n}. In this case:

a_0 b_0 + 2 \Re \sum_{n=1}^\infty a_n\overline{b_n} = \frac{1}{2\pi} \int_{-\pi}^\pi A(x) B(x)dx,

where \Re denotes the real part. (In the notation of the Fourier series article, replace an and bn by an / 2 − ibn / 2.)

In physics and engineering, Parseval's theorem is often written as:

\int_{-\infty}^{\infty} | x(t) |^2 dt   =   \int_{-\infty}^{\infty} | X(f) |^2 df
where X(f) = \mathcal{F} \{ x(t) \} represents the continuous Fourier transform (in normalized, unitary form) of x(t) and f represents the frequency component (not angular frequency) of x.

The interpretation of this form of the theorem is that the total energy contained in a waveform x(t) summed across all of time t is equal to the total energy of the waveform's Fourier Transform X(f) summed across all of its frequency components f.

For discrete time signals, the theorem becomes:

\sum_{n=-\infty}^{\infty} | x[n] |^2  =  \frac{1}{2\pi} \int_{-\pi}^{\pi} | X(e^{j\phi}) |^2 d\phi
where X is the discrete-time Fourier transform (DTFT) of x and φ represents the angular frequency (in radians per sample) of x.

Alternatively, for the discrete Fourier transform (DFT), the relation becomes:

\sum_{n=0}^{N-1} | x[n] |^2  =   \frac{1}{N} \sum_{k=0}^{N-1} | X[k] |^2
where X[k] is the DFT of x[n], both of length N.

  • Parseval, MacTutor History of Mathematics archive.
  • George B. Arfken and Hans J. Weber, Mathematical Methods for Physicists (Harcourt: San Diego, 2001).
  • Hubert Kennedy, Eight Mathematical Biographies (Peremptory Publications: San Francisco, 2002).
  • Alan V. Oppenheim and Ronald W. Schafer, Discrete-Time Signal Processing 2nd Edition (Prentice Hall: Upper Saddle River, NJ, 1999) p 60.
  • William McC. Siebert, Circuits, Signals, and Systems (MIT Press: Cambridge, MA, 1986), pp. 410-411.

  • Parseval's Theorem on Mathworld
  • In the movie Good Will Hunting, the theorem that Professor Lambeau finishes writing on the classroom chalkboard just after we first see him is Parseval's theorem. [1]
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.