开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 通讯/手机编程 > 3G开发 > 查看源码
dit_pino_T.cpp
资源名称：simulation_wireless_c++.rar　[点击查看]
上传用户：jtjnyq9001
上传日期：2014-11-21
资源大小：3974k
文件大小：3k
源码类别：

3G开发

开发平台：

Visual C++

dit_pino_T.cpp：源码内容
  1. //======================================================
  2. //
  3. //  File = dit_pino_T.cpp
  4. //
  5. //  Decimation-In-Time FFT
  6. //
  7. //  Permuteded Input / Naturally-ordered Output
  8. //
  10. #include <math.h>
  11. #include "misdefs.h"
  12. #include "log2.h"
  13. #include "cbitrev_T.h"
  14. #include "dit_pino_T.h"
  16. template <class T>
  17. void IfftDitPino( std::complex<T> *array,
  18.                   int fft_size)
  19. {
  20.    double trig_arg;
  21.    int log2_size;
  22.    std::complex<T> twiddle, w_fact;
  23.    std::complex<T> temp;
  24.    int pts_in_left_dft, pts_in_right_dft;
  25.    int stage, bfly_pos;
  26.    int top_node, bot_node;
  27.    log2_size = ilog2(fft_size);
  29.    pts_in_right_dft = 1;
  30.    for( stage=1; stage <=log2_size; stage++) { 
  32.       // set pts_in_left_dft = 2**(stage-1)
  33.       pts_in_left_dft = pts_in_right_dft;
  35.       // set pts_in_right_dft = 2**stage
  36.       pts_in_right_dft *= 2;
  38.       twiddle = std::complex<T>(1.0, 0.0);
  39.       trig_arg = PI/pts_in_left_dft;  
  40.       w_fact = std::complex<T>(  T(cos(trig_arg)), 
  41.                                  T(sin(trig_arg)));
  43.       for(  bfly_pos =0; 
  44.             bfly_pos < pts_in_left_dft; 
  45.             bfly_pos++){                             
  46.          for(  top_node = bfly_pos; 
  47.                top_node<fft_size; 
  48.                top_node += pts_in_right_dft){                              
  49.             bot_node = top_node + pts_in_left_dft;
  50.             temp = array[bot_node] * twiddle;
  51.             array[bot_node] = array[top_node] - temp;
  52.             array[top_node] += temp;
  53.          }
  54.          twiddle *= w_fact;
  55.       }
  56.    }
  57.    return;
  58. }
  59. //======================================================
  60. template <class T>
  61. void FftDitPino( std::complex<T> *array,
  62.                  int fft_size)
  63. {
  64.    double trig_arg;
  65.    int log2_size;
  66.    std::complex<T> twiddle, w_fact;
  67.    std::complex<T> temp;
  68.    int pts_in_left_dft, pts_in_right_dft;
  69.    int stage, bfly_pos;
  70.    int top_node, bot_node;
  71.    log2_size = ilog2(fft_size);
  73.    pts_in_right_dft = 1;
  74.    for( stage=1; stage <=log2_size; stage++) {
  76.       // set pts_in_left_dft = 2**(stage-1)
  77.       pts_in_left_dft = pts_in_right_dft; 
  79.       // set pts_in_right_dft = 2**stage
  80.       pts_in_right_dft *= 2;               
  82.       twiddle = std::complex<T>(1.0, 0.0);
  83.       trig_arg = PI/pts_in_left_dft;  
  84.       w_fact = std::complex<T>(  T(cos(trig_arg)), 
  85.                                  T(-sin(trig_arg)));
  87.       for(  bfly_pos =0; 
  88.             bfly_pos < pts_in_left_dft; 
  89.             bfly_pos++) { 
  90.          for(  top_node = bfly_pos; 
  91.                top_node<fft_size; 
  92.                top_node += pts_in_right_dft){
  93.             bot_node = top_node + pts_in_left_dft;
  94.             temp = array[bot_node] * twiddle;
  95.             array[bot_node] = array[top_node] - temp;
  96.             array[top_node] += temp;
  97.          }
  98.          twiddle *= w_fact;
  99.       }
  100.    }
  101.    return;
  102. }
  103. //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 
  104. template void IfftDitPino( std::complex<double> *array,
  105.                             int fft_size);
  106. template void IfftDitPino( std::complex<float> *array,
  107.                             int fft_size);
  109. template void FftDitPino( std::complex<double> *array,
  110.                            int fft_size);
  111. template void FftDitPino( std::complex<float> *array,
  112.                            int fft_size);