To perform the IDFT process from a given discrete sequence in TMS320C5505 KIT.
The algorithm for ifft(X) is the same as the algorithm for fft(X), except for a sign change and a scale factor of n = length(X). As for fft, the execution time for ifft depends on the length of the transform. It is fastest for powers of two. It is almost as fast for lengths that have only small prime factors. It is typically several times slower for lengths that are prime or which have large prime factors.
FFT algorithms can be used to compute an inverse DFT without any change in algorithm. The inverse DFT of an N-point sequence X(k) , k = 0,1, 2, . . . . ., N-1 is defined as
1. Open Code Composer Studio v4 .
2. In WorkSpace Launcher.
BROWSE → Select the project location and make one new folder, MAKE NEW FOLDER → Type the Workspace name, OK → OK.
3. FILE ⇒ NEW ⇒ CCS PROJECT
Project name: Type your project name.
Tick use default location. → NEXT
Project type: C5500.
Tick Debug And Release. → NEXT → NEXT.
Output type: Executable.
Device Variant : TMS320C55XX - TMS320C5505.
Device Endianness : big
Code Generation Tools: TI v4.3.5.
Run time support library: automatic.
Target content: none. →FINISH
4.FILE ⇒ NEW ⇒ SOURCE FILE
Source file: Type your projectname.c( .c extension is must ).
Type the program.
FILE → SAVE.
5. Paste the following board library files in workspace location.
include folder (contains header files)
Gel folder (contains gel file)
Library folder(contains library files)
6. Paste the Linker file in the project location.(linker file is available in cd)
Note: Those folders and linker file are availble at cd.