A Frequency analysis of signal with unknown period

AI Thread Summary
The discussion centers on the challenges of frequency analysis for signals with unknown periods, particularly when using the discrete Fourier transform (DFT). It highlights that DFT requires a complete period for accurate frequency representation, and limitations arise when the lowest frequency is unknown or when sampling time is insufficient. Participants suggest exploring statistical inference to estimate harmonic coefficients and recommend longer sampling durations or model-based approaches if the number of components is known. The conversation emphasizes the importance of understanding the relationship between sampling time, frequency resolution, and aliasing. Overall, the need for alternative methods to analyze such signals is clearly articulated.
petterg
Messages
162
Reaction score
7
I was reading up on (discrete) Fourier transform when my mind started to think of an what-if scenario:

Assumed I'm sampling a signal of the form
a1*sin(b1+c1) + a2*sin(b2+c2) + a3*sin(b3+c3) + ... + aN*sin(bN+cN) + some noise
where the a's represents magnitudes, b's represents frequencies and c's represents phases.
Assumed it is not know how low the lowest frequency is. It may not even be a full period within the time frame of sampling. Is there any way to find the frequencies represented in the data set?
(As I understand the DFT requires the sample set to be one repeating period of the signal.)
 
Physics news on Phys.org
In the DFT the dwell time (the time between two samples) is 1/bandwidth, so the Nyquist frequency is half of that. That limits the highest frequency which can be faithfully represented without aliasing.

In contrast the total sampling time gives the inverse of the frequency resolution and determines how close two signals may be and still be distinguished. So this would determine how close a frequency could be to DC and still be detected.
 
  • Like
Likes jim mcnamara
Thanks Dale
As expected this was out of range for DFT. What should I look into to solve this kind of problems?
 
Hey petterg.

If you are using statistical inference you could estimate the coefficients of each harmonic and make inferences on those.
 
petterg said:
Thanks Dale
As expected this was out of range for DFT. What should I look into to solve this kind of problems?
I would recommend just sampling longer. You can use model-based approaches if you know N.
 
Thanks
I pick statistical inference as my next reading
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top