The design of optimal DFT algorithms using dynamic programming

DOI10.1109/TASSP.1983.1164071MaRDI QIDQ3678627zbMATH OpenFDO

Authors Howard W. Johnson, C. Sidney Burrus

Publication date 1983

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

Full work available at URL https://doi.org/10.1109/TASSP.1983.1164071

zbMATH Keywords

discrete Fourier transformdynamic programming algorithmmultidimensionalprime factor algorithmWinograd Fourier transform

Mathematics Subject Classification ID

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

Recommendations

• On the structure of efficient DFT algorithms
• Fast generalized DFT and DHT algorithms
• A new algorithm for fast generalized DFTs
• On computational aspects of certain optimal digital signal processing algorithms
• scientific article; zbMATH DE number 60565
• scientific article; zbMATH DE number 3915602
• An efficient algorithm for the computation of the multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 2210672
• scientific article; zbMATH DE number 796291
• scientific article; zbMATH DE number 4164117

Cited in

(17)

• Implementation of a self-sorting in-place prime factor FFT algorithm
• A self-sorting in-place prime factor real/half-complex FFT algorithm
• Nesting strategies for prime factor FFT algorithms
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• Generating and searching families of FFT algorithms
• Efficient computation and neural processing of astrometric images
• Programming the WFTA for two-dimensional data
• An optimal algorithm for grouping in NEDA
• scientific article; zbMATH DE number 3896293 (Why is no real title available?)
• A prime factor FTT algorithm using distributed arithmetic
• On the structure of efficient DFT algorithms
• An efficient Fourier transform algorithm for frequency domains of several decades using logarithmically spaced time samples
• scientific article; zbMATH DE number 1304277 (Why is no real title available?)
• scientific article; zbMATH DE number 4115952 (Why is no real title available?)
• Realization of discrete Fourier transforms using a nesting algorithm
• Pruning fast Fourier transform algorithm design using group-based method
• Efficient matched filters for DFT based codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678627)