Ashutosh Rout

Last seen: 3 years ago | Active since 2018

Followers: 0 Following: 0

Message

Statistics

All

View badges

Feeds

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...

5 years ago | 5 downloads |

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...

5 years ago | 3 downloads |

Submitted

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

5 years ago | 1 download |

Submitted

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

5 years ago | 4 downloads |

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.

5 years ago | 11 downloads |

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.

5 years ago | 6 downloads |

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.

5 years ago | 5 downloads |

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.

5 years ago | 1 download |

Ashutosh Rout

Statistics

Personal Best Downloads Level 3

File Exchange

First Review

File Exchange

5-Star Galaxy Level 1

File Exchange

First Submission

File Exchange

Solver

Cody

Feeds