DSPP Lab Experiences

Programming the codes of this experiment was confusing and time-consuming as it involved manipulations in the various signal lengths of inputs, decomposed inputs, decomposed outputs and the final result. This had me referring the class notes and online resources, again and again, to make changes in the code and finally, the result was satisfactory. Also, many of my concepts were strengthened and overall it was a great programming assignment!

Using structures for performing operations on complex numbers made programming this experiment relatively simpler. I have used recursion in the FFT function which makes it functional for any radix-2 value of N, unlike the example codes provided, which had separate functions for different values of N. Because of this, the input signal of any length has to be first converted into a radix-2 form by appending the necessary amount of 0's and then calculating FFT. IFFT simply uses FFT for its calculation.

This experiment gave me an opportunity for relearning concepts of structures in C as I looked for methods to represent complex numbers in a C program other than using arrays. The resulting code was generalized and could be used for any arbitrary value of N.

Being the first experiment on this subject, this was a somewhat new kind of practical session as compared to other subjects. Programming concepts specific to C, like array handling in functions, pointers, I/O operations were reintroduced after several months' gap since the last C program I had written. Because of this, the 2 hours allotted for the experiment proved to be insufficient and we ended up using the example codes to complete our journal observations.