Example: confidence

Inverse Discrete Fourier transform (DFT)

The inverse (i)DFT of X is defined as the signal x : [0, N 1] !C with components x(n) given by the expression x(n) := 1 p N N 1 å k=0 X(k)ej2pkn/N = 1 p N N 1 å k=0 X(k)exp(j2pkn/N) (1) When x is obtained from X through the relationship in (1) we write x = F 1(X). Recall that if X is the DFT of some signal, it must be peri-odic with period N.

Tags:

  Inverse

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of Inverse Discrete Fourier transform (DFT)

Related search queries