On the structure of efficient DFT algorithms
From MaRDI portal
Publication:3757258
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
Cited in
(16)- Unscrambling for fast DFT algorithms
- Efficient DFT Architectures Based Upon Symmetries
- A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
- scientific article; zbMATH DE number 3938512 (Why is no real title available?)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Implementation of a self-sorting in-place prime factor FFT algorithm
- Subband DFT. II: Accuracy, complexity and applications
- Special purpose hardware for discrete Fourier transform implementation
- 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
- The design of optimal DFT algorithms using dynamic programming
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations
- On the real complexity of a complex DFT
- On the odd-DFT and its applications to DCT/IDCT computation
- A pipeline design of a fast prime factor DFT on a finite field
- A prime factor FTT algorithm using distributed arithmetic
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)
