- 积分
- 275
- 回帖
- 0
- 西莫币
-
- 贡献
-
- 威望
-
- 存款
-
- 阅读权限
- 10
- 最后登录
- 1970-1-1
该用户从未签到
|
发表于 2011-7-1 10:21
|
显示全部楼层
来自: 中国广东广州
University of Rhode Island Department of Electrical and Computer Engineering
ELE 436: Communication Systems
FFT Tutorial
1 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 thing as the
DTF, but in much less time.
Ok, but what is the DFT? The DFT is extremely important in the area of frequency (spectrum)
analysis because it takes a discrete signal in the time domain and transforms that signal into its
discrete frequency domain representation. Without a discrete-time to discrete-frequency transform
we would not be able to compute the Fourier transform with a microprocessor or DSP based system.
It is the speed and discrete nature of the FFT that allows us to analyze a signal's spectrum with
Matlab or in real-time on the SR770 |
|