The Split-Radix FFT (Fast Fourier Transform) algorithm is a mathematical technique used to compute the discrete Fourier transform (DFT) and its inverse efficiently. It is an optimization of the FFT algorithm that reduces the number of arithmetic operations required, making it faster than the traditional Cooley-Tukey FFT algorithm in certain scenarios.

Ancestors (6)

  1. FFT algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version