Pages that link to "Item:Q2432132"
From MaRDI portal
The following pages link to Hardware efficient fast computation of the discrete Fourier transform (Q2432132):
Displaying 11 items.
- Fast discrete Fourier transform computations using the reduced adder graph technique (Q838581) (← links)
- Pruning fast Fourier transform algorithm design using group-based method (Q971085) (← links)
- Efficient matched filters for DFT based codes (Q994217) (← links)
- A novel approach to fast discrete Fourier transform (Q1273886) (← links)
- Special purpose hardware for discrete Fourier transform implementation (Q1319523) (← links)
- A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems (Q1773594) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- An efficient design for one-dimensional discrete Hartley transform using parallel additions (Q2734408) (← links)
- Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse (Q2734424) (← links)
- Self-Sorting In-Place Fast Fourier Transforms (Q3349941) (← links)
- Rapid Computation of the Discrete Fourier Transform (Q4891742) (← links)
