Skip to main content

Table 7 Savings in the number of arithmetic operations attained with the DFTCOMM algorithm in comparison with the competing SRFFT (noprun) and SRFFTpruning-time-shift methods for N = 262,144

From: Unified commutation-pruning technique for efficient computation of composite DFTs

DFTCOMM in comparison with:

L i

L o

Saving

SRFFT(noprun)

{21,22,…, N}

N = 218

DFTCOMM, 43.26 % with input pruning

SRFFTpruning-time-shift

  

DFTCOMM, 5.11 % with input pruning

SRFFT(noprun)

 

1027

DFTCOMM, 76.24 % with input-output pruning at the same time

SRFFTpruning-time-shift

  

SRFFTpruning-time-shift fails to deliver a result

SRFFT(noprun)

 

33

DFTCOMM, 92.11 % with input-output pruning at the same time

SRFFTpruning-time-shift

  

SRFFTpruning-time-shift fails to deliver a result