azaz104
Member level 5
- Joined
- Aug 30, 2005
- Messages
- 85
- Helped
- 14
- Reputation
- 28
- Reaction score
- 11
- Trophy points
- 1,288
- Location
- Ottawa, Ontario, Canada
- Activity points
- 2,453
Can you help me with the following :
I'm supposed to prove the modulation theorem which states that multiplication in time domain is interpreted as convolution in frequency domain:
suppose we have
xn : first signal
yn : second signal
n_x = length(xn); %length of first sig.
n_y = length(yn); % length of second signal
m = min(n_x,n_y);
xy = xn(1:m) .* yn(1:m);
xf = fft(xn,N);
yf = fft(yn,N); %where N is chosen suitably as a power of two and greater than
% max(n_x,n_y)
xy_new = fft(xy,K);
%how could i verify that xy_new equals conv(xf,yf)
if someone knows how could i solve this i would be thankful
I'm supposed to prove the modulation theorem which states that multiplication in time domain is interpreted as convolution in frequency domain:
suppose we have
xn : first signal
yn : second signal
n_x = length(xn); %length of first sig.
n_y = length(yn); % length of second signal
m = min(n_x,n_y);
xy = xn(1:m) .* yn(1:m);
xf = fft(xn,N);
yf = fft(yn,N); %where N is chosen suitably as a power of two and greater than
% max(n_x,n_y)
xy_new = fft(xy,K);
%how could i verify that xy_new equals conv(xf,yf)
if someone knows how could i solve this i would be thankful