Re: The points of FFT transform
- From: "Fred Marshall" <fmarshallx@xxxxxxxxxxxxxxxxxxxx>
- Date: Wed, 31 May 2006 11:33:40 -0700
"jia" <jia.qinghua@xxxxxxxxx> wrote in message
news:1149068748.138082.66680@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hi, here
A basic problem of DSP make me confused. When we want to the spectrum
character of a signal sequence, we can use the function "fft( )" of
Matlab.
fft(X,n) returns the n-point DFT.
1) If the length of X is less than n, X is padded with trailing zeros
to length n.
2) If the length of X is greater than n, the sequence X is truncated.
If we want to do a DFT of a sequence of discrete signal X, with the
length of N.
What is the proper points for DFT? just "n=N" is enought, or the
bigger, the better?
If n>N, then padded zeros, it is equal to interpolation. While, if "n"
is infinite, it maybe equal to the fourier transform of continuous
signal. So, I am confused.
What is the proper points for DFT?
The simplest thing to do is to use fft(X).
Anything you do is "proper" if it meets your intent.
It appears you understand what happens if n>N. Unless you need this, it's
extra computation that provides no additional information - just more
points.
Fred
.
- References:
- The points of FFT transform
- From: jia
- The points of FFT transform
- Prev by Date: Re: Exam revision
- Next by Date: Re: Implementing NLMS for Echo cancelation in Speech
- Previous by thread: The points of FFT transform
- Next by thread: GUIDANCE NEEDED FOR PROJECT ON ACTIVE NOISE CONTROL
- Index(es):
Relevant Pages
|