 Rader's FFT algorithm

Rader's FFT algorithm is an efficient method for computing the discrete Fourier transform (DFT) of a sequence whose length is a prime number. Unlike the traditional Fast Fourier Transform (FFT) algorithms, which are optimized for lengths that are powers of two or can be factored into smaller integers, Rader's algorithm specifically addresses the cases where the input sequence length, \( N \), is a prime number.