TY - JOUR
N2 - It is well known that the magnitudes of the coefficients of the discrete Fourier transform (DFT) are invariant under certain operations on the input data. In this paper, the effects of rearranging the elements of an input data on its DFT are studied. In the one-dimensional case, the effects of permuting the elements of a finite sequence of length N on its discrete Fourier transform (DFT) coefficients are investigated. The permutations that leave the unordered collection of Fourier coefficients and their magnitudes invariant are completely characterized. Conditions under which two different permutations give the same DFT coefficient magnitudes are given. The characterizations are based on the automorphism group of the additive group ZN of integers modulo N and the group of translations of ZN. As an application of the results presented, a generalization of the theorem characterizing all permutations that commute with the discrete Fourier transform is given. Numerical examples illustrate the obtained results. Possible generalizations and open problems are discussed. In higher dimensions, results on the effects of certain geometric transformations of an input data array on its DFT are given and illustrated with an example.
L1 - http://sd.czasopisma.pan.pl/Content/114299/PDF/02_995-1005_01048_Bpast.No.67-6_13.01.20_K3_TeX.pdf
L2 - http://sd.czasopisma.pan.pl/Content/114299
PY - 2019
IS - No. 6
EP - 1005
DO - 10.24425/bpasts.2019.130874
KW - discrete Fourier transform (DFT)
KW - DFT invariants
KW - Fourier coefficients
KW - permutations
KW - DFT coefficient magnitudes
KW - circulant matrix
KW - pattern recognition
A1 - Hui, S.
A1 - Żak, S.H.
VL - 67
DA - 31.12.2019
T1 - Discrete Fourier transform and permutations
SP - 995
UR - http://sd.czasopisma.pan.pl/dlibra/publication/edition/114299
T2 - Bulletin of the Polish Academy of Sciences Technical Sciences
ER -