Pages that link to "Item:Q4166174"
From MaRDI portal
The following pages link to A prime factor FFT algorithm using high-speed convolution (Q4166174):
Displaying 8 items.
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- A note on prime factor FFT algorithms (Q1050757) (← links)
- Implementation of a self-sorting in-place prime factor FFT algorithm (Q1087005) (← links)
- A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677) (← links)
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP (Q1115562) (← links)
- Matrix identities of the fast Fourier transform (Q1153410) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- Realization of discrete Fourier transforms using a nesting algorithm (Q5751913) (← links)
