ðə splˈɪtɹˈeɪdɪks ˌɛfˌɛftˈiː, ɐlˈɔŋ wɪð ɪts vˌɛɹɪˈeɪʃənz, lˈɔŋ hæd ðə dɪstˈɪŋkʃən ʌv ɐtʃˈiːvɪŋ ðə lˈoʊɪst pˈʌblɪʃt ɚɹˈɪθmətˌɪk ˌɑːpɚɹˈeɪʃən kˈaʊnt tˈoʊɾəl ɛɡzˈækt nˈʌmbɚɹ ʌv ɹᵻkwˈaɪɚd ɹˈiːəl ɐdˈɪʃənz ænd mˌʌltɪplɪkˈeɪʃənz tə kəmpjˈuːt ɐ dˌiːˌɛftˈiː ʌv pˈaʊɚɹʌvtˈuː sˈaɪzᵻz ˈɛn.  ðɪ ɚɹˈɪθmətˌɪk kˈaʊnt ʌvðɪ ɚɹˈɪdʒɪnəl splˈɪtɹˈeɪdɪks ˈælɡɚɹˌɪθəm wʌz ɪmpɹˈuːvd əpˌɑːn ɪn tˈuː θˈaʊzənd fˈoːɹ wɪððɪ ɪnˈɪʃəl ɡˈeɪnz mˌeɪd ɪn ʌnpˈʌblɪʃt wˈɜːk baɪ dʒˈeɪ. vˈæn bˈʌskɜːk vˈaɪə hˈænd ˌɑːptɪmᵻzˈeɪʃən fɔːɹ ˈɛn ˈiːkwəlz sˈɪksti fˈoːɹ, bˌʌt ɪt tˈɜːnz ˈaʊt ðˈætwˌʌn kæn stˈɪl ɐtʃˈiːv ðə nˈuː lˈoʊɪst kˈaʊnt baɪ ɐ mˌɑːdɪfɪkˈeɪʃən ʌv splˈɪt ɹˈeɪdɪks dʒˈɑːnsən ænd fɹˈiːɡoʊ, tˈuː θˈaʊzənd sˈɛvən.
The split-radix FFT, along with its variations, long had the distinction of achieving the lowest published arithmetic operation count (total exact number of required real additions and multiplications) to compute a DFT of power-of-two sizes N.  The arithmetic count of the original split-radix algorithm was improved upon in 2004 (with the initial gains made in unpublished work by J. Van Buskirk via hand optimization for N=64  ), but it turns out that one can still achieve the new lowest count by a modification of split radix (Johnson and Frigo, 2007).