Pages that link to "Item:Q2666937"
From MaRDI portal
The following pages link to On a fast algorithm for computing the Fourier transform (Q2666937):
Displaying 21 items.
- An algorithm for fast Hilbert transform of real functions (Q489778) (← links)
- Five-step FFT algorithm with reduced computational complexity (Q845949) (← links)
- Fast Fourier transform: algorithms and applications (Q978560) (← links)
- Implementation issues in the Fourier transform algorithm (Q1579626) (← links)
- Rapid ``algebraic'' Fourier transforms on uniformly distributed meshes (Q2629436) (← links)
- Fast and approximate computation of Laplace and Fourier transforms (Q2797847) (← links)
- (Q3330474) (← links)
- (Q3490924) (← links)
- (Q3691042) (← links)
- (Q3696476) (← links)
- (Q3735040) (← links)
- (Q3736869) (← links)
- On computing the discrete Fourier and cosine transforms (Q3757261) (← links)
- A fast computational method for minimum square error transform (Q3806685) (← links)
- (Q4029733) (← links)
- (Q4276935) (← links)
- A recursive fast Fourier transformation algorithm (Q4338093) (← links)
- (Q4382286) (← links)
- (Q4659267) (← links)
- Rapid Computation of the Discrete Fourier Transform (Q4891742) (← links)
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2 (Q5203651) (← links)