OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Bruun's FFT algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms FFT algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Bruun's FFT (Fast Fourier Transform) algorithm is a variation of the traditional FFT algorithm designed specifically for efficient computation of the Fourier transform. It's particularly used in fields like signal processing and image analysis. However, it is worth noting that Bruun's name is often associated with wavelet transforms and time-frequency analysis rather than with the FFT directly.

 Ancestors (6)

  1. FFT algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook