RUS  ENG
Full version
JOURNALS // Problemy Upravleniya // Archive

Probl. Upr., 2024 Issue 6, Pages 20–26 (Mi pu1371)

Analysis and synthesis of control systems

Calculating the spectral entropy of a stationary random process

A. A. Belov, O. G. Andrianova

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

Abstract: The problem of calculating the spectral entropy of a stationary random process is solved. The spectral entropy ($\sigma$-entropy) of a signal is understood as a scalar value characterizing the noise color; it describes the class of signals affecting a system depending on the band under study. By assumption, the random process is defined by a shaping filter, with the Gaussian white noise with a unit covariance matrix supplied at its input, or by an autocorrelation function. The spectral entropy of the stationary random process is analytically derived using a known mathematical model of the shaping filter in the form of a log-determinant function that depends on the transfer matrix and the observability Gramian of the filter. An algorithm for calculating the $\sigma$-entropy of stationary random processes with a known autocorrelation function is proposed. The method reduces to reconstructing the mathematical model of the shaping filter using its spectral density factorization. A numerical example is provided: spectral entropy is calculated for a disturbance describing the velocity of wind gusts that affect an aircraft.

Keywords: spectral entropy, stationary random process, spectral density, autocorrelation function, shaping filter.

UDC: 007.52

Received: 06.12.2024
Revised: 23.12.2024
Accepted: 23.12.2024


 English version:
Control Sciences, 2024:6, 16–21 (PDF, 1238 kB)


© Steklov Math. Inst. of RAS, 2026