Performance evaluation and waveform design for MIMO radar

Multiple-input multiple-output (MIMO) radar has been receiving increasing attention in recent years due to the dramatic advantages offered by MIMO systems in communications. The amount of energy reflected from a common radar target varies considerably with the observation angle, and these scintillations may cause signal fading which severely degrades the performance of conventional radars. MIMO radar with widely spaced antennas is able to view several aspects of a target simultaneously, which realizes a spatial diversity gain to overcome the target scintillation problem, leading to significantly enhanced system performance. Building on the initial studies presented in the literature, MIMO radar is investigated in detail in this thesis. First of all, a finite scatterers model is proposed, based on which the target detection performance of a MIMO radar system with arbitrary array-target configurations is evaluated and analyzed. A MIMO radar involving a realistic target is also set up, whose simulation results corroborate the conclusions drawn based on theoretical target models, validating in a practical setting the improvements in detection performance brought in by the MIMO radar configuration. Next, a hybrid bistatic radar is introduced, which combines the phased-array and MIMO radar configurations to take advantage of both coherent processing gain and spatial diversity gain simultaneously. The target detection performance is first assessed, followed by the evaluation of the direction finding performance, i.e., performance of estimating angle of arrival as well as angel of departure. The presented theoretical expressions can be used to select the best architecture for a radar system, particularly when the total number of antennas is fixed. Finally, a novel two phase radar scheme involving signal retransmission is studied. It is based on the time-reversal (TR) detection and is investigated to improve the detection performance of a wideband MIMO radar or sonar system. Three detectors demanding various amounts of a priori information are developed, whose performance is evaluated and compared. Three schemes are proposed to design the retransmitted waveform with constraints on the transmitted signal power, further enhancing the detection performance with respect to the TR approach

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

Space-Time Parameter Estimation in Radar Array Processing

This thesis is about estimating parameters using an array of spatially distributed sensors. The material is presented in the context of radar array processing, but the analysis could be of interest in a wide range of applications such as communications, sonar, radio astronomy, seismology, and medical diagnosis. The main theme of the thesis is to analyze the fundamental limitations on estimation performance in sensor array signal processing. To this end, lower bounds on the estimation accuracy as well as the performance of the maximum likelihood (ML) and weighted least-squares (WLS) estimators are studied. The focus in the first part of the thesis is on asymptotic analyses. It deals with the problem of estimating the directions of arrival (DOAs) and Doppler frequencies with a sensor array. This problem can also be viewed as a two-dimensional (2-D) frequency estimation problem. The ML and WLS estimators for this problem amount to multidimensional, highly non-linear optimization problems which would be expensive to solve in real-time in a radar system. Therefore, simplifications of this problem are of great interest. It is shown in this thesis that, under some circumstances, the 2-D problem decouples into 1-D problems. This means a dramatic reduction in computational complexity with insignificant loss of accuracy. The second part contains a performance analysis of the ML DOA estimator under conditions of low signal-to-noise ratio (SNR) and a small number of data samples. It is well known that the ML estimator exhibits a threshold effect, i.e. a rapid deterioration of estimation accuracy below a certain SNR. This effect is caused by outliers and is not captured by standard analysis tools. In this thesis, approximations to the mean square estimation error and probability of outlier are derived that can be used to predict the threshold region performance of the ML estimator with high accuracy. Moreover, these approximations alleviate the need for time-consuming computer simulations when evaluating the ML performance

Space-Time Parameter Estimation in Radar Array Processing

