Paper
28 November 1983 A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation Techniques
O . Ersoy
Author Affiliations +
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.
© (1983) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
O . Ersoy "A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation Techniques", Proc. SPIE 0431, Real-Time Signal Processing VI, (28 November 1983); https://doi.org/10.1117/12.936464
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Signal processing

Convolution

Algorithm development

Signal to noise ratio

Very large scale integration

Digital signal processing

Fourier transforms

RELATED CONTENT

Low complexity 1D IDCT for 16-bit parallel architectures
Proceedings of SPIE (October 08 2007)
New one-hot RNS structures for high-speed signal processing
Proceedings of SPIE (December 06 2002)
Old And New Algorithms For Toeplitz Systems
Proceedings of SPIE (February 23 1988)
Analysis of the nonlinear joint transform correlator
Proceedings of SPIE (June 07 1996)
Mixed-radix approach to incremental DFT refinement
Proceedings of SPIE (June 07 1995)

Back to Top