discrete fourier transform -凯发k8网页登录
discrete fourier transform
description
the dsp.fft
system object™ computes the discrete fourier transform (dft) of an input using fast fourier
transform (fft). the object uses one or more of the following fast fourier transform (fft)
algorithms depending on the complexity of the input and whether the output is in linear or
bit-reversed order:
to compute the dft of an input:
create the
dsp.fft
object and set its properties.call the object with arguments, as if it were a function.
to learn more about how system objects work, see what are system objects?
creation
description
returns a ft
= dsp.fftfft
object that computes the discrete fourier transform (dft)
of a real or complex n-d array input along the first dimension using
fast fourier transform (fft).
returns a ft
= dsp.fft(name,value
)fft
object with each specified property set to
the specified value. enclose each property name in single quotes. unspecified properties
have default values.
properties
usage
syntax
input arguments
output arguments
object functions
to use an object function, specify the
system object as the first input argument. for
example, to release system resources of a system object named obj
, use
this syntax:
release(obj)
examples
algorithms
this object implements the algorithm, inputs, and outputs described on the fft block reference page. the object properties correspond to the block parameters.
references
[1] fftw ()
[2] frigo, m. and s. g. johnson, “fftw: an adaptive software architecture for the fft,” proceedings of the international conference on acoustics, speech, and signal processing, vol. 3, 1998, pp. 1381-1384.
extended capabilities
version history
introduced in r2012a