 There are other multidimensional FFT algorithms that are distinct from the row-column algorithm, although all of them have O("N" log "N") complexity.Perhaps the simplest non-row-column FFT is the vector-radix FFT algorithm, which is a generalization of the ordinary Cooley–Tukey algorithm where one divides the transform dimensions by a vector formula_35 of radices at each step.