Circular convolution using DFT: an example

Поділитися
Вставка
  • Опубліковано 4 січ 2025

КОМЕНТАРІ • 11

  • @nicholasferguson6499
    @nicholasferguson6499 3 роки тому

    OMG, this is brilliant

  • @thetruereality2
    @thetruereality2 5 років тому +1

    Can you perform Linear convolution with this?
    What if the length of both signals are not equal?

    • @sreeharshaparuchuri6115
      @sreeharshaparuchuri6115 5 років тому

      yes, look up linear convolution via circular convolution, it involves zero padding both signals such that they have length n + m - 1, where m and n are the lengths of the two signals. the case in this example is that both the signals aren't of the same length, and as we have to take the N point DFT of both, we sufficiently zero pad the shorter duration signal.

  • @miryalajyothi9631
    @miryalajyothi9631 6 років тому

    very clear explanation sis
    thank u

  • @miryalajyothi9631
    @miryalajyothi9631 6 років тому

    very clear explanation sir
    thank u

  • @sreeharshaparuchuri6115
    @sreeharshaparuchuri6115 5 років тому

    can you please explain how H(3) is the complex conjugate of H(1), from what I learned about the twiddle factor, it should be that H(3) = -H(1).
    could someone please clarify

  • @srinaath9845
    @srinaath9845 6 років тому

    Thank you so much Sir 👌

  • @GauravBasavaraju
    @GauravBasavaraju 6 років тому

    it's much easier by matrix method

    • @sreeharshaparuchuri6115
      @sreeharshaparuchuri6115 5 років тому +6

      the title literally says "using the DFT method", ofc there are other ways to solve this problem, the fact that the matrix method is easier may mean that that is a more covered topic on youtube. what if in your exam youre asked to use the DFT property of circular convolution? youll get exactly zero marks if you solve it in the time domain.