So Jow Forums I need to do a FT (Fourier Transformation) of a EKG graph to get the pulse, so I will use DFT (Discrete Fourier Transformation), but I am not sure how to implement my dataset to the algorithm.
here's one of the EKG graph data:
> pastebin.com
Other urls found in this thread:
mathworld.wolfram.com
blogs.mathworks.com
blogs.mathworks.com
ccrma.stanford.edu
analog.com
ws.binghamton.edu
mathworks.com
twitter.com
>implement my dataset to the algorithm
I'll take statements that make sense to dumb people for $100 Alex
>having to be spoon fed
never gonna make it
It's not like that, I just don't know how to implement my data.
so I am asking how I should do it, and the data is to easily explain how I should do by taking like the first 4 lines or something
99% of programming is finding out solutions on your own, either through google-fu or just being smart and working out the problem in your head
Data set should be extended to complex numbers with imaginary values set to 0. You'll get complex values out, for which you'll want to find the largest magnitude in the new set.
Assuming that's what you were asking, that is
Okay let me be clear what I mean.
How tf do I do a Fourier Transformation?
How should the data set syntax look like when I implement it?
could someone do a short demonstration?
it kinda helps, but I knew this. thanks though
here's your example
mathworld.wolfram.com
Just integrate bro
Again, it's not rocket science dude.
Look up a DSP library, apply a band pass filter to your data, and measure the time between the peaks. How to convert between time between peaks to frequency is left as an exercise to the reader.
Alternatively if you insist on doing it with FFT, segment your signal so as to capture a few pulses with a moving window that moves as often as you want to generate the output data, apply FFT to a segment, gently scale the frequency plot in a pyramid patter centered around, say, 80 bpm to remove outliers, and find the highest peak in the graph.