(New page: The discrete Fourier transform of x[n], a discrete-time signal with Period N, is: <math> X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}.</math> Please assign the "discrete Fourier tran...) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
Please assign the "discrete Fourier transform" category to any page that either discusses or uses the discrete Fourier transform (DFT). | Please assign the "discrete Fourier transform" category to any page that either discusses or uses the discrete Fourier transform (DFT). | ||
| + | ---- | ||
| + | ==Top Pages in the category "discrete Fourier transform" (DFT)== | ||
| + | *[[Discrete_Fourier_Transform_table|Table of Discrete Fourier transform pairs and properties]] | ||
| + | *[[Student_summary_Discrete_Fourier_transform_ECE438F09|Student summary of DFT]] | ||
| + | ---- | ||
Latest revision as of 06:50, 21 April 2013
The discrete Fourier transform of x[n], a discrete-time signal with Period N, is:
$ X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}. $
Please assign the "discrete Fourier transform" category to any page that either discusses or uses the discrete Fourier transform (DFT).
Top Pages in the category "discrete Fourier transform" (DFT)
Pages in category "Discrete Fourier transform"
The following 25 pages are in this category, out of 25 total.
CDEHI |
L |
L cont.MNPS |
