Fig. 3From: Unified commutation-pruning technique for efficient computation of composite DFTsPossible feasible alternative schemes for efficient computation of composite DFTs when the input and/or output sequences are smaller than the length of the full transform. a State of the art. b New feasible implementation structures. Specifications of the blocks labeled as A, B, F, and D are listed in Table 1 Back to article page