)Thus far, no published FFT algorithm has achieved fewer than formula_20 complex-number additions (or their equivalent) for power-of-two "N".A third problem is to minimize the "total" number of real multiplications and additions, sometimes called the "arithmetic complexity" (although in this context it is the exact count and not the asymptotic complexity that is being considered).