ðɪs kˈaʊnt ɐsˈuːmz ðˈæt, fɔːɹ ˈɑːd pˈaʊɚz ʌv tˈuː, ðə lˈɛftoʊvɚ fˈæktɚɹ ʌv tˈuː ˈæftɚɹ ˈɔːl ðə splˈɪtɹˈeɪdɪks stˈɛps, wˌɪtʃ dᵻvˈaɪd ˈɛn baɪ fˈoːɹ ɪz hˈændəld dᵻɹˈɛktli baɪ ðə dˌiːˌɛftˈiː dˌɛfɪnˈɪʃən fˈoːɹ ɹˈiːəl ɐdˈɪʃənz ænd mˌʌltɪplɪkˈeɪʃənz, ɔːɹ ɪkwˈɪvələntli baɪ ɐ ɹˈeɪdɪks tˈuː kˈuːli tˈuːki ˌɛfˌɛftˈiː stˈɛp.
This count assumes that, for odd powers of 2, the leftover factor of 2 (after all the split-radix steps, which divide N by 4) is handled directly by the DFT definition (4 real additions and multiplications), or equivalently by a radix-2 Cooley–Tukey FFT step.