Abstract
This paper introduces a geometric framework for analyzing finite-energy signals observed with additive noise by representing them as points on statistical manifolds equipped with the Fisher–Rao metric. Each signal is associated with a parameter vector θ, which defines a unique probability distribution on a statistical manifold. We propose a unified approach based on the normal multivariate model to describe a raw signal mixed with additive stationary noise. In the approach considered, the background noise is typically assumed to be stationary, whereas the unknown signal is regarded as deterministic. Leveraging tools from information geometry, we compute geodesic equations for the statistical manifolds. We re-derive known results regarding the multivariate normal models and extend them to the signal processing domain. We show that in some cases, the geodesic equations can be solved to obtain a closed-form expression of the Fisher–Rao distance. This expression corresponds to a minimum bound when the sub-manifold is not geodesic, revealing a fundamental geometric constraint in signal parameter estimation. We introduce the spectral distance function, which characterizes the influence of each spectral component of the signals on the Fisher–Rao distance. Our findings provide theoretical insights for signal clustering and machine learning applications, where geometric distances can characterize classification and estimation tasks.
1. Introduction
Information geometry bridges differential geometry and statistical inference, enabling the rigorous analysis of parametric probability distributions as statistical manifolds [1]. Time series analysis and signal processing are well-established applications of information geometry. Modeling time series as realizations of statistical populations via parametric probability distributions enables the utilization of tools from differential geometry. Information geometry has been extensively applied to multivariate normal models [2,3,4,5,6,7,8]. With regard to signal analysis, stationary Gaussian time series are commonly examined via the statistical properties of their Fourier expansions. For instance, Amari and Nagaoka have derived the geometry of signal processing from the spectral density function, under the assumption that the sum of the squared logarithms of the power spectrum norm is finite [9] (p. 116). Extension to the modeling of finite-energy signals in additive noise remained underexplored until recently. A recent work addressed this gap by adapting the model to finite-energy signal manifolds. The representation of signals through their Fourier expansions can be used for finite-energy signals with a possible finite duration. The Fourier expansions are seen as random variables following multivariate normal distributions. Two Riemannian manifolds for finite-energy signals have been defined: the full manifold of all finite-energy signals in a given bandwidth and the sub-manifold of finite-energy signals with a known magnitude spectrum [10,11,12]. This previous work derived closed-form expressions of Fisher–Rao distances on these manifolds via resolution of the geodesic equations, analyzing asymptotic behaviors and demonstrating that the sub-manifold is not fully geodesic (i.e., the distances on the sub-manifold exceed those on the full manifold).
Here, we address again the case of finite-energy signal manifolds already discussed in [10,11,12] with dual objectives. First, we put into perspective the results already obtained with the methods of information geometry by recalling some classical formulas and providing new evidence. The objective of this first part is to explore the geometric foundations for the finite-energy signal manifolds. The elements are treated and detailed in Section 2, Section 3, Section 4 and Section 5. Although geodesic equations on the multivariate normal manifold have already been proven [4,5], we propose here a unified approach based on a common method of information geometry used by the research community [1,6,7,8,13]. In order to make the article self-contained, we develop new proofs for the geodesic equations and Fisher–Rao distance expressions on the multivariate normal manifold, aside from references to former works.
The second objective, addressed in the Section 6 and Section 7, is to analyze the numerical behavior of the Fisher–Rao distance between finite-energy signal observations. This section provides new examples not examined in the previous publications and highlights the new concept of spectral distance. We analyze the dependence of Fisher–Rao distance values with the signal-to-noise ratio, signal bandwidth and other factors as phase variations. To demonstrate that the proposed distance gives a practical advantage for signal estimation, we use a small toy problem.
Section 2 presents the method of information geometry commonly used to compute the Fisher–Rao distance based on the Fisher metric. This section references previous work by the research community [1,6,7,13]. We recall the general approach for deriving the geodesic equations. This section also provides an opportunity to introduce relevant definitions and notation conventions.
Section 3 reviews key contributions from previous research on the Riemannian geometry of the multivariate normal model, with a particular focus on the computation of geodesic distances [2,3,4,5,6]. Based on the method explained in Section 2, new proofs of the already known theorems are redeveloped in order to make the development self-contained.
Section 4 presents the proposed signal model and the associated statistical distributions. This signal model was previously introduced in earlier work on finite-energy signals [10,11,12,14]. The model is completed here to cover several signal cases. The parametric modeling is discussed in detail, leading to the definition of the manifolds .
Section 5 addresses the general situation of a parametric model describing a family of finite-energy signals in any manifold . We outline the various steps required to compute the Fisher–Rao distance, including the formulation of the differential equations for geodesics. General formulas for the Fisher–Rao distance on the manifolds identified in Section 4 are provided. The calculations of the Christoffel symbols are detailed.
Section 6 focuses on a specific manifold , which includes all other manifolds as sub-manifolds. The geodesic equations and a closed-form expression of the Fisher–Rao distance are derived for the manifold . This closed-form expression allows defining the spectral distance function and highlighting its relation to the Fisher–Rao distance.
Section 7 evaluates the Fisher–Rao distance on the previously defined manifold . The Fisher–Rao distance on this manifold is a minimum bound for the Fisher–Rao distances on all other manifolds . We analyze the distance on the manifold and examine the asymptotic behaviors. We use numerical applications to compute the distance. Figures are drawn to illustrate the numerical behavior with some examples of signals.
The conclusion summarizes the main findings, discusses the relevance and limitations of the work, and outlines directions for future research.
2. How to Compute the Fisher–Rao Distance
2.1. Notation Conventions
Before describing the methodology for computing the Fisher–Rao distance, we introduce the notation conventions that will be employed throughout this paper.
Vectors and matrices are denoted in bold, while scalar values are presented in regular typeface. For example, represents the zero vector with P components. The superscript T denotes the transpose operation as in the expression , where a is a matrix or a vector.
We note that the canonical unit vector where all the components are zero, except the ith component, which is equal to one:
We note that is the symmetric canonical matrix where all the components are zero, except for the ijth and jith components, which are equal to one:
Here, is the Kronecker symbol ( when and otherwise).
and design the real and imaginary parts of the complex number c, respectively, where with . The superscript * denotes the conjugate operation as in the expression .
, and design the trace, the determinant and the inverse matrix (when it exists) of matrix , respectively.
We adopted Einstein’s summation convention to omit summation signs in tensor expressions, which allowed a concise representation of tensor operations. However, when summing over indices, such as the frequency, where the indexation is not strictly tensorial, we retained the explicit summation symbol, as shown in Equation (36).
With regard to the parameters, it is important to distinguish between , which refers to a particular value of the parameter vector , and , which denotes the second component of vector .
To avoid any ambiguity between exponentiation and the superscript index 2, exponents are written in explicit parentheses; for example, denotes the square of the component .
Where appropriate, the vector can be decomposed into its sub-components and , each with their respective indices:
- is a real vector of dimension N;
- is a real vector with a length P indexed by u, v or w, where ;
- is a real vector with components indexed by q, r or p, where .
This convention facilitates a Schouten-like notation for differentiation: , , , , and .
The gradient with respect to the parameters is, by definition, the operator:
Under the definition of , and , we have
A specific case is the one where represents the parameters of a multivariate normal distribution with a mean and covariance matrix Σ. Assuming that is of a dimension n, the covariance matrix Σ is definite positive and can be represented by coefficients. In this case, we can assume that and . For this situation, each parameter index q corresponds to a couple of indices with defining a component of the matrix Σ. With this notation, we can note that .
2.2. Methodology to Compute the Fisher–Rao Distance
With the Fisher metric and the Levi-Civita connection, the geodesic is the curve of minimal length connecting two points. This minimal length defines a metric distance, known as the Fisher–Rao distance [3]. Using the Fisher metric, one may evaluate this statistical distance between two points, characterized by their parameter vectors and . This distance quantifies the dissimilarity between the two statistical populations described by the probability distributions and [1]. The Fisher–Rao distance can be used for statistical analysis, including data clustering [15] and deep learning, to name but a few [2].
For conciseness, albeit at the risk of slight imprecision, the Fisher–Rao distance between the statistical distributions corresponding to two signals parameterized by and will hereafter simply be referred to as the distance between the two points and . Our objective is to compute the Fisher–Rao distance between two points, and , on the statistical manifold.
The Fisher–Rao distance computation follows the methodology described in several foundational references [1,9,13] and is widely used in the information geometry community [6,7,10,11,12]. The steps are as follows.
The first step is to specify a parametric model that describes the distribution of the observations. Let x denote the observation vector and θ denote the parameter vector. The stochastic behavior of the observations is characterized by the conditional probability distribution . As detailed in [9,16], the set of all such parametric probability distributions forms a statistical model, which can be regarded as a statistical manifold.
The Fisher information matrix is derived from the log-likelihood as follows:
Based on the Fisher information matrix, the Christoffel symbols are then computed according to
Once the Christoffel symbols are known, they can be employed in the following differential equations, whose solutions correspond to the geodesics joining and (with ):
Given the expressions of geodesics , the Fisher–Rao distance between the distribution at and that at is given by the following integral:
Constraints in the parametric model of probability distributions restrict the distribution to a sub-manifold, and the Fisher–Rao geodesic distance on the sub-manifold is generally larger than the Fisher–Rao geodesic distance measured on the global manifold.
3. The Case of Multivariate Normal Distributions
3.1. The General Case
Finding closed-form expressions for the Fisher–Rao distance is recognized as a non-trivial endeavor, and such expressions are only available for a limited number of families of probability distributions [7]. Here, we consider multivariate normal distributions given by
Here, the following definitions apply:
- n is an integer, the number of components;
- X is a real random vector with n components;
- Σ is an positive-definite matrix;
- μ is a real vector with n components.
When the parameters are all the coefficients of μ and Σ, geodesic equations corresponding to multivariate normal distributions take the form of second-order ordinary differential equations (with ) [4,5,6]:
Proof.
The proof relies on the method explained in Section 2.
First, we compute the Fisher matrix. From Equation (5), we can write
Assuming that u, v and w represent the parameter indices (varying from 1 to P) of the mean μ and q, r and p represent the parameter indices (varying from P + 1 to N) of the covariance matrix Σ, we can write the following:
From Equation (7), we can see that
We know from [9] (p. 28) that the Fisher metric can also be written as . Thus, we can easily obtain
As , we also have
Knowing from algebra rules that , and , we can deduce from Equation (8) the following equations:
As each q corresponds to a couple of indices with defining a component of the matrix Σ, we can note , and we have the following:
and
This leads to the following equations:
With r corresponding to a couple of parameter indices in the matrix Σ with , we can write
We know from [9] (p. 28) that the Fisher metric can also be writen as , and by definition, the covariance matrix . Therefore, we can write the following:
As a consequence, the Fisher matrix is a block diagonal matrix:
with
The second step of the proof consists of computing the .
Regarding , from Equation (2), we have the following relationships:
With p corresponding to a couple of parameter indices in the matrix Σ with , we can write
As a consequence, Equation (2) can be expressed as follows:
The third step of the proof consists of replacing the values of in the geodesic equation (Equation (3)).
As a consequence, Equation (3) becomes
These equations can be rewritten as follows:
In other words, we have
and finally
We know that defines a scalar product between the two vectors and , while defines a scalar product between the two matrices and .
As is the basis of , and is a basis of the vector space of all symmetric matrices, the two equations become
Due to the definitions of and , we can write
and the two geodesic equations can be written as follows:
□
These geodesic equations have been solved by fixing the initial value conditions in μ and [3,8]. However, they were not solved in the general case for boundary conditions, i.e., fixing μ at , ( and ).
Once we have the expressions of the solutions of the geodesic equations and , we can compute the Fisher–Rao distance using the following formula:
Proof.
From Equations (4) and (11), we can write
□
3.2. The Case Where Is Constant
As stated above, in the general case, there is no explicit closed-form expression for the Fisher–Rao distance between multivariate normal probability distributions. Nevertheless, a closed-form expression can be derived in particular instances, such as multivariate normal distributions that share a common covariance matrix. The solutions for the equations with the boundary conditions are known for the distribution in the case where is the constant [6]. Below, we examine this case, which is of interest for the signal model.
When we consider the distribution with the constant, and when we have , the second line of Equation (6) does not exist, and the geodesic equation becomes
Proof.
From Equation (5), we can write
Then, using the Leibniz rule, we have
And because is symmetric, we also have
As we have , we can write in Equation (1)
As , we have , where all the components of are zero except the ith component, which is equal to one:
and thus
This means that , and the partial derivatives are zero: .
And due to Equation (2), we have
This leads to the following transformation of Equation (3):
This last equation is equivalent to (16). □
In this scenario, assuming Equation (16), the Fisher–Rao distance reduces to the Mahalanobis distance between the means of the multivariate normal distributions [6]; that is, when we consider the distribution with the Σ constant, and when we have , we can write
Proof.
From Equation (16), we deduce that is a constant vector:
and by replacing it in Equation (4) we get
□
For more general cases, the distance generally does not admit an explicit closed form and must be approximately evaluated with numerical techniques such as geodesic shooting or bound approximations [3].
4. Signal Parametric Modeling
4.1. Observation of a Finite-Energy Signal
The model used to derive the expression of the statistical distribution has already been applied in previous works [10,11,12,14]. We detail here the hypotheses and give the expression for the law of probability of the observations and its dependence on the parameters.
We are interested in applications recording finite-energy signals. As examples, we can consider chirp frequency-modulated (FM) signals.
At the sensor level, the received signal is a real signal with finite energy, depending on the time t, for which we have . This signal admits a Fourier expansion , depending on the frequency ν. In the real world, the signal is only observed during a limited time interval——and most of the time, it has a finite duration.
We examine the observations after sampling and applying the Fourier transform. Because, for real signals, the Fourier transform values at negative frequencies are the complex conjugates of the Fourier transform values at positive frequencies, we limited the observations to the positive frequencies. The sensor has a limited bandwidth , which is supposed to be a continuous interval in . Due to the limited frequency bandwidth of the sensor, time sampling effect and discrete Fourier transform (DFT), the observation bandwidth is limited to a subset of positive frequencies: . In practice, this subset is made up of regularly spaced discrete values . After time sampling and the DFT, and from the receiver point of view, the signal is parameterized by a real vector , and for frequency dependence, we note that .
As a consequence of Parseval’s theorem, we can write (with , where B is the length of the interval ).
In addition to the above hypotheses, we assume that the observation is composed of the signal mixed with additive stationary random noise. Thus, the observation takes the form.
In this equation, , and are complex numbers. The total vector of observation is made up of all complex variables in the observation bandwidth: . This vector has a total of complex coordinates, each corresponding to one of the frequency values in the bandwidth .
The signal is assumed to be deterministic, which means that each value of the parameter vector corresponds to a single frequency function .
Looking at the noise contributions in the frequency domain , we assume that the noise components after the Fourier transform are centered, circularly symmetric complex Gaussian random variables which are independent across frequencies. The Gaussianity is true if the noise is naturally Gaussian, but it is also asymptotically true for other types of noise distributions. The asymptotic independence for any pair of frequencies is reported in [9].
We assume that the noise spectral power density in the bandwidth is known and defined by . The hypothesis that the Gaussian complex noise is circularly symmetric means that .
When assuming all previous hypotheses, the law of the total vector of the observations can be expressed as follows:
The total vector of observation has a total number of complex components and can be rewritten as a real vector with real components. With this notation, Equation (19) is similar to the normal multivariate distribution expressed in [6] and in Equation (5):
where the following definitions apply:
- is the number of frequencies ν in ;
- is a diagonal matrix such that
- is a vector, with and ;
- is a vector, with and .
4.2. Signal Dependence on Parameters and the Manifolds
Equation (19) (or equivalently Equation (20)) defines a family of probability distributions when the parameter varies in a predefined set Θ:
With additional regularity conditions, can be considered a statistical manifold (see [9,12], Section 2.1 for more details).
As a consequence, the geometry of the manifold lies in Equation (19) (or in Equation (20)) and in the definition of the parameter set Θ. We call such a manifold manifold . As has N components, with , N is the dimension of the manifold .
For all in , the signal is a complex value, which can be represented by a modulus (or magnitude) and a phase :
with and .
As explained in [12], the parameters of the signal can be split into two parts: . One part, , with P components, is related to the magnitude of the signal, and the other part, , with components, is related to the phase of the signal:
In the following, any manifold is described by Equation (19) completed with Equation (23), which refers to the case where .
As the magnitudes and phases can be determined separately from the , we assume that the numbers of coordinates of the parameter vectors verify the following properties:
In a manifold , the expression of the distribution is given by
More details regarding the regularity conditions and dependence of the phase on the frequency ν are available in [12].
5. General Expressions of the Fisher–Rao Distances on the Manifolds
5.1. Geodesic Equations on the Manifolds
To compute the geodesic equations on a manifold , we use the method described in Section 2 and Equations (1)–(3) and (25). We obtained the following theorem already expressed in [10,11,12].
Theorem 1
(Linearly dependant gradient (LDG) theorem). The (Fisher-)geodesic equations in the submanifold reduce to the following two vectorial equations:
Proof.
The method explained in Section 2.2 consists of three steps:
- Calculate the Fisher information matrix G.
- Calculate the partial derivatives and the Christoffel symbols .
- Replace the Christoffel symbols to express the geodesic equation.
The calculations are detailed in [12].
The first step consists of calculating the Fisher information matrix.
It can be shown that the Fisher matrix is a block diagonal matrix:
The second step consists of calculating the Christoffel symbols, based on the partial derivative of the Fisher matrix coefficient with respect to the parameters. In the third step of the proof, we replace the values of in the geodesic equation (Equation (3)) in order to obtain geodesic equations expressed on the manifolds .
Finally, we can write the geodesic equations as follows:
Equation (27) can easily be transformed into Equation (26). □
5.2. Fisher–Rao Distances on the Manifolds
Theorem 2.
With and as solutions of the geodesic equations, the Fisher–Rao distance on the submanifold can be calculated as the following integral:
Proof.
Detailed calculations are available in [12].
We note that (or ) and (or ) are the solutions of the geodesic equation (Equation (27)). They are expressed as functions of . From Equation (4), taking into account the block diagonal structure of the Fisher information matrix as demonstrated in Section 5.1, we derive the Fisher–Rao distance from the following integral:
We replace the and with their expressions and we use the following equalities:
We then obtain
By definition, , and .
Due to the derivative properties, we have .
Using these equalities, Equation (30) is easily transformed into Equation (28). □
To compute the expression in Equation (28) and give a closed-form expression of the Fisher–Rao distance, it is necessary to solve Equation (26). This can only be accomplished when the parametric expressions of a magnitude and phase are expressed in closed forms, i.e., when the model is particularized. This is performed with the specific manifold in the next section.
6. General Expressions of the Fisher–Rao Distances on the Manifold
6.1. The Finite-Energy Signals and the Manifold
Here, we look at a specific manifold corresponding to the situation for which, in Equation (20), the parameters are the components of the vector . This means that .
In this case, is a vector with components, and . In other words, . This means that all the signal components vary freely in .
Variations in all signal components determine a manifold, which we call the manifold . This corresponds to all signals with finite energy observed in the frequency bandwidth . The dimension of the manifold is . The manifold corresponds exactly to the manifold described by multivariate normal distributions with the same diagonal covariance matrix and different mean values.
Any manifold is a sub-manifold of the manifold .
6.2. Geodesic Equations on the Manifold
The geodesic equation on the manifold is derived directly from Equations (6) and (20) when the coefficients of the matrix are not part of the coordinates. In this case, the second line of Equation (6) does not exist, and the geodesic equation becomes
The solution between and is an affine function of [6]:
6.3. Fisher–Rao Distance on the Manifold
From Equation (20) and the definition of the Fisher matrix in Equation (1), we can easily derive the expression of the Fisher information matrix in the manifold :
If we report this expression of in Equation (4), then we get the expression of the Fisher–Rao distance on the manifold :
It is known from [6] that in the -dimensional manifold composed of multivariate normal distributions with a common covariance matrix , the Fisher–Rao distance between two distributions parametrised by and is equal to the Mahalanobis distance. This can be easily verified here. When changing in Equation (34) by its value from Equation (32), we have
With the notation of Equations (20) and (22), this Fisher–Rao distance on the manifold can be rewritten as follows:
with
Proof.
The frequencies in are , , …, .
is a diagonal real matrix. Each value in the frequency band is represented by two diagonal values, and , and we have by definition
The vector has components arranged in pairs:
At frequency , the contribution of the components indexed by and is as follows:
□
6.4. Expression with the Spectral Distance Function
We define the spectral distance function as follows:
This function describes the contribution of each spectral component of the signal observations and to their Fisher–Rao distance.
According to Equation (36), the Fisher–Rao distance can be expressed from the spectral distance function by
When the signals have a continuous spectrum, this expression takes the form
7. Evaluation of the Fisher–Rao Distances
7.1. Comparison of the Fisher–Rao Distances on the Manifold and on Any Sub-Manifold
The N-dimensional sub-manifolds are included in the -dimensional manifold composed by multivariate normal distributions with a common diagonal covariance matrix . The metric on any sub-manifold is the induced metric from the ambient manifold . When two endpoints are connected with a geodesic path on the sub-manifold, they are also connected with the same path on the ambient manifold. However, this path on the ambient manifold is not always the minimum (geodesic) path for the ambient manifold. As a consequence, we expect that the Fisher–Rao distance measured on any sub-manifold is greater than or equal to the Fisher–Rao distance measured on the manifold :
When both quantities are always equal, the sub-manifold is said to be fully geodesic on the manifold . As a consequence of Equation (41), the value of the Fisher–Rao distance between two finite-energy signals on the manifold is a minimum bound for any Fisher–Rao distance between both finite-energy signals calculated on any sub-manifold .
7.2. Asymptotic Behavior of the Fisher–Rao Distances
Theorem 3.
The Fisher-Rao distances belong to the following interval:
Proof.
The value of in Equation (36) varies between −1 and +1. □
Theorem 4.
When the phase differences are small, distances tend toward the minimum values:
Proof.
The value of tends toward one in Equation (36). □
Theorem 5.
When the signal at and the signal have separate bandwidths, or when the phase differences vary significantly across the bandwidth, the Fisher–Rao distance becomes
With:
Proof.
The value of tends toward zero in Equation (36). □
In this expressions, and represent the signal-to-noise ratios at and , respectively.
7.3. Numerical Application
We see with Equation (36) that the Fisher–Rao distance is proportional to the square root of the signal-to-noise ratio (SNR), meaning that when the signal-to-noise ratios and are multiplied by a, the Fisher–Rao distance is multiplied by (if the phase differences remain the same).
Furthermore, we observe that the Fisher–Rao distance is symmetric under the permutations of and .
As a consequence, we can explore the distance at a reference signal-to-noise ratio with the hypothesis that .
We assume that the noise is Gaussian white with a constant spectral density .
We examine several signal configurations and their respective distances.
We compare two linear frequency-modulated (LFM) pulses with the same time duration but different bandwidths. The pulses were weighted by a Hann window. The parametric expressions of the signals are as follows:
In Equation (47), the meanings of the parameters are as follows:
- is the middle frequency of the modulation;
- is the frequency bandwidth of the modulation;
- is a phase parameter between 0 and which introduces a phase shift;
- takes the values +1 and −1, indicating whether the slope of the LFM frequency variation is upward or downward, respectively;
- T is the time length of the impulsion.
After sampling at frequency , as we choose T to also be the time duration of the Fourier transform, we obtain samples, and following the DFT, the observations become
with the following definitions:
- ;
- ;
- If is even, then , or if is odd, then .
For the numerical applications, we choose the following:
- The time duration is s;
- The sample frequency is fixed to 1.024 Hz;
- This determines and .
We analyzed various scenarios; each was characterized by a set of parameters and illustrated with figures presenting the calculation results:
- Scenario 1: Similar signals with different bandwidths.The parameters are described in Table 1. Both signals were similar (same phase and middle frequency and same slope of modulation) except for their respective bandwidths. The figure shows variation in the distance with respect to the bandwidth of signal .The results are shown in Figure 1. We observe that th
- Scenario 2: Signals with different bandwidths and slopes of modulation.The parameters are described in Table 2. Both signals were similar (same phase and middle frequency) except for their respective bandwidths and their slopes of modulation. The figure shows variation in the distance with respect to the bandwidth of signal .The results are shown in Figure 2. We observe that the distance varied slightly around 1.4142 (). This is a situation close to Equation (44).
- Scenario 3: Signals with opposite phases and different bandwidths.The parameters are described in Table 3. Both signals were similar (same phase and middle frequency and same slope of modulation) except for their respective bandwidths, and they had a phase difference of π. The figure shows variation in the distance with respect to the bandwidth of signal .The results are shown in Figure 3. We observe that the distance varied between 0 and 2. This corresponds to the bounds of Equation (42). The maximum was reached when the two signals were identical with a phase shift of π (same bandwidth ).
- Scenario 4: Signals with different bandwidths and mid frequencies.The parameters are described in Table 4. The signals had different middle frequencies, but they had the same phase and the same slope of modulation. The bandwidth of the second signal varied. The figure shows variation in the distance with respect to the bandwidth of signal .The results are shown in Figure 4. We observe that the distance varied rather slightly around 1.4142 () (less than 0.1% variation). This is a situation corresponding to Equation (44).
- Scenario 5: Analysis of the spectral distance function for two signals with different bandwidths.The parameters are described in Table 5. The signals had different bandwidths, but they had same phase, same middle frequency and same slope of modulation. We drew two figures: one representing the two signal spectra and the other representing the spectral distance between the two signals.
- Scenario 6: Analysis of the spectral distance for two signals with different middle frequencies.The parameters are described in Table 6. The signals had different middle frequencies, but they had the same phase, same bandwidth and same slope of modulation. We drew two figures: one representing the signal spectra and the other representing the spectral distance between the two signals.
- Scenario 7: A toy problem to demonstrate the usefulness of using the Fisher–Rao distance for parameter estimation.We had three signals. They had the same middle frequencies, same bandwidth and same slope of modulation, but they had different phases. The problem consisted of estimating the optimal phase shift values for the three signals to facilitate their discrimination during observation.In order to optimally separate the signals, we wanted to ensure the maximum possible value of the Fisher–Rao distance between any two signals. To achieve this, we calculated all the Fisher–Rao distances between the signals, namely , and , and we determine the minimum distance:For the signal , the phase shift was arbitrarily set to zero. We looked for the respective values of and , which determined the maximum value of .The parameters of the scenario are described in Table 7.Figure 9 shows the variations in as a function of both parameters and .The maximum value of the minimum Fisher–Rao distance was equal to , and it was reached for , or symmetrically, .When we attempted to fix the maximum value for the distance between two signals, such as , then another distance became less than .The optimal separation of the three signals was achieved when the phase difference between them was , which is a well-known result in communication theory.
Table 1.
Values of the parameters for scenario 1.
Figure 1.
Value of the Fisher–Rao distance as a function of the bandwidth of the signal for scenario 1.
Table 2.
Values of the parameters for scenario 2.
Figure 2.
Value of the Fisher–Rao distance as a function of the bandwidth of the signal for scenario 2.
Table 3.
Values of the parameters for scenario 3.
Figure 3.
Value of the Fisher–Rao distance as a function of the bandwidth of the signal for scenario 3.
Table 4.
Values of the parameters for scenario 4.
Figure 4.
Value of the Fisher–Rao distance as a function of the bandwidth of the signal for scenario 4.
Table 5.
Values of the parameters for scenario 5.
Figure 5.
Values of the spectra (solid line) and (dashed line) for the two signals as a function of the frequency ν for scenario 5.
Figure 6.
Values of the spectral distance as a function of the frequency for scenario 5.
Table 6.
Values of the parameters for scenario 6.
Figure 7.
Values of the spectra (solid line) and (dashed line) for the two signals as a function of the frequency ν for scenario 6.
Figure 8.
Values of the spectral distance as a function of the frequency ν for scenario 6.
Table 7.
Values of the parameters for scenario 7.
Figure 9.
3D plot of for the toy problem of scenario 7. The X axis represents , and the Y axis represents . The color bar indicates the values of (Z axis). The X and Y axes are graduated in π values (e.g., 2 means 2π, and 0.6 means 0.6π). We see that maximum values of were reached for the parameter values or .
8. Conclusions
In this article, we addressed signal processing through information geometry by computing the Fisher–Rao distance between two finite-energy signals observed in Gaussian noise. To obtain a closed-form expression for this distance, one must express and then solve the geodesic equation, given the boundary conditions imposed by the signals under consideration. To formulate the geodesic equation, the Fisher information matrix was used and differentiated with respect to the parameters to obtain the Christoffel symbols.
The calculation starts from the multivariate normal distribution, and we re-derive the geodesic equations for both distributions with unknown means and covariance matrices, as well as for the case of a known covariance matrix. The geodesic equation can be solved in the latter case, allowing application to finite-energy signals. Through the frequency-domain model of these signals, we identified the statistical manifold and obtained the closed-form expression for the Fisher–Rao distance on this manifold. This value appeared as a minimum bound for the Fisher–Rao distance between two finite-energy signals, regardless of the parameterization of these signals that defined a sub-manifold. The obtained expression makes it possible to highlight the spectral distance function , which characterizes the impact of each frequency component on the Fisher–Rao distance value. We show that the Fisher–Rao distance varied as a function of the square roots of the signal-to-noise ratios, and for normalized signal-to-noise ratios equal to one, the distance value lied between 0 and 2. It is also shown that in the case of signals with disjoint spectral bands (or whose phase differences varied significantly within the band), the value of the distance was close to .
Several numerical examples related to LFM impulse signals are wenalyzed to illustrate the results obtained. It was shown that it is possible to reach the limiting values of the distance; the value zero was achieved for identical signals (confirming the concept of distance), and the value two was achieved for identical signals in opposition of the phase. Beyond these extreme cases, the distance varied more or less significantly around the value , depending on the phase characteristics of the signals and the separation of their frequency bands. Using a toy problem, we provide theoretical insights into signal estimation, with an open perspective toward clustering and machine learning applications, where geometric distances can characterize classification and estimation tasks.
In the numerical analysis, signals with a strictly equal duration T and without delay were considered. The influence of delays and the signal duration could be the subject of future research. Nevertheless, we anticipate that the Fisher–Rao distance between finite energy signals will help the characterization of signal databases.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
The author thanks the anonymous reviewers for their feedback.
Conflicts of Interest
The author was employed by the company Thales. The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| DFT | Discrete Fourier transform |
| FM | Frequency modulation |
| LFM | Linear frequency modulation |
References
- Nielsen, F. An Elementary Introduction to Information Geometry. Entropy 2020, 10, 1100. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Nielsen, F. A simple approximation method for the Fisher-Rao distance between multivariate normal distributions. Entropy 2023, 25, 654. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Nielsen, F. Approximation and bounding techniques for the Fisher-Rao distances between parametric statistical models. In Handbook of Statistics: Probability Models; Elsevier: Amsterdam, The Netherlands, 2024; Volume 51, pp. 67–116. [Google Scholar] [CrossRef] [Scilit]
- Skovgaard, L. A Riemannian Geometry of the Multivariate Normal Model; Technical Report No. 167; Stanford University: Stanford, CA, USA, 1981. [Google Scholar]
- Skovgaard, L. A Riemannian Geometry of the Multivariate Normal Model. Scand. J. Stat. 1984, 11, 211–223. [Google Scholar]
- Pinele, J.; Strapasson, J.E.; Costa, S. The Fisher-Rao distance between multivariate normal distributions: Special cases, bounds and applications. Entropy 2020, 22, 404. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Miyamoto, H.; Meneghetti, F.; Pinele, J.; Costa, S. On Closed-Form Expressions for the Fisher-Rao Distance. Inf. Geom. 2024, 7, 311–354. [Google Scholar] [CrossRef] [Scilit]
- Calvo, M.; Oller, J.M. An explicit solution of information geodesic equations for the multivariate normal model. Stat. Risk Model. 1991, 9, 119–138. [Google Scholar] [CrossRef] [Scilit]
- Amari, S.I.; Nagaoka, H. Methods of Information Geometry; AMS: Providence, RI, USA, 2000.
- Florin, F.; Bertrand, A. Géométrie de l’information et signaux d’énergie finie. In Proceedings of the 30e Colloque sur le Traitement du Signal et des Images; GRETSI-Groupe de Recherche en Traitement du Signal et des Images: Strasbourg, France, 2025; Number 2025-1419; pp. 5–8. [Google Scholar]
- Florin, F. The Fisher-Rao distance between finite energy signals. In Proceedings of the Geometric Science of Information, GSI 2025; Nielsen, F., Barbaresco, F., Eds.; Springer Nature: Cham, Switzerland, 2025. [Google Scholar] [CrossRef] [Scilit]
- Florin, F. The Fisher-Rao distance between finite energy signals in Gaussian Noise. Inf. Geom. 2026. [Google Scholar] [CrossRef] [Scilit]
- Amari, S.I. Information Geometry and Its Applications; Springer: Tokyo, Japan, 2016. [Google Scholar] [CrossRef] [Scilit]
- Florin, F. On Fisher Information Matrix, Array Manifold Geometry and Time Delay Estimation. In Proceedings of the Geometric Science of Information, GSI 2023; Nielsen, F., Barbaresco, F., Eds.; Springer: Cham, Switzerland, 2023; pp. 307–317. [Google Scholar] [CrossRef] [Scilit]
- Strapasson, J.E.; Pinele, J.; Costa, S.I.R. Clustering using the Fisher-Rao distance. In Proceedings of the 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), Rio de Janeiro, Brazil, 10–13 July 2016; IEEE: New York, NY, USA, 2016; pp. 1–5. [Google Scholar] [CrossRef] [Scilit]
- Amari, S.i.; Cichocki, A. Information geometry of divergence functions. Bull. Pol. Acad. Sci. Tech. Sci. 2010, 58, 183–195. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.








