The design of optimal DFT algorithms using dynamic programming

DOI10.1109/TASSP.1983.1164071zbMath0564.65090MaRDI QIDQ3678627

C. Sidney Burrus, Howard W. Johnson

Publication date: 1983

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

discrete Fourier transformdynamic programming algorithmmultidimensionalprime factor algorithmWinograd Fourier transform

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (4)

Implementation of a self-sorting in-place prime factor FFT algorithm ⋮ A new matrix approach to real FFTs and convolutions of length \(2^k\) ⋮ A self-sorting in-place prime factor real/half-complex FFT algorithm ⋮ Nesting strategies for prime factor FFT algorithms

This page was built for publication: The design of optimal DFT algorithms using dynamic programming