Pages that link to "Item:Q4166173"
From MaRDI portal
The following pages link to An introduction to programming the Winograd Fourier transform algorithm (WFTA) (Q4166173):
Displayed 6 items.
- Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform (Q761787) (← links)
- A note on prime factor FFT algorithms (Q1050757) (← links)
- A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677) (← links)
- Hardware efficient fast computation of the discrete Fourier transform (Q2432132) (← links)
- A new technique for WFTA input/output reordering (Q3917426) (← links)
- Time optimization of segmentation methods for computing the bounds of correlation functions (Q5186697) (← links)