Performance analysis for 2-D convolution implemented with the 2-D Modified Discrete Fourier Transform

Recently the Quadratic Modified Fermat Number Transform (QMFNT) was extended to an analogous Modified Discrete Fourier Transform (MDFT) that enables overlap-add FFT block processing to be implemented without zero padding, resulting in reduced computational complexity and lower power requirements for nanoscale VLSI implementations. The MDFT was then extended into two dimensions and an experimental example was presented to illustrate how the 2-D extension manages two-dimensional wrap around effects. This paper presents an analysis of the how the modulation parameters should be chosen under various circumstances and how the computational complexity of the 2D-MDFT compares with more traditional 2D-FFT block processing.