Polyspectra

From testwiki
Jump to navigation Jump to search

Template:Short description

Polyspectra, also known as higher-order spectra, are frequency-domain statistical quantities that generalize the spectral density (power spectrum) to higher orders. Polyspectra of a given signal can reveal non-Gaussian behavior, time-inversion asymmetries, and phase correlations between different frequency contributions to the signal. While a standard power spectrum quantifies the distribution of intensity across frequencies, polyspectra characterize higher-order phase and amplitude correlations between frequency components. Higher-order spectra include the third-order bispectrum, the fourth-order trispectrum, and their multivariate generalizations.

Definition

In his original publications, Brillinger considers a stationary process (the signal) z(t) and its multi-time cumulant.[1] f(τ1,⋯,τn−1)=Cn(z(t),z(t+τ1),⋯,z(t+τn−1)). The cumulant does not depend on t since z(t) is stationary. This allows for a definition of n-th order polyspectra Sz(n) of a stationary signal z(t) by Cn(z(ω1),⋯,z(ωn))=2πδ(ω1+⋯+ωn)Sz(n)(ω1,⋯,ωn−1) with the Fourier transform z(ω)=∫−∞+∞eiωτz(τ)dτ, and the Dirac delta function δ which appears due to the independence of f on t. [2]

The second order spectrum can be rewritten as Sz(2)(ω)=∫−∞+∞eiωτC2(z(t+τ),z(t))dτ, where C2(x,y)=⟨xy⟩−⟨x⟩⟨y⟩ is the covariance. The representation of Sz(2) is equivalent to the definition of the spectral density of z (power spectrum) as Fourier transform of the autocorrelation function of z(t).

History of polyspectra

Higher-order spectra were formalized in the works of Brillinger starting in the 1950s.[1] Mendel and Nikias contributed the first major reviews on the topic in the early 1990s,[3][4] resulting in the "Higher Order Spectral Analysis Toolbox" (HOSA), a software library that included the bispectrum and some fourth order statistics.[5] However, Birkelund stated in 2003: "In theory, polyspectra can be applied to solve many important problems in signal processing and data analysis. In practice, however, one has been discouraged by the poor statistical properties of most polyspectral estimators."[6] In 2026, unbiased cumulant-based estimators for higher-order spectra were proposed and analyzed.[7] They are implemented in GPU-accelerated software libraries based on ArrayFire[8] and alternatively based on PyTorch.[9]

Numerics of polyspectra

The definition of polyspectra assumes a stationary process z(t) that is known with an infinite temporal resolution in an infinite temporal interval. Real world data z(t) allow therefore only for the calculation of estimates of polyspectra. These estimates have finite spectral resolution and finite accuracy.

Classical estimators

Direct Fourier methods usually start with the Fourier transform of the entire signal resulting in a high frequency resolution with large variance (error). Subsequently, a smoothing kernel can be applied to trade resolution for variance. Alternatively, spectra of segments of the signal are averaged (Welch-type method). [10]

The lag window method relies on estimating cumulants in the time-domain and subsequent application of Fourier transforms.

Multitaper methods consider the entire signal tapered (windowed) with orthogonal tapers. Spectra for separate tapers are then averaged.[6]

The classical methods rely on cumulant estimators that are only asymptotically unbiased.

Unbiased cumulant-based estimators

The following equations provide an unbiased estimate (estimator) of polyspectra up to fourth order.[7] Fourier coefficients of z(t) ak=TN∑j=0N−1gjzje2πikj/N, are calculated from the process zj=z(jT/N−t0) which is divided into windows of length T with N points per window. A window function gj=g(jT/N) reduces spectral leakage.

Approximate polyspectra are obtained from cumulants of Fourier coefficients: Average: Sz(1)≈NC1(a0)T∑j=0N−1gjPower spectrum: Sz(2)(ωk)≈NC2(ak,ak∗)T∑j=0N−1gjgj∗Bispectrum: Sz(3)(ωk,ωl)≈NC3(ak,al,ak+l∗)T∑j=0N−1gj2gj∗Trispectrum: Sz(4)(ωk,ωl,ωp)≈NC4(ak,al,ap,ak+l+p∗)T∑j=0N−1gj3gj∗. The distances of the spectral positions ωk=2πk/T decrease with increasing window length T resulting in a higher spectral resolution. The cumulants Cn can be estimated by the k-statistic which provides unbiased estimators cn (estimator).[11] [12] [13] The estimators are given by[14] c2(x,y)=mm−1(xy‾−x‾y‾)c3(x,y,z)=m2(m−1)(m−2)(xyz‾−xy‾z‾−xz‾y‾−yz‾x‾+2x‾y‾z‾)c4(x,y,z,w)=m2(m−1)(m−2)(m−3)[(m+1)xyzw‾−(m+1)(xyz‾w‾+xyw‾z‾+xzw‾y‾+yzw‾x‾)−(m−1)(xy‾zw‾+xz‾yw‾+xw‾yz‾)+2m(xy‾z‾w‾+xz‾y‾w‾+xw‾y‾z‾+yz‾x‾w‾+yw‾x‾z‾+zw‾x‾y‾)−6mx‾y‾z‾w‾], where (..)‾ denotes the average of m samples.

Applications

Bispectra find medical applications in the analysis of electroencephalograms [15] and are used in engineering for fault detection in rotating machinery components.[16] Polyspectra have also become a tool in quantum physics for analysing records of quantum measurements. [17] The applications of quantum polyspectra range from quantum transport over single photon detection to spin noise measurements. [18] [19] [20] [21]

References

Template:Reflist