Circular convolution using DFT: an example

Поделиться
HTML-код
  • Опубликовано: 19 апр 2017
  • An example illustrating the circular convolution of two sequences using the DFT approach.

Комментарии • 11

  • @nicholasferguson6499
    @nicholasferguson6499 3 года назад

    OMG, this is brilliant

  • @miryalajyothi9631
    @miryalajyothi9631 6 лет назад

    very clear explanation sir
    thank u

  • @miryalajyothi9631
    @miryalajyothi9631 6 лет назад

    very clear explanation sis
    thank u

  • @thetruereality2
    @thetruereality2 4 года назад +1

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

    • @sreeharshaparuchuri6115
      @sreeharshaparuchuri6115 4 года назад

      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.

  • @srinaath9845
    @srinaath9845 5 лет назад

    Thank you so much Sir 👌

  • @sreeharshaparuchuri6115
    @sreeharshaparuchuri6115 4 года назад

    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

  • @GauravBasavaraju
    @GauravBasavaraju 6 лет назад

    it's much easier by matrix method

    • @sreeharshaparuchuri6115
      @sreeharshaparuchuri6115 4 года назад +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.