0
$\begingroup$

First of all, I'm not a signal processing expert. Actually, I'm trying to benefit from some concepts of signal processing theory in my computer science research.

My problem is that, I have to find out the frequencies of a binary signal in run-time/real-time. I was thinking about an adaptive approach to compute DFT. but I'm not sure if this may give me the expected outcome.

What I'm doing is:

  1. Recording the zero-one series in a buffer represents a time window (T).
  2. Analyse the recorded buffer to find out the frequencies (Fs).
  3. Feed Fs from step 2 to decision making algorithm.
  4. Repeat (1&2) to adapt decision of step 3.

Where should I start? and what topics I have to read before go farther?

$\endgroup$
  • $\begingroup$ The FFT algorithm is an adaptive approach to computing the DFT. It determines the frequency bin in log2(N) iterations, where N is the length of the sequence. $\endgroup$ – Dan Boschen Dec 30 '18 at 11:27

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.