Modelling Aspects of Planar Multi-Mode Antennas for Direction-of-Arrival Estimation

Multi-mode antennas are an alternative to classical antenna arrays, and hence a promising emerging sensor technology for a vast variety of applications in the areas of array signal processing and digital communications. An unsolved problem is to describe the radiation pattern of multi-mode antennas in closed analytic form based on calibration measurements or on electromagnetic field (EMF) simulation data. As a solution, we investigate two modeling methods: One is based on the array interpolation technique (AIT), the other one on wavefield modeling (WM). Both methods are able to accurately interpolate quantized EMF data of a given multi-mode antenna, in our case a planar four-port antenna developed for the 6-8.5 GHz range. Since the modeling methods inherently depend on parameter sets, we investigate the influence of the parameter choice on the accuracy of both models. Furthermore, we evaluate the impact of modeling errors for coherent maximum-likelihood direction-of-arrival (DoA) estimation given different model parameters. Numerical results are presented for a single polarization component. Simulations reveal that the estimation bias introduced by model errors is subject to the chosen model parameters. Finally, we provide optimized sets of AIT and WM parameters for the multi-mode antenna under investigation. With these parameter sets, EMF data samples can be reproduced in interpolated form with high angular resolution

Compact Formulations for Sparse Reconstruction in Fully and Partly Calibrated Sensor Arrays

Sensor array processing is a classical field of signal processing which offers various applications in practice, such as direction of arrival estimation or signal reconstruction, as well as a rich theory, including numerous estimation methods and statistical bounds on the achievable estimation performance. A comparably new field in signal processing is given by sparse signal reconstruction (SSR), which has attracted remarkable interest in the research community during the last years and similarly offers plentiful fields of application. This thesis considers the application of SSR in fully calibrated sensor arrays as well as in partly calibrated sensor arrays. The main contributions are a novel SSR method for application in partly calibrated arrays as well as compact formulations for the SSR problem, where special emphasis is given on exploiting specific structure in the signals as well as in the array topologies

Three more Decades in Array Signal Processing Research: An Optimization and Structure Exploitation Perspective

The signal processing community currently witnesses the emergence of sensor array processing and Direction-of-Arrival (DoA) estimation in various modern applications, such as automotive radar, mobile user and millimeter wave indoor localization, drone surveillance, as well as in new paradigms, such as joint sensing and communication in future wireless systems. This trend is further enhanced by technology leaps and availability of powerful and affordable multi-antenna hardware platforms. The history of advances in super resolution DoA estimation techniques is long, starting from the early parametric multi-source methods such as the computationally expensive maximum likelihood (ML) techniques to the early subspace-based techniques such as Pisarenko and MUSIC. Inspired by the seminal review paper Two Decades of Array Signal Processing Research: The Parametric Approach by Krim and Viberg published in the IEEE Signal Processing Magazine, we are looking back at another three decades in Array Signal Processing Research under the classical narrowband array processing model based on second order statistics. We revisit major trends in the field and retell the story of array signal processing from a modern optimization and structure exploitation perspective. In our overview, through prominent examples, we illustrate how different DoA estimation methods can be cast as optimization problems with side constraints originating from prior knowledge regarding the structure of the measurement system. Due to space limitations, our review of the DoA estimation research in the past three decades is by no means complete. For didactic reasons, we mainly focus on developments in the field that easily relate the traditional multi-source estimation criteria and choose simple illustrative examples.Comment: 16 pages, 8 figures. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Uni-Vector-Sensor Dimensionality Reduction MUSIC Algorithm for DOA and Polarization Estimation

This paper addresses the problem of multiple signal classification- (MUSIC-) based direction of arrival (DOA) and polarization estimation and proposes a new dimensionality reduction MUSIC (DR-MUSIC) algorithm. Uni-vector-sensor MUSIC algorithm provides estimation for DOA and polarization; accordingly, a four-dimensional peak search is required, which hence incurs vast amount of computation. In the proposed DR-MUSIC method, the signal steering vector is expressed in the product form of arrival angle function matrix and polarization function vector. The MUSIC joint spectrum is converted to the form of Rayleigh-Ritz ratio by using the feature where the 2-norm of polarization function vector is constant. A four-dimensional MUSIC search reduced the dimension to two two-dimensional searches and the amount of computation is greatly decreased. The theoretical analysis and simulation results have verified the effectiveness of the proposed algorithm

