Line 1: Line 1:
 
= Discrete Fourier Transform =
 
= Discrete Fourier Transform =
 +
Please help building this page!
 +
*Let's try to follow the same table syntax as for [[CT_Fourier_Transform_(frequency_in_hertz)|this table]]
 +
*You can copy and paste the formulas from these pages:
 +
**[[Student_summary_Discrete_Fourier_transform_ECE438F09]]
 +
**[[Discrete_Time_Fourier_Transform_Properties_(DTFT)_-_Mohammed_Almathami]]
  
−
Definition: let x[n] be a DT signal with Period N.
+
{|
−
   
+
|-
−
<math> X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}</math>
+
! style="background: none repeat scroll 0% 0% rgb(228, 188, 126); font-size: 110%;" colspan="2" | Discrete Fourier Transform Pairs and Properties  [[More on CT Fourier transform|(info)]]
 +
|-
 +
! style="background: none repeat scroll 0% 0% rgb(238, 238, 238);" colspan="2" | Definition CT Fourier Transform and its Inverse
 +
|-
 +
| align="right" style="padding-right: 1em;" | [[Discrete Fourier Transform|Discrete Fourier Transform]]
 +
| <math>X [k] = \sum_{k=0}^{N-1} x[n]e^{-j 2\pi \frac{k n}{N}} \, </math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | Inverse Discrete Fourier Transform
 +
| <math>\,x [n] = (1/N) \sum_{k=0}^{N-1} X[k] e^{j 2\pi\frac{kn}{N}} \,</math>
 +
|}
  
−
<math> x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}</math>
+
{|
 +
|-
 +
! style="background: none repeat scroll 0% 0% rgb(238, 238, 238);" colspan="4" | Discrete Fourier Transform Pairs [[Discrete Fourier Transform| (info)]]
 +
|-
 +
| align="right" style="padding-right: 1em;" |
 +
| <span class="texhtml">''x''[''n'']</span>
 +
| <math>\longrightarrow</math>
 +
| <math> X[k] </math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | name
 +
| <math>type signal here\ </math>  
 +
|
 +
| <math> type transform here \! \ </math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | name
 +
| <math>type signal here \ </math>
 +
|
 +
| <math>type transform here</math>
 +
|}
  
−
Please help building this page!
+
{|
−
 
+
|-
−
*You can copy the table syntax from [[CT_Fourier_Transform_(frequency_in_hertz)|this page]]
+
! style="background: none repeat scroll 0% 0% rgb(238, 238, 238);" colspan="4" | Discrete Fourier Transform Properties
−
*You can copy and paste the formulas from these pages:
+
|-
−
**[[Student_summary_Discrete_Fourier_transform_ECE438F09]]
+
| align="right" style="padding-right: 1em;" |
−
**[[Discrete_Time_Fourier_Transform_Properties_(DTFT)_-_Mohammed_Almathami]]
+
| <span class="texhtml">''x''[''n'']</span>
 +
| <math>\longrightarrow</math>
 +
| <math> X[k] </math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | multiplication property
 +
| <math>x[n]y[n] \ </math>
 +
|
 +
| <math> write DFT here</math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | convolution property
 +
| <math>x(t)*y(t) \!</math>
 +
|
 +
| <math> X(f)Y(f) \!</math>
 +
|-
 +
| align="right" style="padding-right: 1em;" | time reversal
 +
| <math>\ x(-t) </math>
 +
|
 +
| <math>\ X(-f)</math>
 +
|}
  
 +
{|
 +
|-
 +
! style="background: none repeat scroll 0% 0% rgb(238, 238, 238);" colspan="2" | Other Discrete Fourier Transform Properties
 +
|-
 +
| align="right" style="padding-right: 1em;" | property
 +
| <math>type math here</math>
 +
|}
 
----
 
----
 
[[Collective_Table_of_Formulas|Back to Collective Table]]
 
[[Collective_Table_of_Formulas|Back to Collective Table]]
  
 
[[Category:Formulas]]
 
[[Category:Formulas]]

Revision as of 07:11, 23 September 2011

Discrete Fourier Transform

Please help building this page!

Discrete Fourier Transform Pairs and Properties (info)
Definition CT Fourier Transform and its Inverse
Discrete Fourier Transform $ X [k] = \sum_{k=0}^{N-1} x[n]e^{-j 2\pi \frac{k n}{N}} \, $
Inverse Discrete Fourier Transform $ \,x [n] = (1/N) \sum_{k=0}^{N-1} X[k] e^{j 2\pi\frac{kn}{N}} \, $
Discrete Fourier Transform Pairs (info)
x[n] $ \longrightarrow $ $ X[k] $
name $ type signal here\ $ $ type transform here \! \ $
name $ type signal here \ $ $ type transform here $
Discrete Fourier Transform Properties
x[n] $ \longrightarrow $ $ X[k] $
multiplication property $ x[n]y[n] \ $ $ write DFT here $
convolution property $ x(t)*y(t) \! $ $ X(f)Y(f) \! $
time reversal $ \ x(-t) $ $ \ X(-f) $
Other Discrete Fourier Transform Properties
property $ type math here $

Back to Collective Table

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Discrete_Fourier_Transform_table&oldid=47382"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett