Winograd Transform

A discrete Fast Fourier Transform Algorithm which can be implemented for $N=2$, 3, 4, 5, 7, 8, 11, 13, and 16 points.

See also Fast Fourier Transform