Sensor Array Signal Processing via Eigenanalysis of Matrix Pencils Composed of Data Derived from Translationally Invariant Subarrays

An algorithm is developed for estimating characteristic parameters associated with a scene of radiating sources given the data derived from a pair of translationally invariant arrays, the X and Y arrays, which are displaced relative to one another. The algorithm is referred to as PR O—E SPRIT and is predicated on invoking two recent mathematical developments: (1) the SVD based solution to the Procrustes problem of optimally approximating an invariant subspace rotation and (2) the Total Least Squares method for perturbing each of the two estimates of a common subspace in a minimal fashion until the two perturbed spaces are the same. For uniform linear array scenarios, the use of forward-backward averaging (FBAVG) in conjunction with PR O—E S PR IT is shown to effect a substantial reduction in the computational burden, a significant improvement in performance, a simple scheme for estimating the number of sources and source decorrelation. These gains may be attributed to FBAVG’s judicious exploitation of the diagonal invariance operator relating the Direction of Arrival matrix of the Y array to that associated with the X array. Similar gains may be achieved in the case where the X and Y arrays are either not linear or not uniformly spaced through the use of pseudo-forward-backward averaging (PFBAVG). However, the use of PFBAVG does not effect source decorrelation and reduces the maximum number of resolvable sources by a factor of two. Simulation studies and the results of applying PR O—E S PR IT to real data demonstrate the excellent performance of the method

Advanced Algebraic Concepts for Efficient Multi-Channel Signal Processing

