The following pages link to (Q3691042):
Displaying 16 items.
- On computation of certain discrete Fourier transforms using binary calculus (Q674150) (← links)
- Fast Fourier transformation based on number theoretic transforms (Q1123580) (← links)
- Bluestein's FFT for arbitrary \(N\) on the hypercube (Q1179208) (← links)
- Fast algorithms for DFT of composite sequence lengths (Q1275476) (← links)
- Special purpose hardware for discrete Fourier transform implementation (Q1319523) (← links)
- Implementation issues in the Fourier transform algorithm (Q1579626) (← links)
- A new matrix approach to real FFTs and convolutions of length \(2^k\) (Q2369946) (← links)
- Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution (Q2668536) (← links)
- (Q3330474) (← links)
- On recursive discrete Fourier transformation (Q3677125) (← links)
- The design of optimal DFT algorithms using dynamic programming (Q3678627) (← links)
- (Q3701319) (← links)
- On computing the discrete Fourier and cosine transforms (Q3757261) (← links)
- (Q3804141) (← links)
- The techniques of the generalized fast Fourier transform algorithm (Q3985190) (← links)
- (Q4029733) (← links)
