calculation of computational complexity for radix‑2 fast fourier Transform algorithms for medical signals p

Owing to its simplicity radix?2 is a popular algorithm to implement fast fourier transform. Radix-2 algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix?2. By defining a new concept, twiddle factor template, in this paper, we propose a method for exact calculation of multiplicative complexity for radix?2p algorithms.