Unsere moderne Gesellschaft ist Zeuge eines fundamentalen Wandels in der Art und Weise wie wir mit Technologie interagieren. Geräte werden zunehmend intelligenter - sie verfügen über mehr und mehr Rechenleistung und häufiger über eigene Kommunikationsschnittstellen. Das beginnt bei einfachen Haushaltsgeräten und reicht über Transportmittel bis zu großen überregionalen Systemen wie etwa dem Stromnetz. Die Erfassung, die Verarbeitung und der Austausch digitaler Informationen gewinnt daher immer mehr an Bedeutung. Die Tatsache, dass ein wachsender Anteil der Geräte heutzutage mobil und deshalb batteriebetrieben ist, begründet den Anspruch, digitale Signalverarbeitungsalgorithmen besonders effizient zu gestalten. Dies kommt auch dem Wunsch nach einer Echtzeitverarbeitung der großen anfallenden Datenmengen zugute. Die vorliegende Arbeit demonstriert Methoden zum Finden effizienter algebraischer Lösungen für eine Vielzahl von Anwendungen mehrkanaliger digitaler Signalverarbeitung. Solche Ansätze liefern nicht immer unbedingt die bestmögliche Lösung, kommen dieser jedoch häufig recht nahe und sind gleichzeitig bedeutend einfacher zu beschreiben und umzusetzen. Die einfache Beschreibungsform ermöglicht eine tiefgehende Analyse ihrer Leistungsfähigkeit, was für den Entwurf eines robusten und zuverlässigen Systems unabdingbar ist. Die Tatsache, dass sie nur gebräuchliche algebraische Hilfsmittel benötigen, erlaubt ihre direkte und zügige Umsetzung und den Test unter realen Bedingungen. Diese Grundidee wird anhand von drei verschiedenen Anwendungsgebieten demonstriert. Zunächst wird ein semi-algebraisches Framework zur Berechnung der kanonisch polyadischen (CP) Zerlegung mehrdimensionaler Signale vorgestellt. Dabei handelt es sich um ein sehr grundlegendes Werkzeug der multilinearen Algebra mit einem breiten Anwendungsspektrum von Mobilkommunikation über Chemie bis zur Bildverarbeitung. Verglichen mit existierenden iterativen Lösungsverfahren bietet das neue Framework die Möglichkeit, den Rechenaufwand und damit die Güte der erzielten Lösung zu steuern. Es ist außerdem weniger anfällig gegen eine schlechte Konditionierung der Ausgangsdaten. Das zweite Gebiet, das in der Arbeit besprochen wird, ist die unterraumbasierte hochauflösende Parameterschätzung für mehrdimensionale Signale, mit Anwendungsgebieten im RADAR, der Modellierung von Wellenausbreitung, oder bildgebenden Verfahren in der Medizin. Es wird gezeigt, dass sich derartige mehrdimensionale Signale mit Tensoren darstellen lassen. Dies erlaubt eine natürlichere Beschreibung und eine bessere Ausnutzung ihrer Struktur als das mit Matrizen möglich ist. Basierend auf dieser Idee entwickeln wir eine tensor-basierte Schätzung des Signalraums, welche genutzt werden kann um beliebige existierende Matrix-basierte Verfahren zu verbessern. Dies wird im Anschluss exemplarisch am Beispiel der ESPRIT-artigen Verfahren gezeigt, für die verbesserte Versionen vorgeschlagen werden, die die mehrdimensionale Struktur der Daten (Tensor-ESPRIT), nichzirkuläre Quellsymbole (NC ESPRIT), sowie beides gleichzeitig (NC Tensor-ESPRIT) ausnutzen. Um die endgültige Schätzgenauigkeit objektiv einschätzen zu können wird dann ein Framework für die analytische Beschreibung der Leistungsfähigkeit beliebiger ESPRIT-artiger Algorithmen diskutiert. Verglichen mit existierenden analytischen Ausdrücken ist unser Ansatz allgemeiner, da keine Annahmen über die statistische Verteilung von Nutzsignal und Rauschen benötigt werden und die Anzahl der zur Verfügung stehenden Schnappschüsse beliebig klein sein kann. Dies führt auf vereinfachte Ausdrücke für den mittleren quadratischen Schätzfehler, die Schlussfolgerungen über die Effizienz der Verfahren unter verschiedenen Bedingungen zulassen. Das dritte Anwendungsgebiet ist der bidirektionale Datenaustausch mit Hilfe von Relay-Stationen. Insbesondere liegt hier der Fokus auf Zwei-Wege-Relaying mit Hilfe von Amplify-and-Forward-Relays mit mehreren Antennen, da dieser Ansatz ein besonders gutes Kosten-Nutzen-Verhältnis verspricht. Es wird gezeigt, dass sich die nötige Kanalkenntnis mit einem einfachen algebraischen Tensor-basierten Schätzverfahren gewinnen lässt. Außerdem werden Verfahren zum Finden einer günstigen Relay-Verstärkungs-Strategie diskutiert. Bestehende Ansätze basieren entweder auf komplexen numerischen Optimierungsverfahren oder auf Ad-Hoc-Ansätzen die keine zufriedenstellende Bitfehlerrate oder Summenrate liefern. Deshalb schlagen wir algebraische Ansätze zum Finden der Relayverstärkungsmatrix vor, die von relevanten Systemmetriken inspiriert sind und doch einfach zu berechnen sind. Wir zeigen das algebraische ANOMAX-Verfahren zum Erreichen einer niedrigen Bitfehlerrate und seine Modifikation RR-ANOMAX zum Erreichen einer hohen Summenrate. Für den Spezialfall, in dem die Endgeräte nur eine Antenne verwenden, leiten wir eine semi-algebraische Lösung zum Finden der Summenraten-optimalen Strategie (RAGES) her. Anhand von numerischen Simulationen wird die Leistungsfähigkeit dieser Verfahren bezüglich Bitfehlerrate und erreichbarer Datenrate bewertet und ihre Effektivität gezeigt.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 systems. The fact that they rely on standard algebraic methods only allows their rapid implementation and test under real-world conditions. We demonstrate this concept in three different application areas. First, we present a semi-algebraic framework to compute the Canonical Polyadic (CP) decompositions of multidimensional signals, a very fundamental tool in multilinear algebra with applications ranging from chemistry over communications to image compression. Compared to state-of-the art iterative solutions, our framework offers a flexible control of the complexity-accuracy trade-off and is less sensitive to badly conditioned data. The second application area is multidimensional subspace-based high-resolution parameter estimation with applications in RADAR, wave propagation modeling, or biomedical imaging. We demonstrate that multidimensional signals can be represented by tensors, providing a convenient description and allowing to exploit the multidimensional structure in a better way than using matrices only. Based on this idea, we introduce the tensor-based subspace estimate which can be applied to enhance existing matrix-based parameter estimation schemes significantly. We demonstrate the enhancements by choosing the family of ESPRIT-type algorithms as an example and introducing enhanced versions that exploit the multidimensional structure (Tensor-ESPRIT), non-circular source amplitudes (NC ESPRIT), and both jointly (NC Tensor-ESPRIT). To objectively judge the resulting estimation accuracy, we derive a framework for the analytical performance assessment of arbitrary ESPRIT-type algorithms by virtue of an asymptotical first order perturbation expansion. Our results are more general than existing analytical results since we do not need any assumptions about the distribution of the desired signal and the noise and we do not require the number of samples to be large. At the end, we obtain simplified expressions for the mean square estimation error that provide insights into efficiency of the methods under various conditions. The third application area is bidirectional relay-assisted communications. Due to its particularly low complexity and its efficient use of the radio resources we choose two-way relaying with a MIMO amplify and forward relay. We demonstrate that the required channel knowledge can be obtained by a simple algebraic tensor-based channel estimation scheme. We also discuss the design of the relay amplification matrix in such a setting. Existing approaches are either based on complicated numerical optimization procedures or on ad-hoc solutions that to not perform well in terms of the bit error rate or the sum-rate. Therefore, we propose algebraic solutions that are inspired by these performance metrics and therefore perform well while being easy to compute. For the MIMO case, we introduce the algebraic norm maximizing (ANOMAX) scheme, which achieves a very low bit error rate, and its extension Rank-Restored ANOMAX (RR-ANOMAX) that achieves a sum-rate close to an upper bound. Moreover, for the special case of single antenna terminals we derive the semi-algebraic RAGES scheme which finds the sum-rate optimal relay amplification matrix based on generalized eigenvectors. Numerical simulations evaluate the resulting system performance in terms of bit error rate and system sum rate which demonstrates the effectiveness of the proposed algebraic solutions

