Advanced Algorithms for Polynomial Matrix Eigenvalue Decomposition

Matrix factorisations such as the eigen- (EVD) or singular value decomposition (SVD) offer optimality in often various senses to many narrowband signal processing algorithms. For broadband problems, where quantities such as MIMO transfer functions or cross spectral density matrices are conveniently described by polynomial matrices, such narrowband factorisations are suboptimal at best. To extend the utility of EVD and SVD to the broadband case, polynomial matrix factorisations have gained momen- tum over the past decade, and a number of iterative algorithms for particularly the polynomial matrix EVD (PEVD) have emerged. Existing iterative PEVD algorithms produce factorisations that are computationally costly (i) to calculate and (ii) to apply. For the former, iterative algorithms at every step eliminate off-diagonal energy, but this can be a slow process. For the latter, the polynomial order of the resulting factors, directly impacting on the implementa- ...

Corr, Jamie — University of Strathclyde


Algorithmic Enhancements to Polynomial Matrix Factorisations

In broadband array processing applications, an extension of the eigenvalue decomposition (EVD) to parahermitian Laurent polynomial matrices - named the polynomial matrix EVD (PEVD) - has proven to be a useful tool for the decomposition of space-time covariance matrices and their associated cross-spectral density matrices. Existing PEVD methods typically operate in the time domain and utilise iterative frameworks established by the second-order sequential best rotation (SBR2) or sequential matrix diagonalisation (SMD) algorithms. However, motivated by recent discoveries that establish the existence of an analytic PEVD - which is rarely recovered by SBR2 or SMD - alternative algorithms that better meet analyticity by operating in the discrete Fourier transform (DFT)-domain have received increasing attention. While offering promising results in applications including broadband MIMO and beamforming, the PEVD has seen limited deployment in hardware due to its high computational complexity. If the ...

Coutts, Fraser Kenneth — University of Strathclyde


Algorithms and Techniques for Polynomial Matrix Decompositions

The concept of polynomial matrices is introduced and the potential application of polynomial matrix decompositions is discussed within the general context of multi-channel digital signal processing. A recently developed technique, known as the second order sequential rotation algorithm (SBR2), for performing the eigenvalue decomposition of a para-Hermitian polynomial matrix (PEVD) is presented. The potential benefit of using the SBR2 algorithm to impose strong decorrelation on the signals received by a broadband sensor array is demonstrated by means of a suitable numerical simulation. This demonstrates how the polynomial matrices produced as a result of the PEVD can be of unnecessarily high order. This is undesirable for many practical applications and slows down the iterative computational procedure. An effective truncation technique for controlling the growth in order of these polynomial matrices is proposed. Depending on the choice of truncation parameters, it provides ...

Foster, Joanne — Cardiff University


Broadband angle of arrival estimation using polynomial matrix decompositions

This thesis is concerned with the problem of broadband angle of arrival (AoA) estimation for sensor arrays. There is a rich theory of narrowband solutions to the AoA problem, which typically involves the covariance matrix of the received data and matrix factorisations such as the eigenvalue decomposition (EVD) to reach optimality in various senses. For broadband arrays, such as found in sonar, acoustics or other applications where signals do not fulfil the narrowband assumption, working with phase shifts between different signals — as sufficient in the narrowband case — does not suffice and explicit lags need to be taken into account. The required space-time covariance matrix of the data now has a lag dimension, and classical solutions such as those based on the EVD are no longer directly applicable. There are a number of existing broadband AoA techniques, which are ...

Alrmah, Mohamed Abubaker — University of Strathclyde


Polynomial Matrix Decompositions and Paraunitary Filter Banks

There are an increasing number of problems that can be solved using paraunitary filter banks. The design of optimal orthonormal filter banks for the efficient coding of signals has received considerable interest over the years. In contrast, very little attention has been given to the problem of constructing paraunitary matrices for the purpose of broadband signal subspace estimation. This thesis begins by relating these two areas of research. A frequency-domain method of diagonalising parahermitian polynomial matrices is proposed and shown to have fundamental limitations. Then the thesis focuses on the development of a novel time-domain technique that extends the eigenvalue decomposition to polynomial matrices, referred to as the second order sequential best rotation (SBR2) algorithm. This technique imposes strong decorrelation on its input signals by applying a sequence of elementary paraunitary matrices which constitutes a generalisation of the classical Jacobi ...