This thesis is about estimating parameters using an array of spatially distributed sensors. The material is presented in the context of radar array processing, but the analysis could be of interest in a wide range of applications such as communications, sonar, radio astronomy, seismology, and medical diagnosis. The main theme of the thesis is to analyze the fundamental limitations on estimation performance in sensor array signal processing. To this end, lower bounds on the estimation accuracy as well as the performance of the maximum likelihood (ML) and weighted least-squares (WLS) estimators are studied. The focus in the first part of the thesis is on asymptotic analyses. It deals with the problem of estimating the directions of arrival (DOAs) and Doppler frequencies with a sensor array. This problem can also be viewed as a two-dimensional (2-D) frequency estimation problem. The ML and WLS estimators for this problem amount to multidimensional, highly non-linear optimization problems which would be expensive to solve in real-time in a radar system. Therefore, simplifications of this problem are of great interest. It is shown in this thesis that, under some circumstances, the 2-D problem decouples into 1-D problems. This means a dramatic reduction in computational complexity with insignificant loss of accuracy. The second part contains a performance analysis of the ML DOA estimator under conditions of low signal-to-noise ratio (SNR) and a small number of data samples. It is well known that the ML estimator exhibits a threshold effect, i.e. a rapid deterioration of estimation accuracy below a certain SNR. This effect is caused by outliers and is not captured by standard analysis tools. In this thesis, approximations to the mean square estimation error and probability of outlier are derived that can be used to predict the threshold region performance of the ML estimator with high accuracy. Moreover, these approximations alleviate the need for time-consuming computer simulations when evaluating the ML performance

Applications of Continuous Spatial Models in Multiple Antenna Signal Processing

This thesis covers the investigation and application of continuous spatial models for multiple antenna signal processing. The use of antenna arrays for advanced sensing and communications systems has been facilitated by the rapid increase in the capabilities of digital signal processing systems. The wireless communications channel will vary across space as different signal paths from the same source combine and interfere. This creates a level of spatial diversity that can be exploited to improve the robustness and overall capacity of the wireless channel. Conventional approaches to using spatial diversity have centered on smart, adaptive antennas and spatial beam forming. Recently, the more general theory of multiple input, multiple output (MIMO) systems has been developed to utilise the independent spatial communication modes offered in a scattering environment. ¶ ..

Advanced array signal processing algorithms for multi-dimensional parameter estimation

