DSP Processor

-
One of my classmates, sahil- who had already worked on dsp processor helped me understand the dsp processor and how much better it is from the normal processor. It was  particularly interesting to know the difference.

 There are several real time applications of dspp processor.  Code Composer Studio (embedded C language) is use to program the processor. We performed basic arithmetic operations such as addition and multiplication by using this processor. The operations such as circular shifting of data can be done by using this in one clock cycle.

Comments

  1. Gopala15 May 2018 at 07:12

    Can I use Atmel Stufio instead of Code composer studio?

    ReplyDelete
  2. Unknown15 May 2018 at 07:44

    Using this for more complex applications should be fun!

    ReplyDelete
  3. Anonymous15 May 2018 at 08:05

    DSP processors not only have a powerful data path, but also have the ability to move large amounts of data to and from memory quickly.

    ReplyDelete
  4. Unknown15 May 2018 at 08:24

    Also, the DSP is now being implememted using SHARC (super harvard architecture) which gives mugh better results than a digital signal processor.
    The Sharc can perform multiplication along with accumulating while fetching instruction simultaneously which increases the computationa significantly.

    ReplyDelete
  5. Anonymous15 May 2018 at 08:34

    Advancements in technology and architecture, like fast-access two-level and a wider bus system, have increased the performance at lot as well.

    ReplyDelete

Post a Comment

Popular posts from this blog

Exp- 4 Filtering of Long Data Sequence using Overlap Add and Overlap Save method

-
Overlap Add and Overlap Save method are used for filtering long data sequences. Such a long data sequence would need a very high order FFT- which is not feasible and the process can only start after we've obtained the entire data sequence which leads to a delay. The long data sequence is broken into smaller parts and performed FFT analysis. It is then fitted with one another, the overlapped portion is discarded in Overlap Save Method whereas it is added in OAM to get required output sequence.
Read more

Exp-2 Discrete Fourier Transform

-
This practical really helped me understand DFT in a greater depth. It helped me connect the knowledge sir taught in the class, and aquire a greater understanding. In  mathematics , the  discrete Fourier transform  ( DFT ) converts a finite sequence of equally-spaced  samples  of a  function  into a same-length sequence of equally-spaced samples of the  discrete-time Fourier transform  (DTFT), which is a  complex-valued  function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. To understand DFT better, we've performed discrete Fourier transform of a 4 point sequence by coding it. What I learned in that experiment is: 1) Results by DFT are always periodic about the number of input values. 2)The spectrum is discrete from o to pi. 3)Upon zero-padding the input signal, the length of the input signal increased- which increases the frequency spacing. 4)As frequ...
Read more

Exp-3 Fast Fourier Transform

-
Image
Fast Fourier Transform(FFT) A   Fast Fourier transform  ( FFT ) is an algorithm that samples a signal over a period of time (or space) and divides it into its frequency components. FFT is manually verified and performed using flowgraphs. FFT is much faster than DFT and more efficient as it requires less number of real and complex additions and multiplication. The computation is considerably reduced from M2N2 to MNlogMlogN
Read more