Skip to main content

Table 3 Total number of arithmetic operations required to compute the input and output stages of DFTCOMM−DIF−DIT−Pr and DFTCOMM−DIT−DIF−Pr modalities

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

Method to compute the DFT N

Number of arithmetic operations

Limiting conditions

Direct method

6 (L o  − 1) (L i  − 1) + 2L o (L i  − 1)

((L i  ≤ D op )|(L o  ≤ D ip )) & (L i  < 4)

2BF filtering method

(L o  − 1) (2L i  + 2) + 2 (L i  − 1) + (L o  − 1) (4L i  − 2)

((L i  ≤ D op )|(L o  ≤ D ip )) & (L i  ≥ 4)

Pruned decomposed transform

OPERtot of (8) using Table 2

(L i  > D op ) & (L o  > D ip )