Bruun's FFT algorithm
id:
bruun-s-fft-algorithm-320-18247846
title:
Bruun's FFT algorithm
text:
Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996. Because its operations involve only real coefficients until the last computation stage, it was initially proposed as a way to efficiently compute the discrete Fourier transform (DFT) of real data. Bruun's algorithm has not seen widespread use, however,
brand slug:
wiki
category slug:
encyclopedia
description:
Fast Fourier transform algorithm
original url:
https://en.wikipedia.org/wiki/Bruun%27s_FFT_algorithm
date created:
date modified:
2024-01-03T19:47:23Z
main entity:
{"identifier":"Q4979897","url":"https://www.wikidata.org/entity/Q4979897"}
image:
fields total:
13
integrity:
14