Pages that link to "Item:Q3985190"
From MaRDI portal
The following pages link to The techniques of the generalized fast Fourier transform algorithm (Q3985190):
Displaying 12 items.
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform (Q709791) (← links)
- Recursive Fourier transform using convolutions (Q751227) (← links)
- A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures (Q753467) (← links)
- Computational aspects of fast Fourier transformation (Q863654) (← links)
- A new set of minimum-add small-n rotated DFT modules (Q1098609) (← links)
- Fast generalized Fourier transforms (Q1123578) (← links)
- Assessing fast Fourier transform algorithms. (Q1128616) (← links)
- Fast algorithms for DFT of composite sequence lengths (Q1275476) (← links)
- A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data (Q1390968) (← links)
- Fast algorithms through divide- and combine-and-conquer strategies (Q1808004) (← links)
- (Q3346383) (← links)
- (Q3804141) (← links)