Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Bruun's FFT algorithm

Known as: Bruun FFT algorithm 
Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
This study investigates patterns in the language and type of social sciences and humanities (SSH) publications in non-English… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
2009
2009
There is a constant search for alternative solutions improving the fuel efficiency and environmental impact of marine power… Expand
  • figure 1.1
  • table 1.1
  • figure 1.2
  • figure 3.3
  • figure 3.4
Highly Cited
2005
Highly Cited
2005
Brainstorming may be the best-known tool for group idea generation and is widely taught in gifted and talented programs. Many… Expand
  • table 2
2003
2003
Door Rijkswaterstaat wordt de laatste jaren steeds meer aandacht besteed aan de natuurlijke processen die in de kustzone… Expand
1995
1995
De temperatuur op aarde stijgt. Een gevolg van deze temperatuurstijging is zeespiegelstijging. Een ander gevolg zou kunnen zijn… Expand
1993
1993
  • R. Storn
  • IEEE Trans. Signal Process.
  • 1993
  • Corpus ID: 12546233
Results for a fixed-point error analysis of the Bruun-fast Fourier-transform (FFT) algorithm are presented. The noise-to-signal… Expand
  • figure 4
  • figure 7
  • figure 8
1992
1992
A very efficient algorithm for computing the discrete Fourier transform (DFT) of real-symmetric input is presented. The algorithm… Expand