Added to Favorites

Related Searches

Definitions

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. It is also known as Rayleigh's energy theorem, after John William Strutt, Lord Rayleigh. ## Statement of Parseval's theorem

## Applications

## Equivalence of the norm and inner product forms

## See also

## Notes

## References

## External links

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.

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

- $A(x)=sum\_\{n=-infty\}^infty\; a\_ne^\{inx\}$ and $B(x)=sum\_\{n=-infty\}^infty\; b\_ne^\{inx\}$

respectively. Then

- $sum\_\{n=-infty\}^infty\; a\_noverline\{b\_n\}\; =\; frac\{1\}\{2pi\}\; 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\}\{2pi\}\; 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: $a\_0$ real, $a\_\{-n\}\; =\; overline\{a\_n\}$, $b\_0$ real, and $b\_\{-n\}\; =overline\{b\_n\}$. In this case:

- $a\_0\; b\_0\; +\; 2\; Re\; sum\_\{n=1\}^infty\; a\_noverline\{b\_n\}\; =\; frac\{1\}\{2pi\}\; int\_\{-pi\}^pi\; A(x)\; B(x)dx,$

where $Re$ denotes the real part. (In the notation of the Fourier series article, replace $a\_n$ and $b\_n$ by $a\_n\; /\; 2\; -\; i\; b\_n\; /\; 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\}\{2pi\}\; int\_\{-pi\}^\{pi\}\; |\; X(e^\{jphi\})\; |^2\; dphi$

- 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.

We shall refer to

- $int\_\{-infty\}^infty\; x(t)overline\{y\}(t)\; dt\; =\; int\_\{-infty\}^infty\; X(f)overline\{Y\}(f)\; df$

- $int\_\{-infty\}^infty\; |x(t)|^2\; dt\; =\; int\_\{-infty\}^infty\; |X(f)|^2\; df$

- $aoverline\{b\}\; =\; frac\{1\}\{4\}(|a+b|^2\; +\; i|a+ib|^2\; +\; i^2|a+i^2b|^2\; +\; i^3|a+i^3b|^2),$

- 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.
- David W. Kammler, A First Course in Fourier Analysis (Prentice-Hall, Inc., Upper Saddle River, NJ, 2000) p. 74.

- 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.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Thursday October 09, 2008 at 08:06:42 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Thursday October 09, 2008 at 08:06:42 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.