The Fast Fourier Transform (FFT) method was introduced in 1991 by Goodman, Draine, and Flatau for the discrete dipole approximation. They utilized a 3D FFT GPFA written by Clive Temperton. The interaction matrix was extended to twice its original size to incorporate negative lags by mirroring and reversing the interaction matrix. Several variants have been developed since then. Barrowes, Teixeira, and Kong in 2001 developed a code that uses block reordering, zero padding, and a reconstruction algorithm, claiming minimal memory usage. McDonald, Golden, and Jennings in 2009 used a 1D FFT code and extended the interaction matrix in the x, y, and z directions of the FFT calculations, suggesting memory savings due to this approach. This variant was also implemented in the MATLAB 2021 code by Shabaninezhad and Ramakrishna. Other techniques to accelerate convolutions have been suggested in a general context along with faster evaluations of Fast Fourier Transforms arising in DDA problem solvers.