The fast Fourier transform algorithm is derived by means of successive fracturing of one-dimensional data strings into two-dimensional arrays. Using this formulation, a diagrammatic representation of mixed radix and highest radix FFT algorithms is derived. Using this representation, two broad classes of FFT hard-ware are explored, from the point of view of speed, parallelism, radix number, and type of memory.
No takes yet. Share an insight, caveat, or question.
Gold et al. (1973) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: