Rader's FFT algorithm: Difference between revisions

Content deleted Content added
added new article
 
typo
Line 17:
The final summation, above, is precisely a cyclic convolution of the two sequences ''a''<sub>''q''</sub> and ''b''<sub>''q''</sub> of length ''n''-1 (''q'' = 0,...,''n''-2) defined by:
 
:<math>a_q = x_{g^q}m</math>
:<math>b_q = e^{-\frac{2\pi i}{n} g^q }.</math>