ME565 Lecture 16: Discrete Fourier Transforms (DFT)

แชร์
ฝัง
  • เผยแพร่เมื่อ 4 ต.ค. 2024

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

  • @peterthomson1753
    @peterthomson1753 10 หลายเดือนก่อน +2

    Just wanted to chime in and say this man is clearly a fantastic lecturer! Very clear definition of what the goal of his teaching, explains every topic in ways simple enough you could probably show this to a high schooler and they'd be able to engage with it.

    • @Eigensteve
      @Eigensteve  10 หลายเดือนก่อน

      Thanks for your kind words :)

    • @peterthomson1753
      @peterthomson1753 10 หลายเดือนก่อน

      @@Eigensteve I'm glad you saw them :) I'm slightly jealous of your students - I'm currently Pershing my master's in Germany, and wish I had lecturers as clear as you in my undergrad & current post-grad program

  • @joschomo1010
    @joschomo1010 3 ปีที่แล้ว +13

    Finally someone who builds it from the gound up and does the examples. thanks

  • @goodlack9093
    @goodlack9093 10 หลายเดือนก่อน +1

    Love your lectures! thank you from Russia!
    You're doing so much for the world sharing this knowledge.

  • @ddaung
    @ddaung 3 ปีที่แล้ว +2

    You are a Great Teacher. Thank you.

  • @RESEARCH100500
    @RESEARCH100500 4 หลายเดือนก่อน

    this video still good and actual, thank You!

  • @sergioquesadaberdonce8748
    @sergioquesadaberdonce8748 3 ปีที่แล้ว +2

    Thanks!!! This saved my essay!

  • @DeSadGuy
    @DeSadGuy 4 ปีที่แล้ว +3

    currently needing to learn DTF for my lab job on ion engine oscillation analysis, this is some good stuff

    • @Eigensteve
      @Eigensteve  4 ปีที่แล้ว +1

      Nice

    • @davidgoodwin16
      @davidgoodwin16 2 ปีที่แล้ว +1

      You building a Millennium Falcon or something ? :)

  • @chippi6999
    @chippi6999 4 ปีที่แล้ว +1

    Well explained. Could understand well. Thank you. And that apple's idft joke. Lol

  • @davidgoodwin16
    @davidgoodwin16 2 ปีที่แล้ว +1

    Fourier was originally ridiculed when he first brought out this idea. Now it forms the basic of modern signal processing which covers pretty much every piece of thigh technology that we have. It goes to show why sticking to your convictions and going against the crowd.

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

      Exactly this. Not only he, but other scientists like Tesla were also laughed at.

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

    Thank you.. that was helpful

  • @pingalastriangle2415
    @pingalastriangle2415 4 ปีที่แล้ว +3

    I think n/N corresponds to x where is 2*pi*k it self shows omega(angular frequency) correct me if I am wrong

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

    Fourier Transforms are definitely more valuable in practice.

  • @arash4232
    @arash4232 2 ปีที่แล้ว +1

    Hi, Why (at 20:55) you supposed that there are exactly N-1 different frequencies? Maybe smaller number of frequencies is enough or, higher number of them is required.

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

      Well, if smaller number of frequencies is needed then some coefficients will be zero. In discrete world, if you have only N points, you cannot get number of frequencies more than N (by the way, there are N frequencies not N-1, 0-s frequency also included).
      This is because discrete signals are periodic in time and in frequency.
      Just imagine that you have 5 points of data on a graph and all of their lengths equal to one, 0-s (0/N) frequency means that there are no oscillations (pulse train) , 1-st (1/N) frequency means that 1/Nth portion of an oscillation/cycle/period is done per one sample, 2-nd (2/N) frequency means that 2/Nth portion of a cycle is done per sample, ..., N-1-s (N-1/N) frequency means that (N-1)/N portion of cycle is done per sample, then if we go to N-s (N/N) frequency it means that entire cycle is done within a span of one sample, which means that nothing has changed it is the same as no oscillations at all. So there are only N distinct frequencies for N-point signal.

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

      @@torebektoregozhin4626 Thank you so much.

  • @wagsman9999
    @wagsman9999 4 ปีที่แล้ว +3

    I SEE IT. Thanks.

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

    I've a few questions bothering me for a long time. These are as follows:
    Q.1 What if my graph of f verses x also has data points for negative values of x? How would I deal with that?
    Q.2 How did you decide the frequency axis while plotting the fast fourier transform? I didn't understand the meaning of the line: freq= 1/(dt*N)*(0:N);
    Please answer my questions.

  • @jb17-ti86
    @jb17-ti86 3 ปีที่แล้ว

    when you have \omega_n = e^{-2pi/N } Is this you converting the matrix back into the natural basis. as opposed to the cos + i sin basis ?

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

    8:00 Why the first order polynomial be a zero slope line?

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

    Professor your appearance has not changed over the years, not even the hair! I never realized that learning hard topics like these can freeze the age of human 😁😆 I suppose that only brilliant genious like professor can achieve that, since the white hair on my head is growing exponentially over the years 🤣

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

    sir i want lecture on discrete fractional fourier transform (DFRFT)

  • @Sana-wr1go
    @Sana-wr1go 2 ปีที่แล้ว

    He looks like an American version of Lee Joon-gi