Optical Computing, Fourier Transform, Silicon Photonics, Signal Processing.
length We denote by FT the discrete two-dimensional Fourier transform. For an array A and each pair of integers (j,k) such that 1≤j≤Nx and 1≤k≤Ny, the 2-dimensional discrete Fourier transform is: We assume the device we work with has a rectangular input array of pixels, with sides given by two