Table 8 Savings in the number of arithmetic operations attained with the DFT_COMM algorithm in comparison with the competing SRFFT (noprun) and SRFFT_{pruning-time-shift} methods for N = 1024

SRFFT(noprun)

{2¹,2²,…, N}

N = 2¹⁰

DFT_COMM, 38.22 % with input pruning

SRFFT_{pruning-time-shift}

DFT_COMM, 8.71 % with input pruning

SRFFT(noprun)

90

DFT_COMM, 59.22 % with input-output pruning at the same time

SRFFT_{pruning-time-shift}

SRFFT_{pruning-time-shift} fails to deliver a result

SRFFT(noprun)

13

DFT_COMM, 82.45 % with input-output pruning at the same time

SRFFT_{pruning-time-shift}

SRFFT_{pruning-time-shift} fails to deliver a result