Bailey's FFT algorithm
id:
bailey-s-fft-algorithm-196-199800
title:
Bailey's FFT algorithm
text:
The Bailey's FFT (also known as a 4-step FFT) is a high-performance algorithm for computing the fast Fourier transform (FFT). This variation of the Cooley–Tukey FFT algorithm was originally designed for systems with hierarchical memory common in modern computers (and was the first FFT algorithm in this so called "out of core" class). The algorithm treats the samples as a two dimensional matrix (thus yet another name, a matrix FFT algorithm) and executes short FFT operations on the columns and ro
brand slug:
wiki
category slug:
encyclopedia
description:
High-performance algorithm
original url:
https://en.wikipedia.org/wiki/Bailey%27s_FFT_algorithm
date created:
date modified:
2024-02-20T18:52:05Z
main entity:
{"identifier":"Q118943846","url":"https://www.wikidata.org/entity/Q118943846"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/24/Bailey_4-step_FFT.svg","width":360,"height":540}
fields total:
13
integrity:
15