Sunday, 12 March 2017

OAM and OSM

In previous experiments, FFT was used on short sequences of input. However, in real time, discretized input sequence is very long. This large sequences can't be processed directly. They are first divided into blocks and then thus the real time signal is processed, using DITFFT, block by block. This block of output sequence is then combined together using OAM or OSM and final output is obtained.

Fast Fourier Transform

DFT being inherently slow, a faster,  a better transform, FFT is used. The number of calculations required by FFT is in logarithmic form, hence a processor requires significantly less number of steps to perform a certain set of calculations. Due to this advantage, FFTs are used in signal processing.

Discrete Fourier Transform

The first transform that was practically implemented on the kit was DFT. The input sequence was converted into a sequence using DFT algorithm. Mathematical manipulations is much easier in DFT. However, the number of calculations required are in exponential forms and hence, DFT requires a large amount of computations.

Convolution and Correlation

The very first experiment performed was based in Convolution and Correlation. Convolution gives the output system in accordance with the input whereas correlation gives the similarity between 2 input signals. The developed code was first verified using Linux GCC Compiler. Once the program was built, it was burnt on the board using Code Composer Studio v4. The output was seen using JTAG emulator interface.