Tutorial: Convolution sum

แชร์
ฝัง
  • เผยแพร่เมื่อ 18 ม.ค. 2025

ความคิดเห็น • 44

  • @RoseHulmanOnline
    @RoseHulmanOnline  11 ปีที่แล้ว +6

    The method shown here is based on what physically happens with the system. Each input sample triggers its own scaled and shifted (delayed) impulse response, and these are all added together to form the output. Look particularly at 7:42, and you can see the effect of the delay in the argument for h, it appears as h[n-1]. The other method that you are thinking about ("flip and slide") is based on the convolution sum equation; the delay shows up as negated time index (k) and that's why h must flip.

  • @Tobiasz931
    @Tobiasz931 11 ปีที่แล้ว +9

    Thank you so much for those videos! I passed my exam only thanks to those (it's not really my field as I study IT)! It also helped a lot of my friends.

  • @bryandavis2571
    @bryandavis2571 9 ปีที่แล้ว +4

    Great video this is way easier than the way I learned

  • @karlchua9188
    @karlchua9188 9 ปีที่แล้ว +1

    Taking my DSP Lectures this year and this helped me a lot! Too bad my professor cannot really explain this well. Thank you very much Rose-Hulman. Cheers from the Philippines

    • @eggxecution
      @eggxecution ปีที่แล้ว

      currently studying for boards and understanding this for the first time I'm struggling 😂

  • @EssayWriting-h2c
    @EssayWriting-h2c 11 หลายเดือนก่อน

    Thanks, I have been struggling to understand this concept but you made it easy !

  • @sdavid78
    @sdavid78 11 ปีที่แล้ว +1

    In the example at 6:00, h[n]={1,2,-1} with the second term underlined, indicating h[-1]=1 ; h[0]=2; h[1]=-1. Is it possible for the impuse response of a LTI system to be defined for negative n "h[-1]=1"? doesn't that mean to have a value for the impulse response prior to the impulse?

    • @suyashmisra7406
      @suyashmisra7406 2 ปีที่แล้ว

      yes, such systems are called non causal systems. In practice, you can implement it if you use delays.

  • @isaroque1773
    @isaroque1773 9 ปีที่แล้ว +1

    OMG thank you so much for this vídeo. In 5 minutes I understood, in a much simpler way, the convolution summation. :D

  • @christerranaldo906
    @christerranaldo906 3 ปีที่แล้ว

    Thanks! Now that I have seen an example I understand it much better

  • @aokay720
    @aokay720 3 ปีที่แล้ว

    Thank you so much for taking the time to help me with this!

  • @seaburyneucollins688
    @seaburyneucollins688 3 ปีที่แล้ว

    Wow, so this is what my textbook was trying to explain to me? I I regret spending so much time trying to decipher that load of gibberish, when I could have just watched this video instead!

  • @nikoofayyaz8811
    @nikoofayyaz8811 5 หลายเดือนก่อน

    thanks for the helpful video . just a question: what is the center if the number of h[n] is even?

  • @RoseHulmanOnline
    @RoseHulmanOnline  11 ปีที่แล้ว +2

    Reply to Trần Hồng Phúc: The two formulas are equivalent: your equation (Xmax+Hmax) - (Xmin+Hmin)+1 = (Xmax-Xmin) + (Hmax-Hmin) +1 = (Xmax-Xmin+1) + (Hmax-Hmin+1) - 1 = Xlength + Ylength - 1 = equation in video.

  • @morendav
    @morendav 11 ปีที่แล้ว

    Is there a reason that you did not need to flip the LTI system (H) due to the negative sign infron of the k in h(n-k) ???
    Please let me know as I am confused

  • @tranhongphucdt
    @tranhongphucdt 11 ปีที่แล้ว

    Your tutorial is very understandable and usefull,but, your fomular for calculating the length of y is only right in this case, the others will be wrong. Could you take look again?

  • @YewJiaMing
    @YewJiaMing 11 ปีที่แล้ว

    it was really easy to understand, besides, the method introduced in the example is really convenient.

  • @SwathiMenta
    @SwathiMenta 12 ปีที่แล้ว

    Amazing video! Was of tremendous help! Thank you :)

  • @mcculloughmusprime
    @mcculloughmusprime 12 ปีที่แล้ว +1

    Wow. Discrete convolution is a lot simpler than continuous.

  • @sahilgoyal1124
    @sahilgoyal1124 12 ปีที่แล้ว

    nice video...good job helped me a lot

  • @tanjuthechill4871
    @tanjuthechill4871 3 ปีที่แล้ว

    For given y(n) and h(n)
    What will be input x(n)
    ??

  • @andrewdavis6191
    @andrewdavis6191 9 ปีที่แล้ว

    elegant explanation! thank you

  • @xoraxera
    @xoraxera 8 ปีที่แล้ว

    Thank you so much! This was reallyyy helpfull!

  • @CoupedUpGenny
    @CoupedUpGenny 9 ปีที่แล้ว

    how would you multiply it , without a shift?

  • @deathbypenguins
    @deathbypenguins 9 ปีที่แล้ว

    This is a technique very different that what my professor taught us. A good shortcut, but I don't think my professor would be too impressed with it... Lol.

  • @tranhongphucdt
    @tranhongphucdt 11 ปีที่แล้ว

    Generally, the length of y =(max index x+max index h) - (min index x+min index h) +1

  • @killZtheterrannoob
    @killZtheterrannoob 12 ปีที่แล้ว +2

    Thanks very useful XD

  • @volkerblock
    @volkerblock 11 ปีที่แล้ว

    right picture: delta or h [n-5] ?

    • @RoseHulmanOnline
      @RoseHulmanOnline  11 ปีที่แล้ว

      h[n-5]... I caught this problem earlier and have the "CORRECTION" in the video description.

  • @HarryXiVlog
    @HarryXiVlog 10 ปีที่แล้ว

    helps a lot! thx

  • @usmanhari7800
    @usmanhari7800 11 ปีที่แล้ว

    This video solved my 1 year old problem

  • @al.qasimi
    @al.qasimi 11 ปีที่แล้ว

    Thank you so much

  • @volkerblock
    @volkerblock 11 ปีที่แล้ว

    good video, thank you

  • @electrical4th371
    @electrical4th371 8 ปีที่แล้ว

    nice tutorial

  • @김뫄뫄-f2u
    @김뫄뫄-f2u 9 หลายเดือนก่อน

    감사합니다

  • @CreativeBangla
    @CreativeBangla 5 ปีที่แล้ว

    Thank you so much. :)

  • @xMrJanuaryx
    @xMrJanuaryx 8 ปีที่แล้ว

    I dont understand why its x[k]h[n-k] where does the -k come from why not +k?

    • @xMrJanuaryx
      @xMrJanuaryx 8 ปีที่แล้ว

      OH! Cause its a x(+k) if it were x(-k) then it would be h(n+k)!

  • @deweymoorejr
    @deweymoorejr 7 ปีที่แล้ว

    Very nice

  • @harry4676
    @harry4676 2 ปีที่แล้ว

    Tks u

  • @ArcaneKn1ght
    @ArcaneKn1ght 12 ปีที่แล้ว

    Chuck Norris is drawing this graphics.