Two dimensional properties of discrete fourier transform

Two significant two-dimensional decomposition rules for the Discret Fourier Transform of a set of N data (N=2p) are considered. It is shown that the two-dimensional processing performed according to such rules involves exactly the same operations on the same data as the one-dimensional processing. This means that, if the same rulw is iteratively applied with arbitrary dimensions, always the same fast algorithm is obtained.