 # Spectral estimation of multidimensional signals

Updated on
Covid-19 Power spectral estimation forms the basis for distinguishing and tracking signals in the presence of noise and extracting information from available data. One dimensional signals are expressed in terms of a single domain while multidimensional signals are represented in wave vector and frequency spectrum. Therefore, spectral estimation in the case of multidimensional signals gets a bit tricky.

## Motivation

Multidimensional spectral estimation has gained popularity because of its application in fields like medicine, aerospace, sonar, radar, bio informatics and geophysics. In the recent past, a number of methods have been suggested to design models with finite parameters to estimate the power spectrum of multidimensional signals. In this article, we will be looking into the basics of methods used to estimate the power spectrum of multidimensional signals.

## Applications

There are many applications of spectral estimation of multi-D signals such as classification of signals as low pass, high pass, pass band and stop band. It is also used in compression and coding of audio and video signals, beam forming and direction finding in radars, Seismic data estimation and processing, array of sensors and antennas and vibrational analysis. In the field of radio astronomy, it is used to synchronize the outputs of an array of telescopes.

## Basic Concepts

In a single dimensional case, a signal is characterized by an amplitude and a time scale. The basic concepts involved in spectral estimation include autocorrelation, multi-D Fourier transform, mean square error and entropy. When it comes to multidimensional signals, there are two main approaches: use a bank of filters or estimate the parameters of the random process in order to estimate the power spectrum.

## Classical Estimation Theory

It is a technique to estimate the power spectrum of a single dimensional or a multidimensional signal as it cannot be calculated accurately. Given are samples of a wide sense stationary random process and its second order statistics (measurements).The estimates are obtained by applying a multidimensional Fourier transform of the autocorrelation function of the random signal. The estimation begins by calculating a periodogram which is obtained by squaring the magnitude of the multidimensional Fourier transform of the measurements ri(n). The spectral estimates obtained from the periodogram have a large variance in amplitude for consecutive periodogram samples or in wavenumber. This problem is resolved using techniques that constitute the classical estimation theory. They are as follows: 1.Bartlett suggested a method that averages the spectral estimates to calculate the power spectrum. The measurements are divided into equally spaced segments in time and an average is taken. This gives a better estimate. 2.Based on the wavenumber and index of the receiver/output we can partition the segments. This increases the spectral estimates and decreases the variances between consecutive segments. 3.Welch suggested that we should divide the measurements using data window functions, calculate a periodogram, average them to get a spectral estimate and calculate the power spectrum using Fast Fourier Transform (FFT). This increases the computational speed. 4.Smoothing window will help us smoothen the estimate by multiplying the periodogram with a smoothening spectrum. Wider the main lobe of the smoothening spectrum, smoother it becomes at the cost of frequency resolution. P ( K x , w ) = φ s s ( x , t )   e j ( w t k x ) d x d t

φ s s ( x , t ) = s [ ( ξ , τ ) s ( ξ x , τ t ) ]

P B ( w ) = 1 d e t N l | n   x ( n + M I )   e j ( w n ) | 2 Bartlett's case

P M ( w ) = 1 d e t N | n   g ( n )   x ( n )   e j ( w n ) | 2 Modified periodogram

P W ( w ) = 1 d e t N l | n   g ( n )   x ( n + M I )   e j ( w n ) | 2 Welch's case

Advantages: Straightforward method involving Fourier transforms.

Limitations: 1.Since some of the above methods sample the sequence in time, the frequency resolution is reduced (aliasing). 2.Number of instances of a wide sense stationary random process are less which makes it difficult to calculate the estimates accurately.

## High Resolution Spectral Estimations

This method gives a better estimate whose frequency resolution is higher than the classical estimation theory. In the high resolution estimation method we use a variable wavenumber window which allows only certain wavenumbers and suppresses the others. Capon’s work helped us establish an estimation method by using wavenumber-frequency components. This results in an estimate with a higher frequency resolution. It is similar to maximum likelihood method as the optimization tool used is similar.

Assumption: The output obtained from the sensors is a wide sense stationary random process with zero mean.

P C ( K o x , w o ) = E [ | y ( i , n ) | 2 ] = 1 α = 0 N 1 β = 0 M 1 l = 0 N 1 m = 0 M 1 ψ e ( l , α ; m , β )

Advantages: 1.Higher frequency resolution compare to other existing methods. 2.Better frequency estimate since we are using a variable wavenumber window as compared to classical method which uses a fixed wavenumber window. 3.Faster Computational speed as it uses FFT.

