Fast Fourier transform: Difference between revisions

Revision as of 16:51, 26 February 2007

Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). The fast Fourier transform reduces the number of operations from $N^{2}$ to $N\ln N$ .

Revision as of 16:52, 23 February 2007 (edit) Carl McBride (talk \| contribs) m (New page: Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). The fast Fourier transform reduces the number of operations from <math>N^2</math> to <math>N \ln N</math>. ==References== #J...)		Revision as of 16:51, 26 February 2007 (edit) (undo) Carl McBride (talk \| contribs) m (→‎References) Newer edit →
Line 3:		Line 3:

	==References==		==References==
	#James W. Cooley and John W. Tukey", "An Algorithm for the Machine Calculation of Complex Fourier Series", Mathematics of Computation '''19''' pp. 297- (1965)		#[http://links.jstor.org/sici?sici=0025-5718%28196504%2919%3A90%3C297%3AAAFTMC%3E2.0.CO%3B2-7 James W. Cooley and John W. Tukey", "An Algorithm for the Machine Calculation of Complex Fourier Series", Mathematics of Computation '''19''' pp. 297-301 (1965)]