Skip to main content

Table 9 Comparisons of the SFFTv1, SFFTv2, SFFTv3, and DFTCOMM algorithms for different sizes (N) of the signal x, with N = L i  = {26, 27,…, 220} and k s = L o  = 50

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

L i  = N

k s = L o

SFFTv1

SFFTv2

SFFTv3

DFTCOMM

26 = 64

50

*

*

*

✓

27 = 128

50

*

*

*

✓

28 = 256

50

*

*

*

✓

29 = 512

50

*

*

*

✓

210 = 1024

50

*

*

✓

✓

211 = 2048

50

*

*

✓

✓

212 = 4096

50

*

*

✓

✓

213 = 8192

50

✓

✓

✓

✓

214 = 16,384

50

✓

✓

✓

✓

215 = 32,768

50

✓

✓

✓

✓

216 = 65,536

50

✓

✓

✓

✓

217 = 131,072

50

✓

✓

✓

✓

218 = 262,144

50

✓

✓

✓

✓

219 = 524,288

50

✓

✓

✓

✓

220 = 1,048,576

50

✓

✓

✓

✓

  1. (*) The program execution is aborted
  2. (✓) The program execution is successful