In this type of estimation, we select the multidimensional signal to be a separable function. Because of this property we will be able to view the Fourier analysis taking place in multiple dimensions successively. A time delay in the magnitude squaring operation will help us process the Fourier transformation in each dimension. A Discrete time Multidimensional Fourier transform is applied along each dimension and in the end a maximum entropy estimator is applied and the magnitude is squared.

Advantages: 1.The Fourier analysis is flexible as the signal is separable. 2.It preserves the phase components of every dimension unlike other spectral estimators.

## All-pole Spectral Modelling

This method is an extension of a 1-D technique called Autoregressive spectral estimation. In autoregressive models, the output variables depend linearly on its own previous values. In this model, the estimation of power spectrum is reduced to estimating the coefficients from the autocorrelation coefficients of the random process which are assumed to be known for a specific region. The power spectrum P A ( k x , w ) of a random process r ( i , n ) is given by:-

P A ( k x , w ) = P e ( k x , w ) | 1 1 A ( k x , w ) | 2

Where P e ( k x , w ) is the power spectrum of a random process e ( i , n ) , which is given as the input to a system with a transfer function | 1 1 A ( k x , w ) | to obtain r ( i , n )

And A ( k x , w ) = p = o N 1 q = 0 M 1 a ( p , q ) e x p ( j k x p j w q )
Therefore, the power estimation reduces to estimation of coefficients of a ( p , q ) from the auto correlation function φ ( l , m ) of the random process. The coefficients can also be estimated using the linear prediction formulation which deals with minimization of mean square error between the actual random signal and predicted values of the random signal.

Limitations:-
1. In 1-D we have the same number of linear equations with the same number of unknowns because of the autocorrelation matching property. But it may not be possible in multi-D since the set of parameters does not contain enough degrees of freedom to match autocorrelation coefficients.
2. We assume that the array of coefficients is limited to a certain area.
3. In 1-D formulation of linear prediction, the inverse filter has minimum phase property thus proving that the filter is stable. It is not always necessarily true in multi-D case.
4. In 1-D formulation, the autocorrelation matrix is positive definite but positive definite extension may not exist in the case of multi-D.

## Maximum Entropy Spectral Estimation

In this method of spectral estimation, we try to find the spectral estimate whose inverse Fourier transform matches the known auto correlation coefficients. We maximize the entropy of the spectral estimate such that it matches the autocorrelation coefficients. The entropy equation is given as H = 1 4 π 2 π π π π l o g P ( k x , w ) d k x d w
The power spectrum P ( k , w ) can be expressed as a sum of known autocorrelation coefficients and unknown autocorrelation coefficients. By adjusting the values of unconstrained coefficients, the entropy can be maximized.
The max entropy is of the form P M E = 1 l m λ ( l , m ) e x p ( j k x l j w m )
λ(l,m) must be chosen such that known autocorrelation coefficients are matched.

Limitations:-
1.It has constrained optimization. It can be overcome by using the method of Lagrange multipliers.
2. All pole spectral estimate is not the solution to maximum entropy in multidimensional case as it is in the case of 1-D. This is because the all pole spectral model does not contain enough degree of freedom to match the know autocorrelation coefficients.

The advantage of this estimator is that errors in measuring or estimating the known autocorrelation coefficients can be taken into account since exact match is not required.
The disadvantage is that too many computations are required.

## Improved Maximum Likelihood Method(IMLM)

This is a relatively new approach. Improved maximum likelihood method (IMLM) is a combination of two MLM(maximum likelihood) estimators. The improved maximum likelihood of two 2-dimensional arrays A and B at a wave number k( gives information about the orientation of the array in space) is given by the relation:-
I M L M ( k : A , B ) = 1 1 M L M ( k : A ) 1 M L M ( k : B )

Array B is a subset of A. Therefore, assuming that A>B, if there is a difference between the MLM of A and MLM of B then significant part of the estimated spectral energy at the frequency may be due to power leakage from other frequencies. The de-emphasis of MLM of A may improve spectral estimate. This is accomplished by multiplying by a weighted function which is smaller when there is a greater difference between MLA of B and MLA of A.
. I M L M ( k : A , B ) = M L M ( k : A ) M L M ( k : B ) M L M ( k : B ) M L M ( k : A )
I M L M ( k : A , B ) = M L M ( k : A ) W A B ( k )
where W A B ( k ) is the weighting function and is given by the expression:- W A B ( k ) = M L M ( k : B ) M L M ( k : B ) M L M ( k : A )