Statistiques
RANG
N/A
of 301 298
RÉPUTATION
N/A
CONTRIBUTIONS
0 Questions
0 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
5 396 of 21 225
RÉPUTATION
240
CLASSEMENT MOYEN
5.00
CONTRIBUTIONS
8 Fichiers
TÉLÉCHARGEMENTS
11
ALL TIME TÉLÉCHARGEMENTS
2303
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
A soumis
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...
plus de 7 ans il y a | 1 téléchargement |
A soumis
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...
plus de 7 ans il y a | 1 téléchargement |
A résolu
Weighted average
Given two lists of numbers, determine the weighted average. Example [1 2 3] and [10 15 20] should result in 33.333...
plus de 7 ans il y a
A résolu
Times 2 - START HERE
Try out this test problem first. Given the variable x as your input, multiply it by two and put the result in y. Examples:...
plus de 7 ans il y a
A résolu
Find the sum of all the numbers of the input vector
Find the sum of all the numbers of the input vector x. Examples: Input x = [1 2 3 5] Output y is 11 Input x ...
plus de 7 ans il y a
A résolu
Make the vector [1 2 3 4 5 6 7 8 9 10]
In MATLAB, you create a vector by enclosing the elements in square brackets like so: x = [1 2 3 4] Commas are optional, s...
plus de 7 ans il y a
A soumis
Circular-convolution with using cconv(x,y,n)
Circular convolution is the fundamental operation to compute discrete time signals.
plus de 7 ans il y a | 1 téléchargement |
A soumis
Circular-convolution using fft(x) and ifft(X)
Circular convolution using properties of Discrete Fourier Transform.
plus de 7 ans il y a | 1 téléchargement |
A soumis
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.
plus de 7 ans il y a | 2 téléchargements |
A soumis
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.
plus de 7 ans il y a | 2 téléchargements |
A soumis
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.
plus de 7 ans il y a | 1 téléchargement |
A soumis
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.
plus de 7 ans il y a | 2 téléchargements |
