A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation Techniques

Publisher Website
Google Scholar
Abstract
Discrete fourier transform is represented as a real transform through using number groups and removing redundancy. The resulting configuration is further written in terms of (skew) circular correlations, which can be implemented by fast correlation techniques. The number of data points considered is a power of 2, even though the method can be generalized to any number of data points.

This publication has 0 references indexed in Scilit: