Abstract
Permuting the signal samples according to certain permutation operators before computing the discrete Fourier transform is equivalent to permuting the transform samples according to the inverse permutation. A classification of these permutation operators is suggested based on the fact that they partition the sample sequence into sets and permute only within individual sets. Applications of the permutation properties are discussed.