Split-radix FFT algorithm
id:
split-radix-fft-algorithm-276-18029984
title:
Split-radix FFT algorithm
text:
The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially little-appreciated paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984. In particular, split radix is a variant of the Cooley–Tukey FFT algorithm that uses a blend of radices 2 and 4: it recursively expresses a DFT of length N in terms of one smaller DFT of length N/2 and two smaller DFTs of length
brand slug:
wiki
category slug:
encyclopedia
description:
Fast Fourier transform algorithm
original url:
https://en.wikipedia.org/wiki/Split-radix_FFT_algorithm
date created:
date modified:
2023-08-12T02:05:58Z
main entity:
{"identifier":"Q17103599","url":"https://www.wikidata.org/entity/Q17103599"}
image:
fields total:
13
integrity:
14