Discrete and fast Fourier transformations on N-dimensional lattices

The N-dimensional discrete Fourier transform (DFT) may be represented as a matrix of elements of unit magnitude, with the arguments constructed as inner products of lattice vectors in the sampling and wavenumber domains, filling regions inverse to the basic cells on their respective lattices. The fast Fourier transform numerical technique is directly applicable to this configuration.