History of Discrete Fourier transform

Difference (from prior major revision) (minor diff)

Changed: 5c5

Formally, the discrete Fourier transform is a function F : Cⁿ -> Cⁿ (where C denotes the set of complex numbers). The n complex numbers x₀, ...., x_n-1 are transformed into the n complex numbers f₀, ..., f_n-1 according to the formula

Formally, the discrete Fourier transform is a function F : Cⁿ -> Cⁿ (where C denotes the set of complex numbers. The unicode symbol ℱ is also used to represent the Fourier transform function). The n complex numbers x₀, ...., x_n-1 are transformed into the n complex numbers f₀, ..., f_n-1 according to the formula

	Revision 11 . . (edit) December 13, 2001 9:06 am by Bryan Derksen
	Revision 10 . . December 9, 2001 3:42 pm by Bryan Derksen [include mention of the symbol in a compatability-safe manner]
	Revision 9 . . December 9, 2001 11:22 am by AxelBoldt
	Revision 8 . . (edit) December 9, 2001 9:32 am by Bryan Derksen [more unicode]
	Revision 7 . . (edit) December 9, 2001 9:30 am by Bryan Derksen [unicode symbol]
	Revision 6 . . November 17, 2001 1:36 am by AxelBoldt
	Revision 5 . . (edit) November 17, 2001 1:33 am by AxelBoldt
	Revision 4 . . (edit) November 17, 2001 12:05 am by Tbackstr [links]
	Revision 3 . . November 16, 2001 12:15 am by AxelBoldt
	Revision 2 . . (edit) November 14, 2001 4:37 am by Gareth Owen [[[foo\|bar]] the wrong way :(]