Inversion of Parahermitian matrices

Parahermitian matrices arise in broadband multiple-input multiple-output (MIMO) systems or array processing, and require inversion in some instances. In this paper, we apply a polynomial eigenvalue decomposition obtained by the sequential best rotation algorithm to decompose a parahermitian matrix into a product of two paraunitary, i.e.lossless and easily invertible matrices, and a diagonal polynomial matrix. The inversion of the overall parahermitian matrix therefore reduces to the inversion of auto-correlation sequences in this diagonal matrix. We investigate a number of different approaches to obtain this inversion, and and assessment of the numerical stability and complexity of the inversion process

Initial results on an MMSE precoding and equalisation approach to MIMO PLC channels

This paper addresses some initial experiments using polynomial matrix decompositions to construct MMSE precoders and equalisers for MIMO power line communications (PLC) channels. The proposed scheme is based on a Wiener formulation based on polynomial matrices, and recent results to design and implement such systems with polynomial matrix tools. Applied to the MIMO PLC channel, the strong spectral dynamics of the PLC system together with the long impulse responses contained in the MIMO system result in problems, such that diagonlisation and spectral majorisation is mostly achieved in bands of high energy, while low-energy bands can resist any diagonalisation efforts. We introduce the subband approach in order to deal with this problem. A representative example using a simulated MIMO PLC channel is presented

Channel equalisation of a MIMO FBMC/OQAM system using a polynomial matrix pseudo-inverse

When using filter bank based multicarrier orthogonal quadrature amplitude modulation (FBMC/OQAM) techniques in a multiple-input multiple-output (MIMO) environment, its difficulty of dealing with inter-symbol interference (ISI) and intercarrier interference (ICI) is further exacerbated by the presence of spatial interference. In this paper, we describe the transfer functions (including al temporal and spatial interference terms) by polynomial matrices. The equalisation of this system can then be performed by a proposed polynomial matrix pseudo-inverse. Some numerical examples for this technique are presented

Polynomial matrix formulation-based Capon beamformer

This paper demonstrates the ease with which broadband array problems can be generalised from their well-known, straightforward narrowband equivalents when using polynomial matrix formulations. This is here exemplified for the Capon beamformer, which presents a solution to the minimum variance distortionless response problem. Based on the space-time covariance matrix of the array and the definition of a broadband steering vector, we formulate a polynomial MVDR problem. Results from its solution in the polynomial matrix domain are presented

Investigation of a polynomial matrix generalised EVD for multi-channel Wiener filtering

State of the art narrowband noise cancellation techniques utilise the generalised eigenvalue decomposition (GEVD) for multichannel Wiener filtering which can be applied to independent frequency bins in order to achieve broadband processing. Here we investigate the extension of the GEVD to broadband, polynomial matrices, akin to strategies that have already been developed by McWhirter et. al on the polynomial matrix eigenvalue decomposition (PEVD)

Measuring Smoothness of Trigonometric Interpolation Through Incomplete Sample Points

In this paper we present a metric to assess the smoothness of a trigonometric interpolation through an in-complete set of sample points. We measure smoothness as the power of a particular derivative of a 2π-periodic Dirichlet interpolant through some sample points. We show that we do not need to explicitly complete the sample set or perform the interpolation, but can simply work with the available sample points, under the assumption that any missing points are chosen to minimise the metric, and present a simple and robust approach to the computation of this metric. We assess the accuracy and computational complexity of this approach, and compare it to benchmarks.This work was in parts supported by the Engineering and Physical Sciences Research Council (EPSRC) Grant number EP/S000631/1 and the MOD University Defence Research Collaboration in Signal Processing

Maximally smooth Dirichlet interpolation from complete and incomplete sampling on the unit circle

This paper introduces a cost function for the smoothness of a continuous periodic function, of which only some samples are given. This cost function is important e.g. when associating samples in frequency bins for problems such as analytic singular or eigenvalue decompositions. We demonstrate the utility of the cost function, and study some of its complexity and conditioning issues

Mathematical tools for processing broadband multi-sensor signals

Spatial information in broadband array signals is embedded in the relative delay with which sources illuminate different sensors. Therefore, second order statistics, on which cost functions such as the mean square rest, must include such delays. Typically, a space-time covariance matrix therefore arises, which can be represented as a Laurent polynomial matrix. The optimisation of a cost function then requires extending the utility of the eigenvalue decomposition from narrowband covariance matrices to the broadband case of operating in a space-time covariance matrix. This overview paper summarises efforts in performing such factorisations, and demonstrated via the exemplar application of a broadband beamformer how thus well-known narrowband solutions can be extended to the broadband case using polynomial matrices and their factorisations

MVDR broadband beamforming using polynomial matrix techniques

