Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Convolution Problems (something ....!!!??)

Status
Not open for further replies.

baby_1

Advanced Member level 1
Advanced Member level 1
Joined
Dec 3, 2010
Messages
415
Helped
1
Reputation
2
Reaction score
1
Trophy points
1,298
Activity points
4,277
Hello
we have

16_1346656775.jpg

96_1346656825.jpg


so
34_1346656439.jpg


but as you know x[n]*h[n]=h[n]*x[n] why it get infinite value but if we assume that
0_1346656889.jpg
it solve fine?!!!!!
 
Last edited:

u[n] is an unit step fn right

then the limit of summation must be from 0 to n and not -infinity to n

guess i am not wrong
 

Hi,

The result is not infinite.
The summation is solved as a geometrical series. I got as total result: 3*(1/2)^n .

@ Jeffrey Samuel: x[n] is not multiplied by u[n] (i.e. it is not time limited). h[n] is, and its step becomes u[n-k] in the summation.

Regards

Z
 
Also you can perfom the convolution process in the frequency domain where the convolution of two discrete quantities x of n and h of n as given above is just the multiplication of the same signals when transformed to the frequency domain ie X of w and H of W
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top