Sparse Array Design via Fractal Geometries

Sparse sensor arrays have attracted considerable attention in various fields such as radar, array processing, ultrasound imaging and communications. In the context of correlation-based processing, such arrays enable to resolve more uncorrelated sources than physical sensors. This property of sparse arrays stems from the size of their difference coarrays, defined as the differences of element locations. Thus, the design of sparse arrays with large difference coarrays is of great interest. In addition, other array properties such as symmetry, robustness and array economy are important in different applications. Numerous studies have proposed diverse sparse geometries, focusing on certain properties while lacking others. Incorporating multiple properties into the design task leads to combinatorial problems which are generally NP-hard. For small arrays these optimization problems can be solved by brute force, however, in large scale they become intractable. In this paper, we propose a scalable systematic way to design large sparse arrays considering multiple properties. To that end, we introduce a fractal array design in which a generator array is recursively expanded according to its difference coarray. Our main result states that for an appropriate choice of the generator such fractal arrays exhibit large difference coarrays. Furthermore, we show that the fractal arrays inherit their properties from their generators. Thus, a small generator can be optimized according to desired requirements and then expanded to create a fractal array which meets the same criteria. This approach paves the way to efficient design of large arrays of hundreds or thousands of elements with specific properties.Comment: 16 pages, 9 figures, 1 Tabl

FDD Channel Estimation Via Covariance Estimation in Wideband Massive MIMO Systems

[Abstract] A method for channel estimation in wideband massive Multiple-Input Multiple-Output systems using hybrid digital analog architectures is developed. The proposed method is useful for Frequency-Division Duplex at either sub-6 GHz or millimeter wave frequency bands and takes into account the beam squint effect caused by the large bandwidth of the signals. To circumvent the estimation of large channel vectors, the posed algorithm relies on the slow time variation of the channel spatial covariance matrix, thus allowing for the utilization of very short training sequences. This is possibledue to the exploitation of the channel structure. After identifying the channel covariance matrix, the channel is estimated on the basis of the recovered information. To that end, we propose a novel method that relies on estimating the tap delays and the gains as sociated with each path. As a consequence, the proposed channel estimator achieves low computational complexity and significantly reduces the training overhead. Moreover, our numerical simulations show better performance results compared to the minimum mean-squared error solution.Xunta de Galicia; ED431G2019/01Agencia Estatal de Investigación de España; TEC2016-75067-C4-1-RAgencia Estatal de Investigación de España; RED2018-102668-TAgencia Estatal de Investigación de España; PID2019-104958RB-C4

Multi-source parameter estimation and tracking using antenna arrays

This thesis is concerned with multi-source parameter estimation and tracking using antenna arrays in wireless communications. Various multi-source parameter estimation and tracking algorithms are presented and evaluated. Firstly, a novel multiple-input multiple-output (MIMO) communication system is proposed for multi-parameter channel estimation. A manifold extender is presented for increasing the degrees of freedom (DoF). The proposed approach utilises the extended manifold vectors together with superresolution subspace type algorithms, to achieve the estimation of delay, direction of departure (DOD) and direction of arrival (DOA) of all the paths of the desired user in the presence of multiple access interference (MAI). Secondly, the MIMO system is extended to a virtual-spatiotemporal system by incorporating the temporal domain of the system towards the objective of further increasing the degrees of freedom. In this system, a multi-parameter es- timation of delay, Doppler frequency, DOD and DOA of the desired user, and a beamformer that suppresses the MAI are presented, by utilising the proposed virtual-spatiotemporal manifold extender and the superresolution subspace type algorithms. Finally, for multi-source tracking, two tracking approaches are proposed based on an arrayed Extended Kalman Filter (arrayed-EKF) and an arrayed Unscented Kalman Filter (arrayed-UKF) using two type of antenna arrays: rigid array and flexible array. If the array is rigid, the proposed approaches employ a spatiotemporal state-space model and a manifold extender to track the source parameters, while if it is flexible the array locations are also tracked simultaneously. Throughout the thesis, computer simulation studies are presented to investigate and evaluate the performance of all the proposed algorithms.Open Acces

Antenna Systems

