⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 fni_3.c

📁 FFTW, a collection of fast C routines to compute the Discrete Fourier Transform in one or more dime
💻 C
字号:
/* * Copyright (c) 1997-1999, 2003 Massachusetts Institute of Technology * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA * *//* This file was automatically generated --- DO NOT EDIT *//* Generated on Mon Mar 24 02:06:18 EST 2003 */#include "fftw-int.h"#include "fftw.h"/* Generated by: /homee/stevenj/cvs/fftw/gensrc/genfft -magic-alignment-check -magic-twiddle-load-all -magic-variables 4 -magic-loopi -notwiddleinv 3 *//* * This function contains 12 FP additions, 4 FP multiplications, * (or, 10 additions, 2 multiplications, 2 fused multiply/add), * 12 stack variables, and 12 memory accesses */static const fftw_real K500000000 =FFTW_KONST(+0.500000000000000000000000000000000000000000000);static const fftw_real K866025403 =FFTW_KONST(+0.866025403784438646763723170752936183471402627);/* * Generator Id's :  * $Id: exprdag.ml,v 1.43 2003/03/16 23:43:46 stevenj Exp $ * $Id: fft.ml,v 1.44 2003/03/16 23:43:46 stevenj Exp $ * $Id: to_c.ml,v 1.26 2003/03/16 23:43:46 stevenj Exp $ */void fftwi_no_twiddle_3(const fftw_complex *input, fftw_complex *output,			int istride, int ostride){     fftw_real tmp1;     fftw_real tmp6;     fftw_real tmp4;     fftw_real tmp5;     fftw_real tmp9;     fftw_real tmp12;     fftw_real tmp11;     fftw_real tmp10;     ASSERT_ALIGNED_DOUBLE;     tmp1 = c_re(input[0]);     tmp6 = c_im(input[0]);     {	  fftw_real tmp2;	  fftw_real tmp3;	  fftw_real tmp7;	  fftw_real tmp8;	  ASSERT_ALIGNED_DOUBLE;	  tmp2 = c_re(input[istride]);	  tmp3 = c_re(input[2 * istride]);	  tmp4 = tmp2 + tmp3;	  tmp5 = K866025403 * (tmp2 - tmp3);	  tmp7 = c_im(input[istride]);	  tmp8 = c_im(input[2 * istride]);	  tmp9 = tmp7 + tmp8;	  tmp12 = K866025403 * (tmp8 - tmp7);     }     c_re(output[0]) = tmp1 + tmp4;     tmp11 = tmp1 - (K500000000 * tmp4);     c_re(output[2 * ostride]) = tmp11 - tmp12;     c_re(output[ostride]) = tmp11 + tmp12;     c_im(output[0]) = tmp6 + tmp9;     tmp10 = tmp6 - (K500000000 * tmp9);     c_im(output[ostride]) = tmp5 + tmp10;     c_im(output[2 * ostride]) = tmp10 - tmp5;}fftw_codelet_desc fftwi_no_twiddle_3_desc = {     "fftwi_no_twiddle_3",     (void (*)()) fftwi_no_twiddle_3,     3,     FFTW_BACKWARD,     FFTW_NOTW,     78,     0,     (const int *) 0,};

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -