FFT of DSP c (F2812)
2016-08-23
4 0 0
4.0
Other
Earn points
Fast Fourier Transforms are an efficient class of algorithms for the digital computation
of the N-point Fourier transform (DFT). In general, their input sequence are assumed to
be complex. In many real applications, the data sequences to be processed are real valued.
Even though the data is real, complex-valued DFT algorithm can still be used. One simple
approach creates a complex sequence from the real sequence; that is, real data for the real
components and zeros for the imaginary components, The complex FFT can then be =applied directly.
However, this method is not efficient as it consumes 2N memory locations (Real & Imaginary)
for N point sequence. When input is purely real, their symmetric properties compute DFT very
efficiently. One such optimized real FFT algorithm for 2N-point real data sequence is packing
algorithm. The original 2N-point sequence is packed as N-point complex sequence and N -point
com
of the N-point Fourier transform (DFT). In general, their input sequence are assumed to
be complex. In many real applications, the data sequences to be processed are real valued.
Even though the data is real, complex-valued DFT algorithm can still be used. One simple
approach creates a complex sequence from the real sequence; that is, real data for the real
components and zeros for the imaginary components, The complex FFT can then be =applied directly.
However, this method is not efficient as it consumes 2N memory locations (Real & Imaginary)
for N point sequence. When input is purely real, their symmetric properties compute DFT very
efficiently. One such optimized real FFT algorithm for 2N-point real data sequence is packing
algorithm. The original 2N-point sequence is packed as N-point complex sequence and N -point
com
c
dsp
fft
程序
语言
Related Source Codes
PClite
0
0
no vote
generic embeded FTP Client
0
0
no vote
UDP Test Demo
0
0
no vote
TMS320F28335 DSP transmits data to EEPROM through
0
0
no vote
TMS320F28335 CAN communication source code
0
0
no vote
No comment