This book offers an up-to-date and comprehensive review of modern antenna systems and their applications in the fields of contemporary wireless systems. It constitutes a useful resource of new material, including stochastic versus ray tracing wireless channel modeling for 5G and V2X applications and implantable devices. Chapters discuss modern metalens antennas in microwaves, terahertz, and optical domain. Moreover, the book presents new material on antenna arrays for 5G massive MIMO beamforming. Finally, it discusses new methods, devices, and technologies to enhance the performance of antenna systems

Array processing techniques for direction of arrival estimation, communications, and localization in vehicular and wireless sensor networks

Tese (doutorado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2018.Técnicas de processamentos de sinais para comunicações sem fio tem sido um tópico de interesse para pesquisas há mais de três décadas. De acordo com o padrão Release 9 desenvolvido pelo consorcio 3rd Generation Partnership Project (3GPP) sistemas utilizando múltiplas antenas foram adotados na quarta geração (4G) dos sistemas de comunicação sem fio, também conhecida em inglês como Long Term Evolution (LTE). Para a quinta geração (5G) dos sistemas de comunicação sem fio centenas de antenas devem ser incorporadas aos equipamentos, na arquitetura conhecida em inglês como massive multi-user Multiple Input Multiple Output (MIMO). A presença de múltiplas antenas provê benefícios como o ganho do arranjo, ganho de diversidade, ganho espacial e redução de interferência. Além disso, arranjos de antenas possibilitam a filtragem espacial e a estimação de parâmetros, ambos podem ser usados para se resolver problemas que antes não eram vistos pelo prisma de processamento de sinais. O objetivo dessa tese é superar a lacuna entre a teoria de processamento de sinais e as aplicações da mesma em problemas reais. Tradicionalmente, técnicas de processamento de sinais assumem a existência de um arranjo de antenas ideal. Portanto, para que tais técnicas sejam exploradas em aplicações reais, um conjunto robusto de métodos para interpolação do arranjo é fundamental. Estes métodos são desenvolvidos nesta tese. Além disso problemas no campo de redes de sensores e redes veiculares são tratados nesta tese utilizando-se uma perspectiva de processamento de sinais. Nessa tesa métodos inovadores de interpolação de arranjos são apresentados e sua performance é testada utilizando-se cenários reais. Conceitos de processamento de sinais são implementados no contexto de redes de sensores. Esses conceitos possibilitam um nível de sincronização suficiente para a aplicação de sistemas de múltiplas antenas distribuídos, o que resulta em uma rede com maior vida útil e melhor performance. Métodos de processamento de sinais em arranjos são propostos para resolver o problema de localização baseada em sinais de rádio em redes veiculares, com aplicações em segurança de estradas e proteção de pedestres. Esta tese foi escrita em língua inglesa, um sumário em língua portuguesa é apresentado ao final da mesma.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES).Array signal processing in wireless communication has been a topic of interest in research for over three decades. In the fourth generation (4G) of the wireless communication systems, also known as Long Term Evolution (LTE), multi antenna systems have been adopted according to the Release 9 of the 3rd Generation Partnership Project (3GPP). For the fifth generation (5G) of the wireless communication systems, hundreds of antennas should be incorporated to the devices in a massive multi-user Multiple Input Multiple Output (MIMO) architecture. The presence of multiple antennas provides array gain, diversity gain, spatial gain, and interference reduction. Furthermore, arrays enable spatial filtering and parameter estimation, which can be used to help solve problems that could not previously be addressed from a signal processing perspective. The aim of this thesis is to bridge some gaps between signal processing theory and real world applications. Array processing techniques traditionally assume an ideal array. Therefore, in order to exploit such techniques, a robust set of methods for array interpolation are fundamental and are developed in this work. Problems in the field of wireless sensor networks and vehicular networks are also addressed from an array signal processing perspective. In this dissertation, novel methods for array interpolation are presented and their performance in real world scenarios is evaluated. Signal processing concepts are implemented in the context of a wireless sensor network. These concepts provide a level of synchronization sufficient for distributed multi antenna communication to be applied, resulting in improved lifetime and improved overall network behaviour. Array signal processing methods are proposed to solve the problem of radio based localization in vehicular network scenarios with applications in road safety and pedestrian protection

Modelling, Dimensioning and Optimization of 5G Communication Networks, Resources and Services

