快速傅里叶变换 c
所属分类：数学计算
开发工具：C/C++
文件大小：913KB
下载次数：1
上传日期：2018-04-13 09:06:56
上 传 者：
刘向前
说明： FFT的基本思想是把原始的N点序列，依次分解成一系列的短序列。充分利用DFT计算式中指数因子 所具有的对称性质和周期性质，进而求出这些短序列相应的DFT并进行适当组合，达到删除重复计算，减少乘法运算和简化结构的目的
(Fast Fourier Transform)
文件列表:
快速傅里叶变换 c (0, 2018-04-12)
快速傅里叶变换 c\api (0, 2018-02-19)
快速傅里叶变换 c\api\api.h (4009, 2018-02-19)
快速傅里叶变换 c\api\apiplan.c (5869, 2018-02-19)
快速傅里叶变换 c\api\configure.c (1086, 2018-02-19)
快速傅里叶变换 c\api\execute-dft-c2r.c (1194, 2018-02-19)
快速傅里叶变换 c\api\execute-dft-r2c.c (1194, 2018-02-19)
快速傅里叶变换 c\api\execute-dft.c (1211, 2018-02-19)
快速傅里叶变换 c\api\execute-r2r.c (1090, 2018-02-19)
快速傅里叶变换 c\api\execute-split-dft-c2r.c (1199, 2018-02-19)
快速傅里叶变换 c\api\execute-split-dft-r2c.c (1196, 2018-02-19)
快速傅里叶变换 c\api\execute-split-dft.c (1119, 2018-02-19)
快速傅里叶变换 c\api\execute.c (964, 2018-02-19)
快速傅里叶变换 c\api\export-wisdom-to-file.c (1356, 2018-02-19)
快速傅里叶变换 c\api\export-wisdom-to-string.c (1286, 2018-02-19)
快速傅里叶变换 c\api\export-wisdom.c (1392, 2018-02-19)
快速傅里叶变换 c\api\f03api.sh (1458, 2018-02-19)
快速傅里叶变换 c\api\f77api.c (4952, 2018-02-19)
快速傅里叶变换 c\api\f77funcs.h (14736, 2018-02-19)
快速傅里叶变换 c\api\fftw3.h (31394, 2018-02-19)
快速傅里叶变换 c\api\flops.c (1423, 2018-02-19)
快速傅里叶变换 c\api\forget-wisdom.c (987, 2018-02-19)
快速傅里叶变换 c\api\genf03.pl (7559, 2018-02-19)
快速傅里叶变换 c\api\guru.h (145, 2018-02-19)
快速傅里叶变换 c\api\guru64.h (153, 2018-02-19)
快速傅里叶变换 c\api\import-system-wisdom.c (1535, 2018-02-19)
快速傅里叶变换 c\api\import-wisdom-from-file.c (2309, 2018-02-19)
快速傅里叶变换 c\api\import-wisdom-from-string.c (1464, 2018-02-19)
快速傅里叶变换 c\api\import-wisdom.c (1397, 2018-02-19)
快速傅里叶变换 c\api\Makefile.am (2828, 2018-02-19)
快速傅里叶变换 c\api\malloc.c (1599, 2018-02-19)
快速傅里叶变换 c\api\map-r2r-kind.c (1736, 2018-02-19)
快速傅里叶变换 c\api\mapflags.c (5536, 2018-02-19)
快速傅里叶变换 c\api\mkprinter-file.c (1488, 2018-02-19)
快速傅里叶变换 c\api\mkprinter-str.c (1550, 2018-02-19)
快速傅里叶变换 c\api\mktensor-iodims.c (47, 2018-02-19)
快速傅里叶变换 c\api\mktensor-iodims.h (1817, 2018-02-19)
快速傅里叶变换 c\api\mktensor-iodims64.c (49, 2018-02-19)
快速傅里叶变换 c\api\mktensor-rowmajor.c (1808, 2018-02-19)
快速傅里叶变换 c\api\plan-dft-1d.c (1017, 2018-02-19)
... ...
This directory contains a benchmarking and testing program
for fftw3.
The `bench' program has a zillion options, because we use it for
benchmarking other FFT libraries as well. This file only documents
the basic usage of bench.
Usage: bench
where each command is as follows:
-s
--speed
Benchmarks the speed of .
The syntax for problems is [i|o][r|c][f|b], where
i/o means in-place or out-of-place. Out of place is the default.
r/c means real or complex transform. Complex is the default.
f/b means forward or backward transform. Forward is the default.
is an arbitrary multidimensional sequence of integers
separated by the character 'x'.
(The syntax for problems is actually richer, but we do not document
it here. See the man page for fftw-wisdom for more information.)
Example:
ib256 : in-place backward complex transform of size 256
32x*** : out-of-place forward complex 2D transform of 32 rows
and *** columns.
-y
--verify
Verify that FFTW is computing the correct answer.
The program does not output anything unless an error occurs or
verbosity is at least one.
-v
Set verbosity to , or 1 if is omitted. -v2 will output
the created plans with fftw_print_plan.
-oestimate
-opatient
-oexhaustive
Plan with FFTW_ESTIMATE, FFTW_PATIENT, or FFTW_EXHAUSTIVE, respectively.
The default is FFTW_MEASURE.
If you benchmark FFTW, please use -opatient.
-onthreads=N
Use N threads, if FFTW was compiled with --enable-threads. N
must be a positive integer; the default is N=1.
-onosimd
Disable SIMD instructions (e.g. SSE or SSE2).
-ounaligned
Plan with the FFTW_UNALIGNED flag.
-owisdom
On startup, read wisdom from a file wis.dat in the current directory
(if it exists). On completion, write accumulated wisdom to wis.dat
(overwriting any existing file of that name).
近期下载者：
相关文件：
收藏者：