Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
Review
2015
Review
2015
Simmat-Durand, L., & Koski-Jannes, A. (2015). The risks of cannabis and other illicit drugs: Views among French and Finnish… 
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… 
2004
2004
tutkimuksessa yksi merkittava alue on jaanyt liian vahalle huomiolle, ja toisaalta tuon esiin niita vaikeuksia, joita sen… 
2003
2003
Door Rijkswaterstaat wordt de laatste jaren steeds meer aandacht besteed aan de natuurlijke processen die in de kustzone… 
1995
1995
De temperatuur op aarde stijgt. Een gevolg van deze temperatuurstijging is zeespiegelstijging. Een ander gevolg zou kunnen zijn… 
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…