This reprint aims to collect state-of-the-art research contributions that address challenges in the emerging 5G networks design, dimensioning and optimization. Designing, dimensioning and optimization of communication networks resources and services have been an inseparable part of telecom network development. The latter must convey a large volume of traffic, providing service to traffic streams with highly differentiated requirements in terms of bit-rate and service time, required quality of service and quality of experience parameters. Such a communication infrastructure presents many important challenges, such as the study of necessary multi-layer cooperation, new protocols, performance evaluation of different network parts, low layer network design, network management and security issues, and new technologies in general, which will be discussed in this book

Efficient algorithms and data structures for compressive sensing

Wegen der kontinuierlich anwachsenden Anzahl von Sensoren, und den stetig wachsenden Datenmengen, die jene produzieren, stößt die konventielle Art Signale zu verarbeiten, beruhend auf dem Nyquist-Kriterium, auf immer mehr Hindernisse und Probleme. Die kürzlich entwickelte Theorie des Compressive Sensing (CS) formuliert das Versprechen einige dieser Hindernisse zu beseitigen, indem hier allgemeinere Signalaufnahme und -rekonstruktionsverfahren zum Einsatz kommen können. Dies erlaubt, dass hierbei einzelne Abtastwerte komplexer strukturierte Informationen über das Signal enthalten können als dies bei konventiellem Nyquistsampling der Fall ist. Gleichzeitig verändert sich die Signalrekonstruktion notwendigerweise zu einem nicht-linearen Vorgang und ebenso müssen viele Hardwarekonzepte für praktische Anwendungen neu überdacht werden. Das heißt, dass man zwischen der Menge an Information, die man über Signale gewinnen kann, und dem Aufwand für das Design und Betreiben eines Signalverarbeitungssystems abwägen kann und muss. Die hier vorgestellte Arbeit trägt dazu bei, dass bei diesem Abwägen CS mehr begünstigt werden kann, indem neue Resultate vorgestellt werden, die es erlauben, dass CS einfacher in der Praxis Anwendung finden kann, wobei die zu erwartende Leistungsfähigkeit des Systems theoretisch fundiert ist. Beispielsweise spielt das Konzept der Sparsity eine zentrale Rolle, weshalb diese Arbeit eine Methode präsentiert, womit der Grad der Sparsity eines Vektors mittels einer einzelnen Beobachtung geschätzt werden kann. Wir zeigen auf, dass dieser Ansatz für Sparsity Order Estimation zu einem niedrigeren Rekonstruktionsfehler führt, wenn man diesen mit einer Rekonstruktion vergleicht, welcher die Sparsity des Vektors unbekannt ist. Um die Modellierung von Signalen und deren Rekonstruktion effizienter zu gestalten, stellen wir das Konzept von der matrixfreien Darstellung linearer Operatoren vor. Für die einfachere Anwendung dieser Darstellung präsentieren wir eine freie Softwarearchitektur und demonstrieren deren Vorzüge, wenn sie für die Rekonstruktion in einem CS-System genutzt wird. Konkret wird der Nutzen dieser Bibliothek, einerseits für das Ermitteln von Defektpositionen in Prüfkörpern mittels Ultraschall, und andererseits für das Schätzen von Streuern in einem Funkkanal aus Ultrabreitbanddaten, demonstriert. Darüber hinaus stellen wir für die Verarbeitung der Ultraschalldaten eine Rekonstruktionspipeline vor, welche Daten verarbeitet, die im Frequenzbereich Unterabtastung erfahren haben. Wir beschreiben effiziente Algorithmen, die bei der Modellierung und der Rekonstruktion zum Einsatz kommen und wir leiten asymptotische Resultate für die benötigte Anzahl von Messwerten, sowie die zu erwartenden Lokalisierungsgenauigkeiten der Defekte her. Wir zeigen auf, dass das vorgestellte System starke Kompression zulässt, ohne die Bildgebung und Defektlokalisierung maßgeblich zu beeinträchtigen. Für die Lokalisierung von Streuern mittels Ultrabreitbandradaren stellen wir ein CS-System vor, welches auf einem Random Demodulators basiert. Im Vergleich zu existierenden Messverfahren ist die hieraus resultierende Schätzung der Kanalimpulsantwort robuster gegen die Effekte von zeitvarianten Funkkanälen. Um den inhärenten Modellfehler, den gitterbasiertes CS begehen muss, zu beseitigen, zeigen wir auf wie Atomic Norm Minimierung es erlaubt ohne die Einschränkung auf ein endliches und diskretes Gitter R-dimensionale spektrale Komponenten aus komprimierten Beobachtungen zu schätzen. Hierzu leiten wir eine R-dimensionale Variante des ADMM her, welcher dazu in der Lage ist die Signalkovarianz in diesem allgemeinen Szenario zu schätzen. Weiterhin zeigen wir, wie dieser Ansatz zur Richtungsschätzung mit realistischen Antennenarraygeometrien genutzt werden kann. In diesem Zusammenhang präsentieren wir auch eine Methode, welche mittels Stochastic gradient descent Messmatrizen ermitteln kann, die sich gut für Parameterschätzung eignen. Die hieraus resultierenden Kompressionsverfahren haben die Eigenschaft, dass die Schätzgenauigkeit über den gesamten Parameterraum ein möglichst uniformes Verhalten zeigt. Zuletzt zeigen wir auf, dass die Kombination des ADMM und des Stochastic Gradient descent das Design eines CS-Systems ermöglicht, welches in diesem gitterfreien Szenario wünschenswerte Eigenschaften hat.Along with the ever increasing number of sensors, which are also generating rapidly growing amounts of data, the traditional paradigm of sampling adhering the Nyquist criterion is facing an equally increasing number of obstacles. The rather recent theory of Compressive Sensing (CS) promises to alleviate some of these drawbacks by proposing to generalize the sampling and reconstruction schemes such that the acquired samples can contain more complex information about the signal than Nyquist samples. The proposed measurement process is more complex and the reconstruction algorithms necessarily need to be nonlinear. Additionally, the hardware design process needs to be revisited as well in order to account for this new acquisition scheme. Hence, one can identify a trade-off between information that is contained in individual samples of a signal and effort during development and operation of the sensing system. This thesis addresses the necessary steps to shift the mentioned trade-off more to the favor of CS. We do so by providing new results that make CS easier to deploy in practice while also maintaining the performance indicated by theoretical results. The sparsity order of a signal plays a central role in any CS system. Hence, we present a method to estimate this crucial quantity prior to recovery from a single snapshot. As we show, this proposed Sparsity Order Estimation method allows to improve the reconstruction error compared to an unguided reconstruction. During the development of the theory we notice that the matrix-free view on the involved linear mappings offers a lot of possibilities to render the reconstruction and modeling stage much more efficient. Hence, we present an open source software architecture to construct these matrix-free representations and showcase its ease of use and performance when used for sparse recovery to detect defects from ultrasound data as well as estimating scatterers in a radio channel using ultra-wideband impulse responses. For the former of these two applications, we present a complete reconstruction pipeline when the ultrasound data is compressed by means of sub-sampling in the frequency domain. Here, we present the algorithms for the forward model, the reconstruction stage and we give asymptotic bounds for the number of measurements and the expected reconstruction error. We show that our proposed system allows significant compression levels without substantially deteriorating the imaging quality. For the second application, we develop a sampling scheme to acquire the channel Impulse Response (IR) based on a Random Demodulator that allows to capture enough information in the recorded samples to reliably estimate the IR when exploiting sparsity. Compared to the state of the art, this in turn allows to improve the robustness to the effects of time-variant radar channels while also outperforming state of the art methods based on Nyquist sampling in terms of reconstruction error. In order to circumvent the inherent model mismatch of early grid-based compressive sensing theory, we make use of the Atomic Norm Minimization framework and show how it can be used for the estimation of the signal covariance with R-dimensional parameters from multiple compressive snapshots. To this end, we derive a variant of the ADMM that can estimate this covariance in a very general setting and we show how to use this for direction finding with realistic antenna geometries. In this context we also present a method based on a Stochastic gradient descent iteration scheme to find compression schemes that are well suited for parameter estimation, since the resulting sub-sampling has a uniform effect on the whole parameter space. Finally, we show numerically that the combination of these two approaches yields a well performing grid-free CS pipeline

