 Again, no tight lower bound has been proven.Since 1968, however, the lowest published count for power-of-two "N" was long achieved by the split-radix FFT algorithm, which requires formula_23 real multiplications and additions for "N" > 1.This was recently reduced to formula_24 (Johnson and Frigo, 2007; Lundy and Van Buskirk, 2007).