Fourier
共 156 篇文章
Fourier 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 156 篇文章，持续更新中。
一种基于FPGA的FFT分析方法
<p> DFT(Discrete Fourier Transformation)是数字信号分析与处理如图形、语音及图像等领域的重要变换工具，直接计算DFT的计算量与变换区间长度N的平方成正比。当N较大时，因计算量太大，直接用DFT算法进行谱分析和信号的实时处理是不切实际的。快速傅立叶变换(Fast Fourier Transformation，简称FFT)使DFT运算效率提高1～2个数量
工程数学 积分变换(第四版)-张元林 高等学校教材
<p>《工程数学·积分变换第四版》是2003年高等教育出版社出版的图书，作者是张元林。本书主要介绍Fourier变换和Laplace变换这两类分变换的基本内容。</p><p><br/></p><p>本书介绍 Fourier 变换和 Laplace 变换这两类积分变换的基本内容 , 初版
于 1978 年 , 再版于 1982 年 , 三版于 1989 年 .本次修订, 其基本内容符合原国
家教
Labview的快速傅里叶变换的实现
<p style="margin-top:8px;text-indent: 32px;line-height:27px;background:#FAFAFA">FFT（Fast Fourier Transformation），即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。DFT对于X（K）的每个K值，需要进行4N次实数
fft信号分析
<p>
<span style="white-space:normal;">快速傅里叶变换，</span>fft应用实例。供学习，供参考。
</p>
<p>
原理：快速傅里叶变换 (fast Fourier transform), 即利用计算机计算离散傅里叶变换（DFT)的高效、快速计算方法的统称，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机
OFDM+Wireless+LANS
Before delving into the details of orthogonal frequency division multiplexing (OFDM), relevant<br />
background material must be presented first. The purpose of this chapter is to provide the necessar
Hybrid+Analog-Digital+Precoding
In this paper we revisit hybrid analog-digital precoding systems with emphasis on their modelling<br />
and radio-frequency (RF) losses, to realistically evaluate their benefits in 5G system implement
gibbs抽样 matlab实现
使用matlab实现gibbs抽样，<a href="https://victorfang.wordpress.com/2014/04/29/mcmc-the-gibbs-sampler-simple-example-w-matlab-code/" rel="nofollow" target="_blank" style="box-sizing:border-box;outline:0px;mar
A pipeline fast fourier transform
一中流水线结构的FFT，构建的一中新的FFT，基于流水线结构使得其运行速度更快，更适合实用。
These Fourier routines were originally based on the Fourier routines of the same names from the
These Fourier routines were originally based on the Fourier
routines of the same names from the NETLIB bihar and fftpack
fortran libraries developed by Paul N. Swarztrauber at the National
基于分数阶Fourier变换的水声信道参数估计
基于分数阶Fourier变换的水声信道参数估计
分数阶Fourier变换及其应用 经典文献 1996年
分数阶Fourier变换及其应用 经典文献 1996年
DSP and fourier transforms
DSP and fourier transforms
Image enhancement in frequency domain using Fourier center frequency, Gaussian lowpass filter, Low p
Image enhancement in frequency domain using Fourier center frequency, Gaussian lowpass filter, Low pass filter, high pass filter. Image restoration using medean filter, weiner filter with noise genera
Short Fourier Transform for a non periodical signal
Short Fourier Transform for a non periodical signal
compuete the fast fourier transformation of the image. it is very fast compare than fourier transfor
compuete the fast fourier transformation of the image. it is very fast compare than fourier transformation.
Contourlet is a new approach in image transform. There have something better than Fourier and Wavale
Contourlet is a new approach in image transform. There have something better than Fourier and Wavalet transform.
A basic Fourier transform identity coupled with an iterative convergence algorithm provides a powerf
A basic Fourier transform identity coupled with an iterative convergence algorithm provides a powerful method to align band-limited signals.
Fast Fourier Transform using MPI libraries (Source Code)
Fast Fourier Transform using MPI libraries (Source Code)
This is a simple one dimensional Fast Fourier Transform (and Inverse FFT) test program. FFT(and Inve
This is a simple one dimensional Fast Fourier Transform (and Inverse FFT) test program. FFT(and Inverse FFT) is implemeted as a function. 2^n-point FFT is possible.
Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version
Getting to Know the FFT
What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version of the Discrete
Fourier Transform (DFT). The FFT utilizes some clever algorithms to do the same thi