ðə bˈeɪs kˈeɪsᵻz ʌvðə ɹᵻkˈɜːʃən ɑːɹ ˈɛn ˈiːkwəlz wˈʌn, wˌɛɹ ðə dˌiːˌɛftˈiː ɪz dʒˈʌst ɐ kˈɑːpi , ænd ˈɛn ˈiːkwəlz tˈuː, wˌɛɹ ðə dˌiːˌɛftˈiː ɪz ɐn ɐdˈɪʃən ænd ɐ sʌbtɹˈækʃən .
The base cases of the recursion are N=1, where the DFT is just a copy , and N=2, where the DFT is an addition  and a subtraction .