DSP Processor

-
The aim of this experiment was to perform various operations on DSP Processor. We used TMS320F2855 processor to perform those tasks. We used Code Composer Studio to program to processor. We performed Arithmetic operations like Addition, Subtraction, Multiplication and logical Operations like AND, OR, NOT.The change in the register values was observed. 

Comments

  1. utkarsha@tilakMay 15, 2018 at 7:13 AM

    convolution and correlation is done fast

    ReplyDelete
    Replies
    1. UnknownMay 15, 2018 at 9:13 PM

      It has special processing units like MAC and Special addressing modes that make the program simple reducing the number of steps and making process faster.

      Delete
  2. MayurLankhande2510May 15, 2018 at 7:19 AM

    This comment has been removed by the author.

    ReplyDelete
  3. UnknownMay 15, 2018 at 7:25 AM

    circular addressing is also present in this board

    ReplyDelete
    Replies
    1. UnknownMay 15, 2018 at 9:16 PM

      circular addressing of DSP processor is used in Circular Convolution for shifting oprations.

      Delete
  4. MayurLankhande2510May 15, 2018 at 7:26 AM

    DSP processors are widely used in applications like Image Processing and Speech Recognition

    ReplyDelete
    Replies
    1. UnknownMay 15, 2018 at 9:18 PM

      They are used in applications like RADAR, digital telephones etc.

      Delete
  5. tilakmunshiMay 15, 2018 at 9:16 AM

    DSP processor are very efficient in doing all the Digital Signal Processing tasks. Image processing is the one region, which I have studied its application.
    Good Work

    ReplyDelete
  6. Omkar SawantMay 15, 2018 at 9:53 AM

    DSP processors also have special inbuilt hardware like MAC to perform the DSP functions.It has ability to perform real time applications efficiently which we cannot do in general purpose boards.

    ReplyDelete
    Replies
    1. UnknownMay 15, 2018 at 9:17 PM

      MAC unit is used for array operations of add multiply shift.

      Delete

Post a Comment

Popular posts from this blog

Overlap Add Method and Overlap Save Method

-
This was 4th experiment. In this experiment we perform filtering of Long Data Sequences using OAM and OSM. To perform a c program was written and executed and output was found as desired. Overlap Add Method        In this method input signal x(n) is decomposed into no. of L point sequences using formula N=L+M-1, where M is length of h(n) and N is assumed to be Radix2 value. Then we find linear convolution between every decomposed signal and h(n) using FFT algorithm. The Inverse FFT is then performed on all output signals and the outputs are added to get final result. Overlap Save Method       In this method input signal x(n) is again decomposed into L point sequences using formula N>=L+M-1, where M is length of h(n) and N is assumed to be Radix2 value. Here every decomposed signal is begins with (N-L) last values of previous signal. Then we find linear convolution between every decomposed signal and h(n) using FFT algorithm. The Inverse FFT is...
Read more

DSPP Course Review

-
On the lecture of the DSP subject I was absent because of the internship so I won't be able give the first day or first week review of the course. From next week I started attending lectures and my first lecture was on DFT algorithm. DSP subject was the continuation the 'Signals and System' subject which was also taught by Talele sir so we knew some basic concepts of signals, filters already. From 1st module, we found how DFT is obtained using DTFT from sampling and by DFT formulas. But after completion of DFT module we found that the number of computations in DFT were too large. so we were introduced to FFT algorithm as 2nd module which was faster in performance. But there were some disadvantages of FFT so we went for OAM and OSM. 3rd module was on Filter design, we designed IIR filters by IIM and BLT method and FIR filters by Windowing and frequency sampling method. 4th module was on quantization  of filter parameters. In which we learned about Input, output, coefficie...
Read more