Content deleted Content added
m →Recursive factorizations and FFTs: - Converted mathematical expressions |
Added link to "Polynomial remainder theorem" |
||
Line 25:
:<math>X_k = x(\omega_N^k) = x(z) \mod (z - \omega_N^k)</math>
where '''mod''' ([[modulo]]) denotes the [[Polynomial remainder theorem|polynomial remainder]] operation. The key to fast algorithms like Bruun's or Cooley-Tukey comes from the fact that one can perform this set of ''N'' remainder operations in recursive stages.
== Recursive factorizations and FFTs ==
| |||