Fast Fourier transform using matrix decomposition

DOI10.1016/J.INS.2014.08.022zbMath1355.65188OpenAlexW1978477025MaRDI QIDQ508808

C. L. Philip Chen, Weijia Cao, Yicong Zhou, Licheng Liu, Sos S. Agaian

Publication date: 8 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.08.022

zbMATH Keywords

fast Fourier transformsparse matriximage encryptionorthogonal transform

Mathematics Subject Classification ID

Cryptography (94A60) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

Unnamed Item ⋮ Tensor transform-based quaternion Fourier transform algorithm ⋮ Complex fuzzy sets with applications in signals

Cites Work

• Unnamed Item
• Discrete fractional wavelet transform and its application to multiple encryption
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• Split manageable efficient algorithm for Fourier and Hadamard transforms
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$
• Input and/or Output Pruning of Composite Length FFTs Using a DIF-DIT Transform Decomposition
• Fixed-Point Analysis and Parameter Selections of MSR-CORDIC With Applications to FFT Designs
• A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
• FFT Implementation with Fused Floating-Point Operations
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Fast Fourier transform using matrix decomposition