Wavefield modeling and signal processing for sensor arrays of arbitrary geometry

Sensor arrays and related signal processing methods are key technologies in many areas of engineering including wireless communication systems, radar and sonar as well as in biomedical applications. Sensor arrays are a collection of sensors that are placed at distinct locations in order to sense physical phenomena or synthesize wavefields. Spatial processing from the multichannel output of the sensor array is a typical task. Such processing is useful in areas including wireless communications, radar, surveillance and indoor positioning. In this dissertation, fundamental theory and practical methods of wavefield modeling for radio-frequency array processing applications are developed. Also, computationally-efficient high-resolution and optimal signal processing methods for sensor arrays of arbitrary geometry are proposed. Methods for taking into account array nonidealities are introduced as well. Numerical results illustrating the performance of the proposed methods are given using real-world antenna arrays. Wavefield modeling and manifold separation for vector-fields such as completely polarized electromagnetic wavefields and polarization sensitive arrays are proposed. Wavefield modeling is used for writing the array output in terms of two independent parts, namely the sampling matrix depending on the employed array including nonidealities and the coefficient vector depending on the wavefield. The superexponentially decaying property of the sampling matrix for polarization sensitive arrays is established. Two estimators of the sampling matrix from calibration measurements are proposed and their statistical properties are established. The array processing methods developed in this dissertation concentrate on polarimetric beamforming as well as on high-resolution and optimal azimuth, elevation and polarization parameter estimation. The proposed methods take into account array nonidealities such as mutual coupling, cross-polarization effects and mounting platform reflections. Computationally-efficient solutions based on polynomial rooting techniques and fast Fourier transform are achieved without restricting the proposed methods to regular array geometries. A novel expression for the Cramér-Rao bound in array processing that is tight for real-world arrays with nonidealities in the asymptotic regime is also proposed. A relationship between spherical harmonics and 2-D Fourier basis, called equivalence matrix, is established. A novel fast spherical harmonic transform is proposed, and a one-to-one mapping between spherical harmonic and 2-D Fourier spectra is found. Improvements to the minimum number of samples on the sphere that are needed in order to avoid aliasing are also proposed