Redif, Soydan — University of Southampton


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 ...

Alzin, Ahmed — University of Strathclyde


MIMO Instantaneous Blind Identification and Separation based on Arbitrary Order Temporal Structure in the Data

This thesis is concerned with three closely related problems. The first one is called Multiple-Input Multiple-Output (MIMO) Instantaneous Blind Identification, which we denote by MIBI. In this problem a number of mutually statistically independent source signals are mixed by a MIMO instantaneous mixing system and only the mixed signals are observed, i.e. both the mixing system and the original sources are unknown or ‘blind’. The goal of MIBI is to identify the MIMO system from the observed mixtures of the source signals only. The second problem is called Instantaneous Blind Signal Separation (IBSS) and deals with recovering mutually statistically independent source signals from their observed instantaneous mixtures only. The observation model and assumptions on the signals and mixing system are the same as those of MIBI. However, the main purpose of IBSS is the estimation of the source signals, whereas ...

van de Laar, Jakob — TU Eindhoven


MIMO instantaneous blind idenfitication and separation based on arbitrary order

This thesis is concerned with three closely related problems. The first one is called Multiple-Input Multiple-Output (MIMO) Instantaneous Blind Identification, which we denote by MIBI. In this problem a number of mutually statistically independent source signals are mixed by a MIMO instantaneous mixing system and only the mixed signals are observed, i.e. both the mixing system and the original sources are unknown or ¡blind¢. The goal of MIBI is to identify the MIMO system from the observed mixtures of the source signals only. The second problem is called Instantaneous Blind Signal Separation (IBSS) and deals with recovering mutually statistically independent source signals from their observed instantaneous mixtures only. The observation model and assumptions on the signals and mixing system are the same as those of MIBI. However, the main purpose of IBSS is the estimation of the source signals, whereas ...

van de Laar, Jakob — T.U. Eindhoven


Tensor Decompositions and Algorithms for Efficient Multidimensional Signal Processing

Due to the extensive growth of big data applications, the widespread use of multisensor technologies, and the need for efficient data representations, multidimensional techniques are a primary tool for many signal processing applications. Multidimensional arrays or tensors allow a natural representation of high-dimensional data. Therefore, they are particularly suited for tasks involving multi-modal data sources such as biomedical sensor readings or multiple-input and multiple-output (MIMO) antenna arrays. While tensor-based techniques were still in their infancy several decades ago, nowadays, they have already proven their effectiveness in various applications. There are many different tensor decompositions in the literature, and each finds use in diverse signal processing fields. In this thesis, we focus on two tensor factorization models: the rank-(Lr,Lr,1) Block-Term Decomposition (BTD) and the Multilinear Generalized Singular Value Decomposition (ML-GSVD) that we propose in this thesis. The ML-GSVD is an extension ...

Khamidullina, Liana — Technische Universität Ilmenau


Subspace-based exponential data fitting using linear and multilinear algebra

The exponentially damped sinusoidal (EDS) model arises in numerous signal processing applications. It is therefore of great interest to have methods able to estimate the parameters of such a model in the single-channel as well as in the multi-channel case. Because such a model naturally lends itself to subspace representation, powerful matrix approaches like HTLS in the single-channel case, HTLSstack in the multi-channel case and HTLSDstack in the decimative case have been developed to estimate the parameters of the underlying EDS model. They basically consist in stacking the signal in Hankel (single-channel) or block Hankel (multi- channel) data matrices. Then, the signal subspace is estimated by means of the singular value decomposition (SVD). The parameters of the model, namely the amplitudes, the phases, the damping factors, and the frequencies, are estimated from this subspace. Note that the sample covariance matrix ...

Papy, Jean-Michel — Katholieke Universiteit Leuven


Feedback Delay Networks in Artificial Reverberation and Reverberation Enhancement

