摘要
快速傅里叶变换(FFT)是减少离散傅里叶变换(DFT)计算时间的算法。而在无线/移动通信系统中无线通信算法和多媒体应用处理算法中存在大量的矩阵或向量运算,均可以由DLP计算实现。本文研究的FFT算法就存在大量的矩阵运算,通过对FFT矩阵算法的分析,本文提出了在DLP计算模式下通过阵列计算机来实现FFT的快速算法,在MATLAB仿真平台上进行了传统算法与改进之后算法的比较,提出了进一步减少运算时间的FFT并行算法。
Fast Fourier Transform（FFT）is to reduce the Discrete Fourier Transform（DFT）algorithm of computing time. In wireless/mobile communication system, wireless communication and multimedia processing algorithms in the presence of large amounts of matrix or vector operations, can be calculated by the DLP. In this paper, we study the algorithm of a large number of matrix operations, through the analysis of matrix algorithm, this paper presents a fast algorithm of FFT based on the computing mode, and the comparison between the traditional algorithm and the improved algorithm in MATLAB simulation platform. The FFT parallel algorithm is proposed to reduce the computation time.
出处
《中国集成电路》
2016年第1期36-39,63,共5页
China lntegrated Circuit
基金
陕西省自然科学基金(2014JM8311)