Multi-dimensional high-resolution parameter estimation is a fundamental problem in a variety of array signal processing applications, including radar, mobile communications, multiple-input multiple-output (MIMO) channel estimation, and biomedical imaging. The objective is to estimate the frequency parameters of noise-corrupted multi-dimensional harmonics that are sampled on a multi-dimensional grid. Among the proposed parameter estimation algorithms to solve this problem, multi-dimensional (R-D) ESPRIT-type algorithms have been widely used due to their computational efficiency and their simplicity. Their performance in various scenarios has been objectively evaluated by means of an analytical performance assessment framework. Recently, a relatively new class of parameter estimators based on sparse signal reconstruction has gained popularity due to their robustness under challenging conditions such as a small sample size or strong signal correlation. A common approach towards further improving the performance of parameter estimation algorithms is to exploit prior knowledge on the structure of the signals. In this thesis, we develop enhanced versions of R-D ESPRIT-type algorithms and the relatively new class of sparsity-based parameter estimation algorithms by exploiting the multi-dimensional structure of the signals and the statistical properties of strictly non-circular (NC) signals. First, we derive analytical expressions for the gain from forward-backward averaging and tensor-based processing in R-D ESPRIT-type and R-D Tensor-ESPRIT-type algorithms for the special case of two sources. This is accomplished by simplifying the generic analytical MSE expressions from the performance analysis of R-D ESPRIT-type algorithms. The derived expressions allow us to identify the parameter settings, e.g., the number of sensors, the signal correlation, and the source separation, for which both gains are most pronounced or no gain is achieved. Second, we propose the generalized least squares (GLS) algorithm to solve the overdetermined shift invariance equation in R-D ESPRIT-type algorithms. GLS directly incorporates the statistics of the subspace estimation error into the shift invariance solution through its covariance matrix, which is found via a first-order perturbation expansion. To objectively assess the estimation accuracy, we derive performance analysis expressions for the mean square error (MSE) of GLS-based ESPRIT-type algorithms, which are asymptotic in the effective SNR, i.e., the results become exact for a high SNR or a small sample size. Based on the performance analysis, we show that the simplified MSE expressions of GLS-based 1-D ESPRIT-type algorithms for a single source and two sources can be transformed into the corresponding Cramer-Rao bound (CRB) expressions, which provide a lower limit on the estimation error. Thereby, ESPRIT-type algorithms can become asymptotically efficient, i.e., they asymptotically achieve the CRB. Numerical simulations show that this can also be the case for more than two sources. In the third contribution, we derive matrix-based and tensor-based R-D NC ESPRIT-type algorithms for multi-dimensional strictly non-circular signals, where R-D NC Tensor-ESPRIT-type algorithms exploit both the multi-dimensional structure and the strictly non-circular structure of the signals. Exploiting the NC signal structure by means of a preprocessing step leads to a virtual doubling of the original sensor array, which provides an improved estimation accuracy and doubles the number of resolvable signals. We derive an analytical performance analysis and compute simplified MSE expressions for a single source and two sources. These expressions are used to analytically compute the NC gain for these cases, which has so far only been studied via Monte-Carlo simulations. We additionally consider spatial smoothing preprocessing for R-D ESPRIT-type algorithms, which has been widely used to improve the estimation performance for highly correlated signals or a small sample size. Once more, we derive performance analysis expressions for R-D ESPRIT-type algorithms and their corresponding NC versions with spatial smoothing and derive the optimal number of subarrays for spatial smoothing that minimizes the MSE for a single source. In the next part, we focus on the relatively new concept of parameter estimation via sparse signal reconstruction (SSR), in which the sparsity of the received signal power spectrum in the spatio-temporal domain is exploited. We develop three NC SSR-based parameter estimation algorithms for strictly noncircular sources and show that the benefits of exploiting the signals’ NC structure can also be achieved via sparse reconstruction. We develop two grid-based NC SSR algorithms with a low-complexity off-grid estimation procedure, and a gridless NC SSR algorithm based on atomic norm minimization. As the final contribution of this thesis, we derive the deterministic R-D NC CRB for strictly non-circular sources, which serves as a benchmark for the presented R-D NC ESPRIT-type algorithms and the NC SSR-based parameter estimation algorithms. We show for the special cases of, e.g., full coherence, a single snapshot, or a single strictly non-circular source, that the deterministic R-D NC CRB reduces to the existing deterministic R-D CRB for arbitrary signals. Therefore, no NC gain can be achieved in these cases. For the special case of two closely-spaced NC sources, we simplify the NC CRB expression and compute the NC gain for two closely-spaced NC signals. Finally, its behavior in terms of the physical parameters is studied to determine the parameter settings that provide the largest NC gain.Die hochauflösende Parameterschätzung für mehrdimensionale Signale findet Anwendung in vielen Bereichen der Signalverarbeitung in Mehrantennensystemen. Zu den Anwendungsgebieten zählen beispielsweise Radar, die Mobilkommunikation, die Kanalschätzung in multiple-input multiple-output (MIMO)-Systemen und bildgebende Verfahren in der Biosignalverarbeitung. In letzter Zeit sind eine Vielzahl von Algorithmen zur Parameterschätzung entwickelt worden, deren Schätzgenauigkeit durch eine analytische Beschreibung der Leistungsfähigkeit objektiv bewertet werden kann. Eine verbreitete Methode zur Verbesserung der Schätzgenauigkeit von Parameterschätzverfahren ist die Ausnutzung von Vorwissen bezüglich der Signalstruktur. In dieser Arbeit werden mehrdimensionale ESPRIT-Verfahren als Beispiel für Unterraum-basierte Verfahren entwickelt und analysiert, die explizit die mehrdimensionale Signalstruktur mittels Tensor-Signalverarbeitung ausnutzt und die statistischen Eigenschaften von nicht-zirkulären Signalen einbezieht. Weiterhin werden neuartige auf Signalrekonstruktion basierende Algorithmen vorgestellt, die die nicht-zirkuläre Signalstruktur bei der Rekonstruktion ausnutzen. Die vorgestellten Verfahren ermöglichen eine deutlich verbesserte Schätzgüte und verdoppeln die Anzahl der auflösbaren Signale. Die Vielzahl der Forschungsbeiträge in dieser Arbeit setzt sich aus verschiedenen Teilen zusammen. Im ersten Teil wird die analytische Beschreibung der Leistungsfähigkeit von Matrix-basierten und Tensor-basierten ESPRIT-Algorithmen betrachtet. Die Tensor-basierten Verfahren nutzen explizit die mehrdimensionale Struktur der Daten aus. Es werden für beide Algorithmenarten vereinfachte analytische Ausdrücke für den mittleren quadratischen Schätzfehler für zwei Signalquellen hergeleitet, die lediglich von den physikalischen Parametern, wie zum Beispiel die Anzahl der Antennenelemente, das Signal-zu-Rausch-Verhältnis, oder die Anzahl der Messungen, abhängen. Ein Vergleich dieser Ausdrücke ermöglicht die Berechnung einfacher Ausdrücke für den Schätzgenauigkeitsgewinn durch den forward-backward averaging (FBA)-Vorverarbeitungsschritt und die Tensor-Signalverarbeitung, die die analytische Abhängigkeit von den physikalischen Parametern enthalten. Im zweiten Teil entwickeln wir einen neuartigen general least squares (GLS)-Ansatz zur Lösung der Verschiebungs-Invarianz-Gleichung, die die Grundlage der ESPRIT-Algorithmen darstellt. Der neue Lösungsansatz berücksichtigt die statistische Beschreibung des Fehlers bei der Unterraumschätzung durch dessen Kovarianzmatrix und ermöglicht unter bestimmten Annahmen eine optimale Lösung der Invarianz-Gleichung. Mittels einer Performanzanalyse der GLS-basierten ESPRIT-Verfahren und der Vereinfachung der analytischen Ausdrücke für den Schätzfehler für eine Signalquelle und zwei zeitlich unkorrelierte Signalquellen wird gezeigt, dass die Cramer-Rao-Schranke, eine untere Schranke für die Varianz eines Schätzers, erreicht werden kann. Im nächsten Teil werden Matrix-basierte und Tensor-basierte ESPRIT-Algorithmen für nicht-zirkuläre Signalquellen vorgestellt. Unter Ausnutzung der Signalstruktur gelingt es, die Schätzgenauigkeit zu erhöhen und die doppelte Anzahl an Quellen aufzulösen. Dabei ermöglichen die vorgeschlagenen Tensor-ESPRIT-Verfahren sogar die gleichzeitige Ausnutzung der mehrdimensionalen Signalstruktur und der nicht-zirkuläre Signalstruktur. Die Leistungsfähigkeit dieser Verfahren wird erneut durch eine analytische Beschreibung objektiv bewertet und Spezialfälle für eine und zwei Quellen betrachtet. Es zeigt sich, dass für eine Quelle keinerlei Gewinn durch die nicht-zirkuläre Struktur erzielen lässt. Für zwei nicht-zirkuläre Quellen werden vereinfachte Ausdrücke für den Gewinn sowohl im Matrixfall also auch im Tensorfall hergeleitet und die Abhängigkeit der physikalischen Parameter analysiert. Sind die Signale stark korreliert oder ist die Anzahl der Messdaten sehr gering, kann der spatial smoothing-Vorverarbeitungsschritt mit den verbesserten ESPRIT-Verfahren kombiniert werden. Anhand der Performanzanalyse wird die Anzahl der Mittellungen für das spatial smoothing-Verfahren analytisch für eine Quelle bestimmt, die den Schätzfehler minimiert. Der nächste Teil befasst sich mit einer vergleichsweise neuen Klasse von Parameterschätzverfahren, die auf der Rekonstruktion überlagerter dünnbesetzter Signale basiert. Als Vorteil gegenüber den Algorithmen, die eine Signalunterraumschätzung voraussetzen, sind die Rekonstruktionsverfahren verhältnismäßig robust im Falle einer geringen Anzahl zeitlicher Messungen oder einer starken Korrelation der Signale. In diesem Teil der vorliegenden Arbeit werden drei solcher Verfahren entwickelt, die bei der Rekonstruktion zusätzlich die nicht-zirkuläre Signalstruktur ausnutzen. Dadurch kann auch für diese Art von Verfahren eine höhere Schätzgenauigkeit erreicht werden und eine höhere Anzahl an Signalen rekonstruiert werden. Im letzten Kapitel der Arbeit wird schließlich die Cramer-Rao-Schranke für mehrdimensionale nicht-zirkuläre Signale hergeleitet. Sie stellt eine untere Schranke für den Schätzfehler aller Algorithmen dar, die speziell für die Ausnutzung dieser Signalstruktur entwickelt wurden. Im Vergleich zur bekannten Cramer-Rao-Schranke für beliebige Signale, zeigt sich, dass im Fall von zeitlich kohärenten Signalen, für einen Messvektor oder für eine Quelle, beide Schranken äquivalent sind. In diesen Fällen kann daher keine Verbesserung der Schätzgüte erzielt werden. Zusätzlich wird die Cramer-Rao-Schranke für zwei benachbarte nicht-zirkuläre Signalquellen vereinfacht und der maximal mögliche Gewinn in Abhängigkeit der physikalischen Parameter analytisch ermittelt. Dieser Ausdruck gilt als Maßstab für den erzielbaren Gewinn aller Parameterschätzverfahren für zwei nicht-zirkuläre Signalquellen

