On the structure of efficient DFT algorithms

DOI10.1109/TASSP.1985.1164526zbMATH Open0621.65032MaRDI QIDQ3757258FDOQ3757258

C. Sidney Burrus, Howard W. Johnson

Publication date: 1985

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

Recommendations

• The design of optimal DFT algorithms using dynamic programming
• Hardware efficient fast computation of the discrete Fourier transform
• FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
• scientific article; zbMATH DE number 3938512
• scientific article; zbMATH DE number 3915602

zbMATH Keywords

Chinese remainder theoremprime factor algorithmprime length discrete Fourier transform algorithms

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Radix representation; digital problems (11A63)

Cited In (16)

• FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
• On the odd-DFT and its applications to DCT/IDCT computation
• On the real complexity of a complex DFT
• Unscrambling for fast DFT algorithms
• A prime factor FTT algorithm using distributed arithmetic
• A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Special purpose hardware for discrete Fourier transform implementation
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• The design of optimal DFT algorithms using dynamic programming
• Title not available (Why is that?)
• Hardware efficient fast computation of the discrete Fourier transform
• Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations
• A pipeline design of a fast prime factor DFT on a finite field
• Efficient DFT Architectures Based Upon Symmetries
• Subband DFT. II: Accuracy, complexity and applications

This page was built for publication: On the structure of efficient DFT algorithms

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