PRFFT: A Fast Algorithm of Sliding-window DFT with Parallel Structure

摘要：

The Sliding Window discrete Fourier transform is a very important and widely used time-frequency representation of a signaL To speed up the calculation, fast algorithm of sliding-window discrete Fourier transform has been proposed and N complex multiplications per sample has been reported where rectangular window is adopted. However, in those algorithms, the results from a preceding step are required to effectively carry on with the next step, which leads to the difficulty of designing parallel computing algorithm. In this paper, we assumed that all the data are present at the outset, and then we proposed Parallel Really Fast Fourier Transform, a fast sliding-window discrete Fourier transform algorithm with parallel structure, which is easy to design a paralleling computing implementation.

关键词： SWDFT Fast Algorithm ParalLel Computing

作者: Jianming Wang William F. Eddy

作者单位: Department of Elearonics Information Engineering Tianjin Polytechnic University Tianjin,China Department of Statistics Camegie Mellon University Pittsburgh, USA

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)

会议地点: 大连

会议语种:英文

页码: 1195-1199

在线出版日期: 2010-07-05（万方平台首次上网日期，不代表论文的发表时间）