Pages that link to "Item:Q3036659"
From MaRDI portal
The following pages link to An in-place, in-order prime factor FFT algorithm (Q3036659):
Displaying 10 items.
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- A fast, accurate, and smooth planetary ephemeris retrieval system (Q642381) (← 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)
- A new set of minimum-add small-n rotated DFT modules (Q1098609) (← links)
- Fast Fourier transformation based on number theoretic transforms (Q1123580) (← links)
- FFT algorithms and their adaptation to parallel processing (Q1124776) (← links)
- In-place self-sorting fast Fourier transform algorithm with local memory references (Q1299629) (← links)
- Nesting strategies for prime factor FFT algorithms (Q1825020) (← links)
- Efficient number theoretic transforms for convolutions using ROM arrays (Q3486848) (← links)