Pages that link to "Item:Q4086677"
From MaRDI portal
The following pages link to On computing the Discrete Fourier Transform (Q4086677):
Displaying 18 items.
- Improved upper complexity bounds for the discrete Fourier transform (Q811112) (← links)
- Morphological transform for image compression (Q966726) (← links)
- Gauss and the history of the fast Fourier transform (Q1065775) (← links)
- Index transforms for N-dimensional DFT's (Q1093355) (← links)
- Fast generalized Fourier transforms (Q1123578) (← links)
- Non-parametric methods of system identification (Q1148268) (← links)
- On multiplication in algebraic extension fields (Q1256512) (← links)
- On the number of active *-operations needed to compute the discrete Fourier transform (Q1259425) (← links)
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (Q1823640) (← links)
- The double determinant of Vandermonde's type over quaternion field (Q1969937) (← links)
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
- An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
- Accelerations of Zhao's methods for the numerical inversion of Laplace transform (Q3082592) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- A Vector Implementation of the Fast Fourier Transform Algorithm (Q3904013) (← links)
- Is computing with the finite Fourier transform pure or applied mathematics? (Q3931844) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Group Convolutions and Matrix Transforms (Q4721954) (← links)
