77 research outputs found

    Cram\'er-Rao Bounds for Holographic Positioning

    Full text link
    Multiple antennas arrays play a key role in wireless networks for communications but also for localization and sensing applications. The use of large antenna arrays at high carrier frequencies (in the mmWave range) pushes towards a propagation regime in which the wavefront is no longer plane but spherical. This allows to infer the position and orientation of a transmitting source from the received signal without the need of using multiple anchor nodes, located in known positions. To understand the fundamental limits of large antenna arrays for localization, this paper combines wave propagation theory with estimation theory, and computes the Cram\'er-Rao Bound (CRB) for the estimation of the source position on the basis of the three Cartesian components of the electric field, observed over a rectangular surface area. The problem is referred to as holographic positioning and is formulated by taking into account the radiation angular pattern of the transmitting source, which is typically ignored in standard signal processing models. We assume that the source is a Hertzian dipole, and address the holographic positioning problem in both cases, that is, with and without a priori knowledge of its orientation. To simplify the analysis and gain further insights, we also consider the case in which the dipole is located on the line perpendicular to the surface center. Numerical and asymptotic results are given to quantify the CRBs, and to quantify the effect of various system parameters on the ultimate estimation accuracy. It turns out that surfaces of practical size may guarantee a centimeter-level accuracy in the mmWave bands.Comment: 15 pages, 9 figures, IEEE Transactions on Signal Processin

    Direction-finding arrays of directional sensors for randomly located sources

    Get PDF
    The problem of directional sensor placement and orientation is considered when statistical information about the source direction of arrival is available. We focus on two-sensor arrays and form a cost function based on the Cramer-Rao bound that depends on the probability distribution of the coplanar source direction. Proper positioning and orientation of the sensors enable the two-sensor array to have an accuracy comparable to that of a three-or four-sensor uniform circular array

    Applications of compressive sensing to direction of arrival estimation

    Get PDF
    Die SchĂ€tzung der Einfallsrichtungen (Directions of Arrival/DOA) mehrerer ebener Wellenfronten mit Hilfe eines Antennen-Arrays ist eine der prominentesten Fragestellungen im Gebiet der Array-Signalverarbeitung. Das nach wie vor starke Forschungsinteresse in dieser Richtung konzentriert sich vor allem auf die Reduktion des Hardware-Aufwands, im Sinne der KomplexitĂ€t und des Energieverbrauchs der EmpfĂ€nger, bei einem vorgegebenen Grad an Genauigkeit und Robustheit gegen Mehrwegeausbreitung. Diese Dissertation beschĂ€ftigt sich mit der Anwendung von Compressive Sensing (CS) auf das Gebiet der DOA-SchĂ€tzung mit dem Ziel, hiermit die KomplexitĂ€t der EmpfĂ€ngerhardware zu reduzieren und gleichzeitig eine hohe Richtungsauflösung und Robustheit zu erreichen. CS wurde bereits auf das DOA-Problem angewandt unter der Ausnutzung der Tatsache, dass eine Superposition ebener Wellenfronten mit einer winkelabhĂ€ngigen Leistungsdichte korrespondiert, die ĂŒber den Winkel betrachtet sparse ist. Basierend auf der Idee wurden CS-basierte Algorithmen zur DOA-SchĂ€tzung vorgeschlagen, die sich durch eine geringe RechenkomplexitĂ€t, Robustheit gegenĂŒber Quellenkorrelation und FlexibilitĂ€t bezĂŒglich der Wahl der Array-Geometrie auszeichnen. Die Anwendung von CS fĂŒhrt darĂŒber hinaus zu einer erheblichen Reduktion der Hardware-KomplexitĂ€t, da weniger EmpfangskanĂ€le benötigt werden und eine geringere Datenmenge zu verarbeiten und zu speichern ist, ohne dabei wesentliche Informationen zu verlieren. Im ersten Teil der Arbeit wird das Problem des Modellfehlers bei der CS-basierten DOA-SchĂ€tzung mit gitterbehafteten Verfahren untersucht. Ein hĂ€ufig verwendeter Ansatz um das CS-Framework auf das DOA-Problem anzuwenden ist es, den kontinuierlichen Winkel-Parameter zu diskreditieren und damit ein Dictionary endlicher GrĂ¶ĂŸe zu bilden. Da die tatsĂ€chlichen Winkel fast sicher nicht auf diesem Gitter liegen werden, entsteht dabei ein unvermeidlicher Modellfehler, der sich auf die SchĂ€tzalgorithmen auswirkt. In der Arbeit wird ein analytischer Ansatz gewĂ€hlt, um den Effekt der Gitterfehler auf die rekonstruierten Spektra zu untersuchen. Es wird gezeigt, dass sich die Messung einer Quelle aus beliebiger Richtung sehr gut durch die erwarteten Antworten ihrer beiden Nachbarn auf dem Gitter annĂ€hern lĂ€sst. Darauf basierend wird ein einfaches und effizientes Verfahren vorgeschlagen, den Gitterversatz zu schĂ€tzen. Dieser Ansatz ist anwendbar auf einzelne Quellen oder mehrere, rĂ€umlich gut separierte Quellen. FĂŒr den Fall mehrerer dicht benachbarter Quellen wird ein numerischer Ansatz zur gemeinsamen SchĂ€tzung des Gitterversatzes diskutiert. Im zweiten Teil der Arbeit untersuchen wir das Design kompressiver Antennenarrays fĂŒr die DOA-SchĂ€tzung. Die Kompression im Sinne von Linearkombinationen der Antennensignale, erlaubt es, Arrays mit großer Apertur zu entwerfen, die nur wenige EmpfangskanĂ€le benötigen und sich konfigurieren lassen. In der Arbeit wird eine einfache Empfangsarchitektur vorgeschlagen und ein allgemeines Systemmodell diskutiert, welches verschiedene Optionen der tatsĂ€chlichen Hardware-Realisierung dieser Linearkombinationen zulĂ€sst. Im Anschluss wird das Design der Gewichte des analogen Kombinations-Netzwerks untersucht. Numerische Simulationen zeigen die Überlegenheit der vorgeschlagenen kompressiven Antennen-Arrays im Vergleich mit dĂŒnn besetzten Arrays der gleichen KomplexitĂ€t sowie kompressiver Arrays mit zufĂ€llig gewĂ€hlten Gewichten. Schließlich werden zwei weitere Anwendungen der vorgeschlagenen AnsĂ€tze diskutiert: CS-basierte VerzögerungsschĂ€tzung und kompressives Channel Sounding. Es wird demonstriert, dass die in beiden Gebieten durch die Anwendung der vorgeschlagenen AnsĂ€tze erhebliche Verbesserungen erzielt werden können.Direction of Arrival (DOA) estimation of plane waves impinging on an array of sensors is one of the most important tasks in array signal processing, which have attracted tremendous research interest over the past several decades. The estimated DOAs are used in various applications like localization of transmitting sources, massive MIMO and 5G Networks, tracking and surveillance in radar, and many others. The major objective in DOA estimation is to develop approaches that allow to reduce the hardware complexity in terms of receiver costs and power consumption, while providing a desired level of estimation accuracy and robustness in the presence of multiple sources and/or multiple paths. Compressive sensing (CS) is a novel sampling methodology merging signal acquisition and compression. It allows for sampling a signal with a rate below the conventional Nyquist bound. In essence, it has been shown that signals can be acquired at sub-Nyquist sampling rates without loss of information provided they possess a sufficiently sparse representation in some domain and that the measurement strategy is suitably chosen. CS has been recently applied to DOA estimation, leveraging the fact that a superposition of planar wavefronts corresponds to a sparse angular power spectrum. This dissertation investigates the application of compressive sensing to the DOA estimation problem with the goal to reduce the hardware complexity and/or achieve a high resolution and a high level of robustness. Many CS-based DOA estimation algorithms have been proposed in recent years showing tremendous advantages with respect to the complexity of the numerical solution while being insensitive to source correlation and allowing arbitrary array geometries. Moreover, CS has also been suggested to be applied in the spatial domain with the main goal to reduce the complexity of the measurement process by using fewer RF chains and storing less measured data without the loss of any significant information. In the first part of the work we investigate the model mismatch problem for CS based DOA estimation algorithms off the grid. To apply the CS framework a very common approach is to construct a finite dictionary by sampling the angular domain with a predefined sampling grid. Therefore, the target locations are almost surely not located exactly on a subset of these grid points. This leads to a model mismatch which deteriorates the performance of the estimators. We take an analytical approach to investigate the effect of such grid offsets on the recovered spectra showing that each off-grid source can be well approximated by the two neighboring points on the grid. We propose a simple and efficient scheme to estimate the grid offset for a single source or multiple well-separated sources. We also discuss a numerical procedure for the joint estimation of the grid offsets of closer sources. In the second part of the thesis we study the design of compressive antenna arrays for DOA estimation that aim to provide a larger aperture with a reduced hardware complexity and allowing reconfigurability, by a linear combination of the antenna outputs to a lower number of receiver channels. We present a basic receiver architecture of such a compressive array and introduce a generic system model that includes different options for the hardware implementation. We then discuss the design of the analog combining network that performs the receiver channel reduction. Our numerical simulations demonstrate the superiority of the proposed optimized compressive arrays compared to the sparse arrays of the same complexity and to compressive arrays with randomly chosen combining kernels. Finally, we consider two other applications of the sparse recovery and compressive arrays. The first application is CS based time delay estimation and the other one is compressive channel sounding. We show that the proposed approaches for sparse recovery off the grid and compressive arrays show significant improvements in the considered applications compared to conventional methods

    Cooperative Position and Orientation Estimation with Multi-Mode Antennas

    Get PDF
    Robotic multi-agent systems are envisioned for planetary exploration and terrestrial applications. Autonomous operation of robots requires estimations of their positions and orientations, which are obtained from the direction-of-arrival (DoA) and the time-of-arrival (ToA) of radio signals exchanged among the agents. In this thesis, we estimate the signal DoA and ToA using a multi-mode antenna (MMA). An MMA is a single antenna element, where multiple orthogonal current modes are excited by different antenna ports. We provide a first study on the use of MMAs for cooperative position and orientation estimation, specifically exploring their DoA estimation capabilities. Assuming the agents of a cooperative network are equipped with MMAs, lower bounds on the achievable position and orientation accuracy are derived. We realize a gap between the theoretical lower bounds and real-world performance of a cooperative radio localization system, which is caused by imperfect antenna and transceiver calibration. Consequentially, we theoretically analyze in-situ antenna calibration, introduce an algorithm for the calibration of arbitrary multiport antennas and show its effectiveness by simulation. To also improve calibration during operation, we propose cooperative simultaneous localization and calibration (SLAC). We show that cooperative SLAC is able to estimate antenna responses and ranging biases of the agents together with their positions and orientations, leading to considerably better position and orientation accuracy. Finally, we validate the results from theory and simulation by experiments with robotic rovers equipped with software-defined radios (SDRs). In conclusion, we show that DoA estimation with an MMA is feasible, and accuracy can be improved by in-situ calibration and SLAC

    Near-Field Positioning and Attitude Sensing Based on Electromagnetic Propagation Modeling

    Full text link
    Positioning and sensing over wireless networks are imperative for many emerging applications. However, traditional wireless channel models cannot be used for sensing the attitude of the user equipment (UE), since they over-simplify the UE as a point target. In this paper, a comprehensive electromagnetic propagation modeling (EPM) based on electromagnetic theory is developed to precisely model the near-field channel. For the noise-free case, the EPM model establishes the non-linear functional dependence of observed signals on both the position and attitude of the UE. To address the difficulty in the non-linear coupling, we first propose to divide the distance domain into three regions, separated by the defined Phase ambiguity distance and Spacing constraint distance. Then, for each region, we obtain the closed-form solutions for joint position and attitude estimation with low complexity. Next, to investigate the impact of random noise on the joint estimation performance, the Ziv-Zakai bound (ZZB) is derived to yield useful insights. The expected Cram\'er-Rao bound (ECRB) is further provided to obtain the simplified closed-form expressions for the performance lower bounds. Our numerical results demonstrate that the derived ZZB can provide accurate predictions of the performance of estimators in all signal-to-noise ratio (SNR) regimes. More importantly, we achieve the millimeter-level accuracy in position estimation and attain the 0.1-level accuracy in attitude estimation.Comment: 16 pages, 9 figures. Submitted to JSAC - Special Issue on Positioning and Sensing Over Wireless Network

    A Survey on Fundamental Limits of Integrated Sensing and Communication

    Get PDF
    The integrated sensing and communication (ISAC), in which the sensing and communication share the same frequency band and hardware, has emerged as a key technology in future wireless systems due to two main reasons. First, many important application scenarios in fifth generation (5G) and beyond, such as autonomous vehicles, Wi-Fi sensing and extended reality, requires both high-performance sensing and wireless communications. Second, with millimeter wave and massive multiple-input multiple-output (MIMO) technologies widely employed in 5G and beyond, the future communication signals tend to have high-resolution in both time and angular domain, opening up the possibility for ISAC. As such, ISAC has attracted tremendous research interest and attentions in both academia and industry. Early works on ISAC have been focused on the design, analysis and optimization of practical ISAC technologies for various ISAC systems. While this line of works are necessary, it is equally important to study the fundamental limits of ISAC in order to understand the gap between the current state-of-the-art technologies and the performance limits, and provide useful insights and guidance for the development of better ISAC technologies that can approach the performance limits. In this paper, we aim to provide a comprehensive survey for the current research progress on the fundamental limits of ISAC. Particularly, we first propose a systematic classification method for both traditional radio sensing (such as radar sensing and wireless localization) and ISAC so that they can be naturally incorporated into a unified framework. Then we summarize the major performance metrics and bounds used in sensing, communications and ISAC, respectively. After that, we present the current research progresses on fundamental limits of each class of the traditional sensing and ISAC systems. Finally, the open problems and future research directions are discussed

    Parametric array calibration

    Get PDF
    The subject of this thesis is the development of parametric methods for the calibration of array shape errors. Two physical scenarios are considered, the online calibration (self-calibration) using far-field sources and the offline calibration using near-field sources. The maximum likelihood (ML) estimators are employed to estimate the errors. However, the well-known computational complexity in objective function optimization for the ML estimators demands effective and efficient optimization algorithms. A novel space-alternating generalized expectation-maximization (SAGE)-based algorithm is developed to optimize the objective function of the conditional maximum likelihood (CML) estimator for the far-field online calibration. Through data augmentation, joint direction of arrival (DOA) estimation and array calibration can be carried out by a computationally simple search procedure. Numerical experiments show that the proposed method outperforms the existing method for closely located signal sources and is robust to large shape errors. In addition, the accuracy of the proposed procedure attains the CramÂŽer-Rao bound (CRB). A global optimization algorithm, particle swarm optimization (PSO) is employed to optimize the objective function of the unconditional maximum likelihood (UML) estimator for the farfield online calibration and the near-field offline calibration. A new technique, decaying diagonal loading (DDL) is proposed to enhance the performance of PSO at high signal-to-noise ratio (SNR) by dynamically lowering it, based on the counter-intuitive observation that the global optimum of the UML objective function is more prominent at lower SNR. Numerical simulations demonstrate that the UML estimator optimized by PSO with DDL is optimally accurate, robust to large shape errors, and free of the initialization problem. In addition, the DDL technique is applicable to a wide range of array processing problems where the UML estimator is employed and can be coupled with different global optimization algorithms

    Space-Time Parameter Estimation in Radar Array Processing

    Get PDF
    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
    • 

    corecore