Pages that link to "Item:Q674150"
From MaRDI portal
The following pages link to On computation of certain discrete Fourier transforms using binary calculus (Q674150):
Displaying 6 items.
- Fast discrete Fourier transform computations using the reduced adder graph technique (Q838581) (← links)
- The best formulae for the approximate computation of discrete Fourier transforms (Q1311551) (← links)
- Discrete Fourier transform computation using prime Ramanujan numbers (Q1370324) (← links)
- A low-complexity approach to computation of the discrete fractional Fourier transform (Q2405996) (← links)
- (Q3031434) (← links)
- (Q4001149) (← links)