research-article

Free access

An economical method for calculating the discrete Fourier transform

Author:

R. YavneAuthors Info & Claims

AFIPS '68 (Fall, part I): Proceedings of the December 9-11, 1968, fall joint computer conference, part I

Pages 115 - 125

https://doi.org/10.1145/1476589.1476610

Published: 09 December 1968 Publication History

PDF eReader

Abstract

With the advent of digital computers it became possible to compute the Discrete Fourier Transform for a large number of input points in relatively reasonable times. However, for certain uses a demand developed to compute the Discrete Fourier Transform in a very short time or even in real time. Also, a demand developed for computing the Fourier Transform for a very large number of input points. These demands resulted in a requirement for computing the Fourier Transform in the fastest time possible. A very economical way for computing the Fourier Transform was developed a few years ago and is known as the Cooley-Tukey Algorithm. This article describes another algorithm for computing the Discrete Fourier Transform where the required number of additions and subtractions is the same as in the Cooley-Tukey Algorithm; but the required number of multiplications is only one half of that in the Cooley-Tukey Algorithm.

Cited By

View all

Yin HZhu A(2024)Iterative Multimetric Model Extraction for Digital Predistortion of RF Power Amplifiers Using Enhanced Quadratic SPSAIEEE Transactions on Microwave Theory and Techniques10.1109/TMTT.2023.330518172:3(1503-1514)Online publication date: Mar-2024
https://doi.org/10.1109/TMTT.2023.3305181
Lee SCasseau EKritikakou ASentieys OSalvador RGalizzi J(2024)On-board Payload Data Processing Combined with the Roofline Model for Hardware/Software Design2024 IEEE Aerospace Conference10.1109/AERO58975.2024.10521057(1-12)Online publication date: 2-Mar-2024
https://doi.org/10.1109/AERO58975.2024.10521057
Jang TCho J(2024)A PPN-Based Improved QAM-FBMC System With Jointly Optimized Mismatched Prototype FiltersIEEE Access10.1109/ACCESS.2024.334960012(3736-3755)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3349600
Show More Cited By

An economical method for calculating the discrete Fourier transform
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis

Recommendations

A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the ...
Discrete fractional Fourier transform based on orthogonal projections

The continuous fractional Fourier transform (FRFT) performs a spectrum rotation of signal in the time-frequency plane, and it becomes an important tool for time-varying signal analysis. A discrete fractional Fourier transform has been developed by ...
The discrete fractional Fourier transform

We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier ...

Comments

Information & Contributors

Information

Published In

AFIPS '68 (Fall, part I): Proceedings of the December 9-11, 1968, fall joint computer conference, part I

December 1968

931 pages

ISBN:9781450378994

DOI:10.1145/1476589

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 1968

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

AFIPS '68 (Fall, part I)

Sponsor:

AFIPS

December 9 - 11, 1968

California, San Francisco

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
766
Total Downloads

Downloads (Last 12 months)197
Downloads (Last 6 weeks)24

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yin HZhu A(2024)Iterative Multimetric Model Extraction for Digital Predistortion of RF Power Amplifiers Using Enhanced Quadratic SPSAIEEE Transactions on Microwave Theory and Techniques10.1109/TMTT.2023.330518172:3(1503-1514)Online publication date: Mar-2024
https://doi.org/10.1109/TMTT.2023.3305181
Lee SCasseau EKritikakou ASentieys OSalvador RGalizzi J(2024)On-board Payload Data Processing Combined with the Roofline Model for Hardware/Software Design2024 IEEE Aerospace Conference10.1109/AERO58975.2024.10521057(1-12)Online publication date: 2-Mar-2024
https://doi.org/10.1109/AERO58975.2024.10521057
Jang TCho J(2024)A PPN-Based Improved QAM-FBMC System With Jointly Optimized Mismatched Prototype FiltersIEEE Access10.1109/ACCESS.2024.334960012(3736-3755)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3349600
Pérez-Romero JSallent OGelonch AGelabert XKlaiqi BKahn MCampoy D(2023)A Tutorial on the Characterisation and Modelling of Low Layer Functional Splits for Flexible Radio Access Networks in 5G and BeyondIEEE Communications Surveys & Tutorials10.1109/COMST.2023.329682125:4(2791-2833)Online publication date: Dec-2024
https://doi.org/10.1109/COMST.2023.3296821
Perera SLingsch LMadanayake AMandal SMastronardi N(2022)A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam BeamformersIEEE Transactions on Signal Processing10.1109/TSP.2022.323118270(5913-5925)Online publication date: 2022
https://doi.org/10.1109/TSP.2022.3231182
Liu YWang CSun JDu SHong Q(2022)One-Step Calculation Circuit of FFT and Its ApplicationIEEE Transactions on Circuits and Systems I: Regular Papers10.1109/TCSI.2022.315980369:7(2781-2793)Online publication date: Jul-2022
https://doi.org/10.1109/TCSI.2022.3159803
Schlegel RKumar SRosnes EGraell i Amat A(2022)Privacy-Preserving Coded Mobile Edge Computing for Low-Latency Distributed InferenceIEEE Journal on Selected Areas in Communications10.1109/JSAC.2022.314229540:3(788-799)Online publication date: Mar-2022
https://doi.org/10.1109/JSAC.2022.3142295
Becoulet AVerguet A(2021)A Depth-First Iterative Algorithm for the Conjugate Pair Fast Fourier TransformIEEE Transactions on Signal Processing10.1109/TSP.2021.306027969(1537-1547)Online publication date: 2021
https://doi.org/10.1109/TSP.2021.3060279
Frigard AKumar SRosnes Ei Amat A(2021)Low-Latency Distributed Inference at the Network Edge Using Rateless Codes (Invited Paper)2021 17th International Symposium on Wireless Communication Systems (ISWCS)10.1109/ISWCS49558.2021.9562193(1-6)Online publication date: 6-Sep-2021
https://doi.org/10.1109/ISWCS49558.2021.9562193
Perera SLingsch L(2021)Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine TransformsIEEE Access10.1109/ACCESS.2021.31200519(141181-141198)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3120051
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

Discrete fractional Fourier transform based on orthogonal projections

The discrete fractional Fourier transform

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

Cited By

Recommendations

A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

Discrete fractional Fourier transform based on orthogonal projections

The discrete fractional Fourier transform

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations