Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

On computing the Discrete Fourier Transform.

S Winograd1

  • 1IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598.

Proceedings of the National Academy of Sciences of the United States of America
|April 1, 1976
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The N-terminal half of Cdc25 is essential for processing glucose signaling in Saccharomyces cerevisiae.

Biochemistry·1999
Same author

"Wired" science or whither the printed page?

Science (New York, N.Y.)·1995
Same author

Downregulation of peptide transporter genes in cell lines transformed with the highly oncogenic adenovirus 12.

The Journal of experimental medicine·1994
Same author

On the number of multiplications required to compute certain functions.

Proceedings of the National Academy of Sciences of the United States of America·1967

New algorithms significantly reduce multiplications for computing the Discrete Fourier Transform (DFT) for datasets of a few thousand points. These advancements offer computational efficiency while maintaining addition counts.

Area of Science:

  • Digital Signal Processing
  • Computational Mathematics

Background:

  • The Discrete Fourier Transform (DFT) is a fundamental tool in digital signal processing.
  • Efficient computation of the DFT is crucial for various applications.
  • Existing algorithms have limitations in terms of computational complexity.

Purpose of the Study:

  • To introduce novel algorithms for computing the Discrete Fourier Transform.
  • To improve the efficiency of DFT computation, particularly for moderate data sizes.

Main Methods:

  • Development of new computational techniques for the DFT.
  • Analysis of the number of multiplications and additions required by the proposed algorithms.

Main Results:

  • The new algorithms require substantially fewer multiplications compared to the previously best-known methods.

Related Experiment Videos

  • The number of additions remains comparable to existing algorithms.
  • Efficiency gains are most significant for n in the range of tens to a few thousands.

    • Conclusions:

    • The developed algorithms offer a more efficient approach to computing the DFT for specific data ranges.
    • These advancements have the potential to accelerate signal processing tasks.
    • Further research can explore applications and optimizations for larger datasets.