Fast Fourier transform using matrix decomposition
Fast Fourier transform using matrix decomposition
复制标题
DOI：
10.1016/j.ins.2014.08.022
复制
发表时间：
2015-01
期刊：
影响因子：
--
通讯作者：
Yicong Zhou;Weijia Cao;Licheng Liu;S. Agaian;C. L. P. Chen
中科院分区：
文献类型：
--
作者：
Yicong Zhou;Weijia Cao;Licheng Liu;S. Agaian;C. L. P. Chen
To reduce both the multiplicative complexity and total number of operations, this paper introduces a modeling scheme of the fast Fourier transform (FFT) to decompose the discrete Fourier transform (DFT) matrix recursively into a set of sparse matrices. Integrating three orthogonal transforms, the Hadamard, Modified Haar and Hybrid transforms, the proposed scheme is able to obtain different FFT representations with less computation operations than state of the arts. To investigate the applications of the proposed FFT scheme, a multi-stage image encryption algorithm is also introduced. Experimental results and security analysis are provided to show its encryption performance.
