Fourier
共 156 篇文章
Fourier 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 156 篇文章，持续更新中。
Fast Fourier Transform in C
Fast Fourier Transform in C
Fourier-Mellin算法
Fourier-Mellin算法，更多细节请看下面的网址： http://www.ecs.soton.ac.uk/~aiw99r/fm_transform/
Toolbox for Numerical Computing with MATLAB （by Cleve Moler). Numerical Computing with MATLAB （
Toolbox for Numerical Computing with MATLAB （by Cleve Moler).
Numerical Computing with MATLAB （by Cleve Moler) is a textbook for an introductory course
in numerical methods, Matlab, and technica
Radix-2 Fast Fourier Transform, real or complex sin/cos transform
Radix-2 Fast Fourier Transform, real or complex sin/cos transform
BDF法解分数阶微分方程,分数阶导数定义系数通过fourier法计算
BDF法解分数阶微分方程,分数阶导数定义系数通过fourier法计算
obtain the fourier series
obtain the fourier series
算法计算n=1到N的Fourier系数偶次谐波抽样点上的直流分量
算法计算n=1到N的Fourier系数偶次谐波抽样点上的直流分量
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FF
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the sourc
A 64 points Discrete Fourier Transform code in AVR asm.
A 64 points Discrete Fourier Transform code in AVR asm.
A Numerical Photonics library written in C++. The library includes beam propagation method, coupled
A Numerical Photonics library written in C++. The library includes beam propagation method, coupled mode method, Bragg Gating Analysis, transfer matrix method, and vectorial Fourier Decomposition meth
分数阶Fourier变换程序
分数阶Fourier变换程序，为求解分数阶方程提供了一些数值解法。
FRFT时频变换代码（参考算法：H.M. Ozaktas, M.A. Kutay, and G. Bozdagi.Digital computation of the fractional Fouri
FRFT时频变换代码（参考算法：H.M. Ozaktas, M.A. Kutay, and G. Bozdagi.Digital computation of the fractional Fourier transform.IEEE Trans. Sig. Proc., 44:2141--2150, 1996.）
16点FFT VHDL源程序
16点FFT VHDL源程序，The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data
is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for
【原 书 名】 A First Course in Wavelets with Fourier Analysis 【原出版社】 Addison Wesley/Pearson 【作 者】[
【原 书 名】 A First Course in Wavelets with Fourier Analysis
【原出版社】 Addison Wesley/Pearson
【作 者】[美]Albert Boggess,Francis J.Narcowich [同作者作品] [作译者介绍]
【译 者】 芮国胜[同译者作品] 康健 等
【丛 书 名】 国外电子与通信教材系
快速傅里叶变换（FFT）算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radi
快速傅里叶变换（FFT）算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used
A fourier filter for time-series signals. Does not require the Signal Processing Toolbox. There is
A fourier filter for time-series signals. Does not
require the Signal Processing Toolbox.
There is an interactive version with sliders that
allow you to adjust the filter parameters
continuously w
8点基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Se
8点基二fft
Fast Fourier Transform (FFT).
Using 8 points, takes about 1.2 ms to execute one FFT.
Sets up General Purpose Timer 1 to generate events at 10 kHz.
Will produce 10 kHz output on T1PWM an
Computing-the-2-D Discrete-Fourier-Transform IEEE article
Computing-the-2-D Discrete-Fourier-Transform
IEEE article
Example - 3-D Stem Plot of an FFTFor example, fast Fourier transforms are calculated at points aroun
Example - 3-D Stem Plot of an FFTFor example, fast Fourier transforms are calculated at points around the unit circle on the complex plane. So, it is interesting to visualize the plot around the unit
this is fourier transformation algorithm programmed in java
this is fourier transformation algorithm programmed in java