Fourier Transform, Optical Computing, Free Space Optics.
exactly what we need. But what if you want a 1D FT instead? Fortunately, this requires only a minor change to this algorithm. In the above description, the first and last steps are the most computationally intensive: they each require N FTs of size N, with a total complexity in O(N³) when done