This thesis addresses the formulation of and solution to broadband minimum variance distortionless response (MVDR) beamforming. Two approaches to this problem are considered, namely, generalised sidelobe canceller (GSC) and Capon beamformers. These are examined based on a novel technique which relies on polynomial matrix formulations. The new scheme is based on the second order statistics of the array sensor measurements in order to estimate a space-time covariance matrix. The beamforming problem can be formulated based on this space-time covariance matrix. Akin to the narrowband problem, where an optimum solution can be derived from the eigenvalue decomposition (EVD) of a constant covariance matrix, this utility is here extended to the broadband case. The decoupling of the space-time covariance matrix in this case is provided by means of a polynomial matrix EVD. The proposed approach is initially exploited to design a GSC beamformer for a uniform linear array, and then extended to the constrained MVDR, or Capon, beamformer and also the GSC with an arbitrary array structure. The uniqueness of the designed GSC comes from utilising the polynomial matrix technique, and its ability to steer the array beam towards an off-broadside direction without the pre-steering stage that is associated with conventional approaches to broadband beamformers. To solve the broadband beamforming problem, this thesis addresses a number of additional tools. A first one is the accurate construction of both the steering vectors based on fractional delay filters, which are required for the broadband constraint formulation of a beamformer, as for the construction of the quiescent beamformer. In the GSC case, we also discuss how a block matrix can be obtained, and introduce a novel paraunitary matrix completion algorithm. For the Capon beamformer, the polynomial extension requires the inversion of a polynomial matrix, for which a residue-based method is proposed that offers better accuracy compared to previously utilised approaches. These proposed polynomial matrix techniques are evaluated in a number of simulations. The results show that the polynomial broadband beamformer (PBBF) steersthe main beam towards the direction of the signal of interest (SoI) and protects the signal over the specified bandwidth, and at the same time suppresses unwanted signals by placing nulls in their directions. In addition to that, the PBBF is compared to the standard time domain broadband beamformer in terms of their mean square error performance, beam-pattern, and computation complexity. This comparison shows that the PBBF can offer a significant reduction in computation complexity compared to its standard counterpart. Overall, the main benefits of this approach include beam steering towards an arbitrary look direction with no need for pre-steering step, and a potentially significant reduction in computational complexity due to the decoupling of dependencies of the quiescent beamformer, blocking matrix, and the adaptive filter compared to a standard broadband beamformer implementation.This thesis addresses the formulation of and solution to broadband minimum variance distortionless response (MVDR) beamforming. Two approaches to this problem are considered, namely, generalised sidelobe canceller (GSC) and Capon beamformers. These are examined based on a novel technique which relies on polynomial matrix formulations. The new scheme is based on the second order statistics of the array sensor measurements in order to estimate a space-time covariance matrix. The beamforming problem can be formulated based on this space-time covariance matrix. Akin to the narrowband problem, where an optimum solution can be derived from the eigenvalue decomposition (EVD) of a constant covariance matrix, this utility is here extended to the broadband case. The decoupling of the space-time covariance matrix in this case is provided by means of a polynomial matrix EVD. The proposed approach is initially exploited to design a GSC beamformer for a uniform linear array, and then extended to the constrained MVDR, or Capon, beamformer and also the GSC with an arbitrary array structure. The uniqueness of the designed GSC comes from utilising the polynomial matrix technique, and its ability to steer the array beam towards an off-broadside direction without the pre-steering stage that is associated with conventional approaches to broadband beamformers. To solve the broadband beamforming problem, this thesis addresses a number of additional tools. A first one is the accurate construction of both the steering vectors based on fractional delay filters, which are required for the broadband constraint formulation of a beamformer, as for the construction of the quiescent beamformer. In the GSC case, we also discuss how a block matrix can be obtained, and introduce a novel paraunitary matrix completion algorithm. For the Capon beamformer, the polynomial extension requires the inversion of a polynomial matrix, for which a residue-based method is proposed that offers better accuracy compared to previously utilised approaches. These proposed polynomial matrix techniques are evaluated in a number of simulations. The results show that the polynomial broadband beamformer (PBBF) steersthe main beam towards the direction of the signal of interest (SoI) and protects the signal over the specified bandwidth, and at the same time suppresses unwanted signals by placing nulls in their directions. In addition to that, the PBBF is compared to the standard time domain broadband beamformer in terms of their mean square error performance, beam-pattern, and computation complexity. This comparison shows that the PBBF can offer a significant reduction in computation complexity compared to its standard counterpart. Overall, the main benefits of this approach include beam steering towards an arbitrary look direction with no need for pre-steering step, and a potentially significant reduction in computational complexity due to the decoupling of dependencies of the quiescent beamformer, blocking matrix, and the adaptive filter compared to a standard broadband beamformer implementation

Iterative approximation of analytic eigenvalues of a parahermitian matrix EVD

We present an algorithm that extracts analytic eigenvalues from a parahermitian matrix. Operating in the discrete Fourier transform domain, an inner iteration re-establishes the lost association between bins via a maximum likelihood sequence detection driven by a smoothness criterion. An outer iteration continues until a desired accuracy for the approximation of the extracted eigenvalues has been achieved. The approach is compared to existing algorithms