Sparse Array Signal Processing: New Array Geometries, Parameter Estimation, and Theoretical Analysis

Array signal processing focuses on an array of sensors receiving the incoming waveforms in the environment, from which source information, such as directions of arrival (DOA), signal power, amplitude, polarization, and velocity, can be estimated. This topic finds ubiquitous applications in radar, astronomy, tomography, imaging, and communications. In these applications, sparse arrays have recently attracted considerable attention, since they are capable of resolving O(N2) uncorrelated source directions with N physical sensors. This is unlike the uniform linear arrays (ULA), which identify at most N-1 uncorrelated sources with N sensors. These sparse arrays include minimum redundancy arrays (MRA), nested arrays, and coprime arrays. All these arrays have an O(N2)-long central ULA segment in the difference coarray, which is defined as the set of differences between sensor locations. This O(N2) property makes it possible to resolve O(N2) uncorrelated sources, using only N physical sensors. The main contribution of this thesis is to provide a new direction for array geometry and performance analysis of sparse arrays in the presence of nonidealities. The first part of this thesis focuses on designing novel array geometries that are robust to effects of mutual coupling. It is known that, mutual coupling between sensors has an adverse effect on the estimation of DOA. While there are methods to counteract this through appropriate modeling and calibration, they are usually computationally expensive, and sensitive to model mismatch. On the other hand, sparse arrays, such as MRA, nested arrays, and coprime arrays, have reduced mutual coupling compared to ULA, but all of these have their own disadvantages. This thesis introduces a new array called the super nested array, which has many of the good properties of the nested array, and at the same time achieves reduced mutual coupling. Many theoretical properties are proved and simulations are included to demonstrate the superior performance of super nested arrays in the presence of mutual coupling. Two-dimensional planar sparse arrays with large difference coarrays have also been known for a long time. These include billboard arrays, open box arrays (OBA), and 2D nested arrays. However, all of them have considerable mutual coupling. This thesis proposes new planar sparse arrays with the same large difference coarrays as the OBA, but with reduced mutual coupling. The new arrays include half open box arrays (HOBA), half open box arrays with two layers (HOBA-2), and hourglass arrays. Among these, simulations show that hourglass arrays have the best estimation performance in presence of mutual coupling. The second part of this thesis analyzes the performance of sparse arrays from a theoretical perspective. We first study the Cramér-Rao bound (CRB) for sparse arrays, which poses a lower bound on the variances of unbiased DOA estimators. While there exist landmark papers on the study of the CRB in the context of array processing, the closed-form expressions available in the literature are not applicable in the context of sparse arrays for which the number of identifiable sources exceeds the number of sensors. This thesis derives a new expression for the CRB to fill this gap. Based on the proposed CRB expression, it is possible to prove the previously known experimental observation that, when there are more sources than sensors, the CRB stagnates to a constant value as the SNR tends to infinity. It is also possible to precisely specify the relation between the number of sensors and the number of uncorrelated sources such that these sources could be resolved. Recently, it has been shown that correlation subspaces, which reveal the structure of the covariance matrix, help to improve some existing DOA estimators. However, the bases, the dimension, and other theoretical properties of correlation subspaces remain to be investigated. This thesis proposes generalized correlation subspaces in one and multiple dimensions. This leads to new insights into correlation subspaces and DOA estimation with prior knowledge. First, it is shown that the bases and the dimension of correlation subspaces are fundamentally related to difference coarrays, which were previously found to be important in the study of sparse arrays. Furthermore, generalized correlation subspaces can handle certain forms of prior knowledge about source directions. These results allow one to derive a broad class of DOA estimators with improved performance. It is empirically known that the coarray structure is susceptible to sensor failures, and the reliability of sparse arrays remains a significant but challenging topic for investigation. This thesis advances a general theory for quantifying such robustness, by studying the effect of sensor failure on the difference coarray. We first present the (k-)essentialness property, which characterizes the combinations of the faulty sensors that shrink the difference coarray. Based on this, the notion of (k-)fragility is proposed to quantify the reliability of sparse arrays with faulty sensors, along with comprehensive studies of their properties. These novel concepts provide quite a few insights into the interplay between the array geometry and its robustness. For instance, for the same number of sensors, it can be proved that ULA is more robust than the coprime array, and the coprime array is more robust than the nested array. Rigorous development of these ideas leads to expressions for the probability of coarray failure, as a function of the probability of sensor failure. The thesis concludes with some remarks on future directions and open problems.</p