首页| 行业标准| 论文文档| 电子资料| 图纸模型
购买积分 购买会员 激活码充值

您现在的位置是:团子下载站 > 数学计算 > The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT alg

The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT alg

  • 资源大小:7 K
  • 上传时间:2021-04-02
  • 下载次数:0次
  • 浏览次数:47次
  • 资源积分:1积分
  • 标      签: iterations performs Bailey number

资 源 简 介

The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
VIP VIP