Time–frequency analysis: Difference between revisions

Revision as of 15:10, 26 April 2024

Latest revision as of 21:42, 19 February 2025

(14 intermediate revisions by 6 users not shown)

Line 1:

{{Short description|Techniques and methods in signal processing}}

{{See also|Time–frequency representation}}

In [[signal processing]], '''time–frequency analysis''' comprises those techniques that study a signal in both the time and frequency domains ''simultaneously,'' using various [[time–frequency representation]]s. Rather than viewing a 1-dimensional signal (a function, real or complex-valued, whose ___domain is the real line) and some transform (another function whose ___domain is the real line, obtained from the original via some transform), time–frequency analysis studies a two-dimensional signal – a function whose ___domain is the two-dimensional real plane, obtained from the signal via a time–frequency transform.<ref>L. Cohen, "Time–Frequency Analysis," ''Prentice-Hall'', New York, 1995. {{isbn|978-0135945322}}</ref><ref>E. Sejdić, I. Djurović, J. Jiang, “Time-frequency feature representation using energy concentration: An overview of recent advances,” Digital Signal Processing, vol. 19, no. 1, pp. 153-183, January 2009.</ref>

The mathematical motivation for this study is that functions and their transform representation are tightly connected, and they can be understood better by studying them jointly, as a two-dimensional object, rather than separately. A simple example is that the 4-fold periodicity of the [[Fourier transform]] – and the fact that two-fold Fourier transform reverses direction – can be interpreted by considering the Fourier transform as a 90° rotation in the associated time–frequency plane: 4 such rotations yield the identity, and 2 such rotations simply reverse direction ([[reflection through the origin]]).

Line 110 ⟶ 111:

But time–frequency analysis can.

== TF analysis and Randomrandom Processesprocesses<ref>{{Cite book |last=Ding |first=Jian-Jiun |title=Time frequency analysis and wavelet transform class notes |publisher=Graduate Institute of Communication Engineering, National Taiwan University (NTU) |year=2022 |___location=Taipei, Taiwan}}</ref> ==

For a random process x(t), we cannot find the explicit value of x(t).

Line 147 ⟶ 148:

<math>= R_x(\tau)\int_{-\infty}^{\infty} e^{-j2\pi t\eta}\cdot dt</math><math>= R_x(\tau)\delta(\eta)</math> , (nonzero only when <math>\eta = 0</math>)

=== WhiteAdditive white noise ===

* For additive white noise (AWN),

:<math>E[W_g(t,f)] = \sigma</math>

:<math>E[A_x(\eta,\tau)] = \sigma\delta(\tau)\delta(\eta)</math>

* Filter Design for Whitea signal in additive white noise

[[File:Filter design for white noise.jpg|left|thumb|440x440px]]

Line 170 ⟶ 171:

<math>SNR \approx 10\log_{10}\frac{E_x}{\sigma\Alpha}</math>

=== Non-stationary random processes ===

* If <math>E[W_x(t,f)]</math> varies with <math>t</math> and <math>E[A_x(\eta,\tau)]</math> is nonzero when <math>\eta = 0</math>, then <math>x(t)</math> is a non-stationary random process.

* If

Line 175 ⟶ 177:

*# <math>x_n(t)</math>'s have zero mean for all <math>t</math>'s

*# <math>x_n(t)</math>'s are mutually independent for all <math>t</math>'s and <math>\tau</math>'s

:then:

::<math>E[x_m(t+\tau/2)x_n^*(t-\tau/2)] = E[x_m(t+\tau/2)]E[x_n^*(t-\tau/2)] = 0</math> if <math>m \neq n</math>, then

* if <math>E[W_h(t,f)] =m \sum_{n=1}^kneq E[W_{x_n}(t,f)]n</math>, then

<math>E[A_h(\eta,\tau)] = \sum_{n=1}^k E[A_{x_n}(\eta,\tau)]</math>

::<math>E[W_h(t,f)] = \sum_{n=1}^k E[W_{x_n}(t,f)]</math>

# Random process for [[Short-time Fourier transform|STFT (Short Time Fourier Transform)]]

::<math>E[A_h(\eta,\tau)] = \sum_{n=1}^k E[A_{x_n}(\eta,\tau)]</math>

=== Short-time Fourier transform ===

#* Random process for [[Short-time Fourier transform|STFT (Short Time Fourier Transform)]]

<math>E[x(t)]\neq 0</math> should be satisfied. Otherwise,

<math>E[X(t,f)] = E[\int_{t-B}^{t+B} x(\tau)w(t-\tau)e^{-j2\pi f\tau}d\tau]</math>

<math>=\int_{t-B}^{t+B} E[x(\tau)]w(t-\tau)e^{-j2\pi f\tau}d\tau</math>for zero-mean random process, <math>E[X(t,f)] = 0</math>

#* Decompose by the AF and the FRFT. Any non-stationary random process can be expressed as a summation of the fractional Fourier transform (or chirp multiplication) of stationary random process.

==Applications==

The following applications need not only the time–frequency distribution functions but also some operations to the signal. The [[Linear canonical transform]] (LCT) is really helpful. By LCTs, the shape and ___location on the time–frequency plane of a signal can be in the arbitrary form that we want it to be. For example, the LCTs can shift the time–frequency distribution to any ___location, dilate it in the horizontal and vertical direction without changing its area on the plane, shear (or twist) it, and rotate it ([[Fractional Fourier transform]]). This powerful operation, LCT, make it more flexible to analyze and apply the time–frequency distributions. The time-frequency analysis have been applied in various applications like, disease detection from biomedical signals and images, vital sign extraction from physiological signals, brain-computer interface from brain signals, machinery fault diagnosis from vibration signals, interference mitigation in spread spectrum communication systems.<ref>{{cite book |last1=Pachori |first1=Ram Bilas |title=Time-Frequency Analysis Techniques and Their Applications |publisher=CRC Press|url=https://www.routledge.com/Time-Frequency-Analysis-Techniques-and-their-Applications/Pachori/p/book/9781032435763?srsltid=AfmBOorjwRC4cJ-ABXieBsYLfFSmwQdGQ3GHNvL_O5pGnBMchjM8x7S8}}</ref><ref>{{cite book |last1=Boashash |first1=Boualem |title=Time-Frequency Signal Analysis and Processing: A Comprehensive Reference |publisher=Elsevier|url=https://www.sciencedirect.com/book/9780123984999/time-frequency-signal-analysis-and-processing}}</ref>

===Instantaneous frequency estimation===