Optical Computing, Fourier Transform, Silicon Photonics, Signal Processing.
making use of symmetry we only need to calculate half of the twiddle factors and we still gain all the information we need to calculate the next recursion! So for our sequence of 8 values, only 24 operations need to be performed. For n inputs, this is O(n log n) operations, much fewer than the 64