搜索资源列表
DFT2D
- 采用OPENCV封装的图像二维DFT运算，通过该类可生成图像二维傅里叶变换矩阵，通过可选参数可调整生成傅里叶矩阵、傅里叶频谱同时可选择对数加强属性增强傅里叶频谱的显示效果。-OPENCV package using two-dimensional DFT computation of image, the image can be generated through such two-dimensional Fourier transform matrix generated by the op
efficient_registration
- 利用傅里叶变换，在频域上对两幅图像配准，是一种比较配准的新方法，但是对弹性配准的效果不是很好 需要进一步的研究。-Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsamp
DFTmatlab
- DFT in matlab, the code is a example of long time in computation.
dft
- 计算dft的程序，可输出变换后序列到txt文件，并可显示计算时间-Dft calculation procedure, the transformed output sequence to the txt file, and may show the computation time
F2812-FFT
- FFT 并不是一种新的变换，它是离散傅立叶变换（DFT）的一种快速算法。由于我们在计算DFT 时一次复数乘法需用四次实数乘法和二次实数加法；一次复数加法则需二次实数加 法。每运算一个X（k）需要4N 次复数乘法及2N+2（N-1）=2（2N-1）次实数加法。所以 整个DFT 运算总共需要4N^2 次实数乘法和N*2(2N-1)=2N(2N-1)次实数加法。如此一来，计算时乘法次数和加法次数都是和N^2 成正比的，当N 很大时，运算量是可观的，因而需要 改进对DFT 的算法减少运算速度
my8ditfft
- 基8-DFT计算，每8点为一蝶形运算单元，4096点计算效率较基2-DFT提高50 -Yl 8-DFT calculation, every 8 points for a butterfly operation unit, the 4096-point computation efficiency than the base 2-DFT increased by 50
KeygenCircuitMakerV6.0Pro
- A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the
LibProteus
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
ThamKhaoCodeCaAssembly
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
slau213a
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
ICEIC2006_hybridarchitecture
- This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architec
efficient_registration
- 利用傅里叶变换，在频域上对两幅图像配准，是一种比较配准的新方法，但是对弹性配准的效果不是很好 需要进一步的研究。-Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsamp
10BEC047
- Pipeline FFT processor is a specified class of processors for DFT computation utilizing fast algorithms
DSP_1
- 1) Goertzel algorithm 2) Chirp transform algorithm 3) Verification of signal flow graphs for DIT and DIF FFT algorithm 4) Elapsed CPU time for DFT and FFT computation 5) Alternative IDFT computations
06168353
- The Fast Fourier Transform (FFT) is one of the rudimentary operations in field of digital signal and image processing. Some of the very vital applications of the fast fourier transform include Signal analysis, Sound filtering, Data compressio
DFT-SEQUENCES
- COMPUTATION OF DFT SEQUENCES
fft
- 实现功能：基8实现64点FFT处理器（进行两次8点FFT计算，采用基8进行64点） 详细说明：硬件结构包括六部分，分别为输入模块、8点FFT模块、乘法模块、顺序调整模块、输出模块和总控制模块。 其中，输入模块的主要功能是将串行输入的64个数据进行分类，分成8批次，每次8个输入到8点FFT模块中进行计算。 8点FFT模块：FFT是DFT的快速算法，当点数较大时，可以较大的减少DFT的运算量。常用的FFT算法主要有两种，分别为按时间抽选的FFT算法（DIT-FFT）和按频率抽选的FFT算