On the Flop and Flap Counts of the 2,8-Split-Radix FFT
We definejlap to mean a floating point amalgamated operation, i.e., an add, multiply, or multiply-add operation, and derive asymptotic flop and flap counts for the radix-2, radix-4, radix-8, 2,4-split-radix, and 2,8-split-radix FFT algorithms. We find that, of these, the 2,8-split-radix algorithm requires the fewest flaps. Lastly, we opine on real-value scaling of an FFT.
Authors
- Paul Caprioli
Publication Details
- Published
- 2025-05-04
- DOI
- https://doi.org/10.1109/arith64983.2025.00017
- Primary Topic
- High voltage insulation and dielectric phenomena
- Type
- article
- Field-Weighted Citation Impact
- 0.00