Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
How to compute two complex even Fourier transforms with one transform step
Home
Publications
How to compute two complex even Fourier transforms with one transform step
How to compute two complex even Fourier transforms with one transform step
Author:
AS
A.E. Siegman
A.E. Siegman
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 March 1975
journal article
Published by
Institute of Electrical and Electronics Engineers (IEEE)
in
Proceedings of the IEEE
Vol. 63
(3)
,
544
DOI:
10.1109/PROC.1975.9787
Abstract
A procedure is given for calculating the discrete Fourier transforms (DFT) of two separate complex even N-point functions simultaneously using only a single N-point DFT plus N additional multiplications.
Keywords
FOURIER TRANSFORMS
DISCRETE FOURIER TRANSFORMS
DISCRETE TRANSFORMS
FAST FOURIER TRANSFORMS
CHIRP
IEEE PRESS
Related articles
Cited
Cited by 4 articles
Scroll to top