In today's audio production and reproduction as well as in music performance practices it has become common practice to alter reverberation artificially through electronics or electro-acoustics. For music productions, radio plays, and movie soundtracks, the sound is often captured in small studio spaces with little to no reverberation to save real estate and to ensure a controlled environment such that the artistically intended spatial impression can be added during post-production. Spatial sound reproduction systems require flexible adjustment of artificial reverberation to the diffuse sound portion to help the reconstruction of the spatial impression. Many modern performance spaces are multi-purpose, and the reverberation needs to be adjustable to the desired performance style. Employing electro-acoustic feedback, also known as Reverberation Enhancement Systems (RESs), it is possible to extend the physical to the desired reverberation. These examples demonstrate a wide range of applications ...

Schlecht, Sebastian Jiro — Friedrich-Alexander-Universität Erlangen-Nürnberg


Performance Enhancement for Filter Bank Multicarrier Methods in Multi-Antenna Wireless Communication Systems

This thesis investigates filter bank based multicarrier modulation using offset quadrature amplitude modulation (FBMC/OQAM), which is characterised by a critically sampled FBMC system that achieves full spectral efficiency in the sense of being free of redundancy. As a starting point, a performance comparison between FBMC/OQAM and oversampled (OS) FBMC systems is made in terms of per-subband fractionally spaced equalisation in order to compensate for the transmission distortions caused by dispersive channels. Simulation results show the reduced performance in equalising FBMC/OQAM compared to OS-FBMC, where the advantage for the latter stems from the use of guard bands. Alternatively, the inferior performance of FBMC/OQAM can be assigned to the inability of a per-subband equaliser to address the problem of potential intercarrier interference (ICI) in this system. The FBMC/OQAM system is analysed by representing the equivalent transmultiplexed channel including the filter banks as ...

Nagy, Amr — University of Strathclyde


Advanced Signal Processing Concepts for Multi-Dimensional Communication Systems

The widespread use of mobile internet and smart applications has led to an explosive growth in mobile data traffic. With the rise of smart homes, smart buildings, and smart cities, this demand is ever growing since future communication systems will require the integration of multiple networks serving diverse sectors, domains and applications, such as multimedia, virtual or augmented reality, machine-to-machine (M2M) communication / the Internet of things (IoT), automotive applications, and many more. Therefore, in the future, the communication systems will not only be required to provide Gbps wireless connectivity but also fulfill other requirements such as low latency and massive machine type connectivity while ensuring the quality of service. Without significant technological advances to increase the system capacity, the existing telecommunications infrastructure will be unable to support these multi-dimensional requirements. This poses an important demand for suitable waveforms with ...

Cheema, Sher Ali — Technische Universität Ilmenau


Advanced Multi-Dimensional Signal Processing for Wireless Systems

The thriving development of wireless communications calls for innovative and advanced signal processing techniques targeting at an enhanced performance in terms of reliability, throughput, robustness, efficiency, flexibility, etc.. This thesis addresses such a compelling demand and presents new and intriguing progress towards fulfilling it. We mainly concentrate on two advanced multi-dimensional signal processing challenges for wireless systems that have attracted tremendous research attention in recent years, multi-carrier Multiple-Input Multiple-Output (MIMO) systems and multi-dimensional harmonic retrieval. As the key technologies of wireless communications, the numerous benefits of MIMO and multi-carrier modulation, e.g., boosting the data rate and improving the link reliability, have long been identified and have ignited great research interest. In particular, the Orthogonal Frequency Division Multiplexing (OFDM)-based multi-user MIMO downlink with Space-Division Multiple Access (SDMA) combines the twofold advantages of MIMO and multi-carrier modulation. It is the essential element ...

Cheng, Yao — Ilmenau University of Technology


Advanced Algebraic Concepts for Efficient Multi-Channel Signal Processing

Modern society is undergoing a fundamental change in the way we interact with technology. More and more devices are becoming "smart" by gaining advanced computation capabilities and communication interfaces, from household appliances over transportation systems to large-scale networks like the power grid. Recording, processing, and exchanging digital information is thus becoming increasingly important. As a growing share of devices is nowadays mobile and hence battery-powered, a particular interest in efficient digital signal processing techniques emerges. This thesis contributes to this goal by demonstrating methods for finding efficient algebraic solutions to various applications of multi-channel digital signal processing. These may not always result in the best possible system performance. However, they often come close while being significantly simpler to describe and to implement. The simpler description facilitates a thorough analysis of their performance which is crucial to design robust and reliable ...

Roemer, Florian — Ilmenau University of Technology

The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.

The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.