ðə splˈɪtɹˈeɪdɪks ˌɛfˌɛftˈiː ɪz ɐ fˈæst fˈoːɹiɚ tɹænsfˈɔːɹm ˌɛfˌɛftˈiː ˈælɡɚɹˌɪθəm fɔːɹ kəmpjˈuːɾɪŋ ðə dɪskɹˈiːt fˈoːɹiɚ tɹænsfˈɔːɹm dˌiːˌɛftˈiː, ænd wʌz fˈɜːst dᵻskɹˈaɪbd ɪn ɐn ɪnˈɪʃəli lˈɪɾəlɐpɹˈiːʃɪˌeɪɾᵻd pˈeɪpɚ baɪ ˈɑːɹ. jˈævni nˈaɪntiːnhˈʌndɹɪd sˈɪksti ˈeɪt ænd sˈʌbsᵻkwəntli ɹˌiːdɪskˈʌvɚd sˌaɪməltˈeɪniəsli baɪ vˈɛɹiəs ˈɔːθɚz ɪn nˈaɪntiːnhˈʌndɹɪd ˈeɪɾi fˈoːɹ.
The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially little-appreciated paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984.