An effective localization method for mixed far-field and near-field strictly non-circular sources

In this paper, an effective direction-of-arrival (DOA) and range estimations method for mixed far-field and near-field non-circular sources is proposed based on a large centrosymmetric uniform linear array (ULA). By exploiting the non-circularity of the sources, an extended signal is generated by concatenating the received array data and its conjugate counterparts. Then the DOAs of far-field signals are estimated based on the extended covariance matrix with the traditional MUSIC algorithm. After eliminating the far-field components from the extended signal subspace, the extended covariance matrix of the near-field signals is obtained. Thus a near-field estimator is constructed based on symmetric property of the extended array manifold where the generalized ESPRIT method is adopted to estimate the DOAs of near-field sources. Finally, the range estimator is derived using the DOA estimations of near-field sources. Simulation results are provided to validate that the proposed method has achieved a better performance than existing ones and is quite suitable for massive MIMO (multiple-input multiple-out) system

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

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

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

Estudo de formas de onda e conceção de algoritmos para operação conjunta de sistemas de comunicação e radar

The focus of this thesis is the processing of signals and design of algorithms that can be used to enable radar functions in communications systems. Orthogonal frequency division multiplexing (OFDM) is a popular multicarrier modulation waveform in communication systems. As a wideband signal, OFDM improves resolution and enables spectral efficiency in radar systems, while also improving detection performance thanks to its inherent frequency diversity. This thesis aims to use multicarrier waveforms for radar systems, to enable the simultaneous operation of radar and communication functions on the same device. The thesis is divided in two parts. The first part, studies the adaptation and application of other multicarrier waveforms to radar functions. At the present time many studies have been carried out to jointly use the OFDM signal for communication and radar functions, but other waveforms have shown to be possible candidates for communication applications. Therefore, studies on the evaluation of the application of these same signals to radar functions are necessary. In this thesis, to demonstrate that other multicarrier waveforms can overcome the OFDM waveform in radar/communication (RadCom) systems, we propose the adaptation of the filter bank multicarrier (FBMC), generalized frequency division multiplexing (GFDM) and universal filtering multicarrier (UFMC) waveforms for radar functions. These alternative waveforms were compared performance-wise regarding achievable target parameter estimation performance, amount of residual background noise in the radar image, impact of intersystem interference and flexibility of parameterization. In the second part of the thesis, signal processing techniques are explored to solve some of the limitations of the use of multicarrier waveforms for RadCom systems. Radar systems based on OFDM are promising candidates for future intelligent transport networks. Exploring the dual functionality enabled by OFDM, we presents cooperative methods for high-resolution delay-Doppler and direction-of-arrival estimation. High-resolution parameter estimation is an important requirement for automotive radar systems, especially in multi-target scenarios that require reliable target separation performance. By exploring the cooperation between vehicles, the studies presented in this thesis also enable the distributed tracking of targets. The result is a highly accurate multi-target tracking across the entire cooperative vehicle network, leading to improvements in transport reliability and safety.O foco desta tese é o processamento de sinais e desenvolvimento de algoritmos que podem ser utilizados para a habilitar a função de radar nos sistemas de comunicação. OFDM (Orthogonal Frequency Division Multiplexing) é uma forma de onda com modulação multi-portadora, popular em sistemas de comunicação. Para sistemas de radar, O OFDM melhora a resolução e fornece eficiência espectral, além disso sua diversidade de frequências melhora o desempenho na detecção do radar. Essa tese tem como objetivo utilizar formas de onda multi-portadoras para sistemas de radar, possibilitando a operação simultânea de funções de radar e de comunicação num mesmo dispositivo. A tese esta dividida em duas partes. Na primeira parte da tese são realizados estudos da adaptabilidade de outras formas de onda multi-portadora para funções de radar. Nos dias atuais, muitos estudos sobre o uso do sinal OFDM para funções de comunicação e radar vêm sendo realizados, no entanto, outras formas de onda mostram-se possíveis candidatas a aplicações em sistemas de comunicação, e assim, avaliações para funções de sistema de radar se tornam necessárias. Nesta tese, com a intenção de demonstrar que formas de onda multi-portadoras alternativas podem superar o OFDM nos sistemas de Radar/comunicação (RadCom), propomos a adaptação das seguintes formas de onda: FBMC (Filter Bank Multicarrier); GFDM (Generalized Frequency Division Multiplexing); e UFMC (Universal Filtering Multicarrier) para funções de radar. Também produzimos uma análise de desempenho dessas formas de onda sobre o aspecto da estimativa de parâmetros-alvo, ruído de fundo, interferência entre sistemas e parametrização do sistema. Na segunda parte da tese serão explorados técnicas de processamento de sinal de forma a solucionar algumas das limitações do uso de formas de ondas multi-portadora para sistemas RadCom. Os sistemas de radar baseados no OFDM são candidatos promissores para futuras redes de transporte inteligentes, porque combinam funções de estimativa de alvo com funções de rede de comunicação em um único sistema. Explorando a funcionalidade dupla habilitada pelo OFDM, nesta tese, apresentamos métodos cooperativos de alta resolução para estimar o posição, velocidade e direção dos alvos. A estimativa de parâmetros de alta resolução é um requisito importante para sistemas de radar automotivo, especialmente em cenários de múltiplos alvos que exigem melhor desempenho de separação de alvos. Ao explorar a cooperação entre veículos, os estudos apresentados nesta tese também permitem o rastreamento distribuído de alvos. O resultado é um rastreamento multi-alvo altamente preciso em toda a rede de veículos cooperativos, levando a melhorias na confiabilidade e segurança do transporte.Programa Doutoral em Telecomunicaçõe

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