Community Profile

photo

Ashutosh Rout


Last seen: 7 months ago Active since 2018

Statistics

All
  • Personal Best Downloads Level 3
  • First Review
  • 5-Star Galaxy Level 1
  • First Submission
  • Solver

View badges

Content Feed

View by

Submitted


Convolution of periodic sequence using DFT & IDFT.
DFT:Discrete Fourier Transform It computes N equally spaced frequency samples of the DTFT. IDFT:Inverse Discrete Fourier Transfo...

3 years ago | 1 download |

Thumbnail

Submitted


Power Spectral Density of a sequence x(n)using N-point DFT
The power spectral density (PSD) of the signal describes the power present in the signal as a function of frequency, per unit fr...

3 years ago | 2 downloads |

Thumbnail

Submitted


Circular-convolution with using cconv(x,y,n)
Circular convolution is the fundamental operation to compute discrete time signals.

3 years ago | 1 download |

Thumbnail

Submitted


Circular-convolution using fft(x) and ifft(X)
Circular convolution using properties of Discrete Fourier Transform.

3 years ago | 2 downloads |

Thumbnail

Submitted


Circular-convolution without using cconv(x,y,n)
It is used to convolve two Discrete Fourier transform sequences.It is faster for long sequences than linear convolution.

3 years ago | 12 downloads |

Thumbnail

Submitted


Auto-correlation of a sequence x without using xcorr(x)
It is the correlation of a signal with a delayed copy of itself as a function of delay.

3 years ago | 15 downloads |

Thumbnail

Submitted


Cross-correlation sequences x and y without using xcorr(x,y)
Cross-correlation measures the similarity between x and shifted (lagged) copies of y as a function of the lag.

3 years ago | 17 downloads |

Thumbnail

Submitted


Linear Convolution without using conv(A, B)
It is a basic operation to calculate the output for any linear time invariant system given its input and its impulse response.

3 years ago | 2 downloads |

Thumbnail