Fast Fourier transform using matrix decomposition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2205361 (Why is no real title available?)
- A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Discrete fractional wavelet transform and its application to multiple encryption
- FFT Implementation with Fused Floating-Point Operations
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Fixed-Point Analysis and Parameter Selections of MSR-CORDIC With Applications to FFT Designs
- Input and/or Output Pruning of Composite Length FFTs Using a DIF-DIT Transform Decomposition
- Split manageable efficient algorithm for Fourier and Hadamard transforms
Cited in
(7)- Tensor transform-based quaternion Fourier transform algorithm
- scientific article; zbMATH DE number 7687794 (Why is no real title available?)
- Two dimensional fast Fourier transform for large data matrices
- scientific article; zbMATH DE number 494440 (Why is no real title available?)
- scientific article; zbMATH DE number 741104 (Why is no real title available?)
- Complex fuzzy sets with applications in signals
- Fourier transform as a triangular matrix
This page was built for publication: Fast Fourier transform using matrix decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508808)