Difference (from prior major revision)
(minor diff)
Changed: 5c5
Formally, the discrete Fourier transform is a functionF : Cn->Cn (where C denotes the set of complex numbers). The n complex numbers x0, ...., xn-1 are transformed into the n complex numbers f0, ..., fn-1 according to the formula
Formally, the discrete Fourier transform is a functionF : Cn->Cn (where C denotes the set of complex numbers. The unicode symbol ℱ is also used to represent the Fourier transform function). The n complex numbers x0, ...., xn-1 are transformed into the n complex numbers f0, ..., fn-1 according to the formula