Bearing estimation techniques for improved performance spread spectrum receivers

The main topic of this thesis is the use of bearing estimation techniques combined with multiple antenna elements for spread spectrum receivers. The motivation behind this work is twofold: firstly, this type of receiver structure may offer the ability to locate the position of a mobile radio in an urban environment. Secondly, these algorithms permit the application of space division multiple access (SDMA) to cellular mobile radio, which can offer large system capacity increases. The structure of these receivers may naturally be divided into two parts: signal detection and spatial filtering blocks. The signal detection problem involves locating the bearings of the multipath components which arise from the transmission of the desired user’s signal. There are a number of approaches to this problem, but here the MUSIC algorithm will be adopted. This algorithm requires an initial estimate of the number of signals impinging on the receiver, a task which can be performed by model order determination techniques. A major deficiency of MUSIC is its inability to resolve the highly–correlated and coherent multipath signals which frequently occur in a spread spectrum system. One of the simplest ways to overcome this problem is to employ spatial smoothing techniques, which trade the size of the antenna array for the ability to resolve coherent signals. The minimum description length (MDL) is one method for determining the signal model order and it can easily be extended to calculating the required degree of spatial smoothing. In this thesis, an approach to analysing the probability of correct model order determination for the MDL with spatial smoothing is presented. The performance of MUSIC, combined with spatial smoothing, is also of great significance. Two smoothing algorithms, spatial smoothing and forward–backward spatial smoothing, are analysed to compare their performance. If SDMA techniques are to be deployed in cellular systems, it is important to first estimate the performance improvements available from applying antenna array spatial filters. Initially, an additive white Gaussian noise channel is used for estimating the capacity of a perfect power–controlled code division multiple access system with SDMA techniques. Results suggest that the mean interference levels are almost halved as the antenna array size doubles, permitting large capacity increases. More realistic multipath models for urban cellular radio channels are also considered. If the transmitter gives rise to a number of point source multipath components, the bearing estimation receiver is able to capture the signal energy of each multipath. However, when a multipath component has significant angular spread, bearing estimation receivers need to combine separate directional components, at an increased cost in complexity, to obtain similar results to a matched filter. Finally, a source location algorithm for urban environments is presented, based on bearing estimation of multipath components. This algorithm requires accurate knowledge of the positions of the major multipath reflectors present in the environment. With this knowledge it is possible to determine the position of a transmitting mobile unit. Simulation results suggest that the algorithm is very sensitive to angular separation of the multipath components used for the source location technique

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks