Bruun's FFT algorithm: Difference between revisions

Revision as of 23:08, 11 January 2010

Revision as of 23:09, 11 January 2010

Line 11:

k = 0,\dots,N-1. </math>

For convenience, let us denote the ''N'' [[root of unity|roots of unity]] by ω_''N''^''n'' (''n''&nbsp;=&nbsp;0,&nbsp;...,&nbsp;''N''&nbsp;&minus;&nbsp;1):

:<math>\omega_N^n = e^{-\frac{2\pi i}{N} n }</math>