Tensor Decomposition Based Beamspace ESPRIT for Millimeter Wave MIMO Channel Estimation

We propose a search-free beamspace tensor-ESPRIT algorithm for millimeter wave MIMO channel estimation. It is a multidimensional generalization of beamspace-ESPRIT method by exploiting the multiple invariance structure of the measurements. Geometry-based channel model is considered to contain the channel sparsity feature. In our framework, an alternating least squares problem is solved for low rank tensor decomposition and the multidimensional parameters are automatically associated. The performance of the proposed algorithm is evaluated by considering different transformation schemes

Likelihood Analysis of Power Spectra and Generalized Moment Problems

We develop an approach to spectral estimation that has been advocated by Ferrante, Masiero and Pavon and, in the context of the scalar-valued covariance extension problem, by Enqvist and Karlsson. The aim is to determine the power spectrum that is consistent with given moments and minimizes the relative entropy between the probability law of the underlying Gaussian stochastic process to that of a prior. The approach is analogous to the framework of earlier work by Byrnes, Georgiou and Lindquist and can also be viewed as a generalization of the classical work by Burg and Jaynes on the maximum entropy method. In the present paper we present a new fast algorithm in the general case (i.e., for general Gaussian priors) and show that for priors with a specific structure the solution can be given in closed form.Comment: 17 pages, 4 figure

Beamforming through regularized inverse problems in ultrasound medical imaging

Beamforming (BF) in ultrasound (US) imaging has significant impact on the quality of the final image, controlling its resolution and contrast. Despite its low spatial resolution and contrast, delay-and-sum (DAS) is still extensively used nowadays in clinical applications, due to its real-time capabilities. The most common alternatives are minimum variance (MV) method and its variants, which overcome the drawbacks of DAS, at the cost of higher computational complexity that limits its utilization in real-time applications. In this paper, we propose to perform BF in US imaging through a regularized inverse problem based on a linear model relating the reflected echoes to the signal to be recovered. Our approach presents two major advantages: 1) its flexibility in the choice of statistical assumptions on the signal to be beamformed (Laplacian and Gaussian statistics are tested herein) and 2) its robustness to a reduced number of pulse emissions. The proposed framework is flexible and allows for choosing the right tradeoff between noise suppression and sharpness of the resulted image. We illustrate the performance of our approach on both simulated and experimental data, with in vivo examples of carotid and thyroid. Compared with DAS, MV, and two other recently published BF techniques, our method offers better spatial resolution, respectively contrast, when using Laplacian and Gaussian priors

Development of a Resource Manager Framework for Adaptive Beamformer Selection

Adaptive digital beamforming (DBF) algorithms are designed to mitigate the effects of interference and noise in the electromagnetic (EM) environment encountered by modern electronic support (ES) receivers. Traditionally, an ES receiver employs a single adaptive DBF algorithm that is part of the design of the receiver system. While the traditional form of receiver implementation is effective in many scenarios it has inherent limitations. This dissertation proposes a new ES receiver framework capable of overcoming the limitations of traditional ES receivers. The proposed receiver framework is capable of forming multiple, independent, simultaneous adaptive digital beams toward multiple signals of interest in an electromagnetic environment. The main contribution of the research is the development, validation, and verification of a resource manager (RM) algorithm. The RM estimates a set of parameters that characterizes the electromagnetic environment and selects an adaptive digital beam forming DBF algorithm for implementation toward all each signal of interest (SOI) in the environment. Adaptive DBF algorithms are chosen by the RM based upon their signal to interference plus noise ratio (SINR) improvement ratio and their computational complexity. The proposed receiver framework is demonstrated to correctly estimate the desired electromagnetic parameters and select an adaptive DBF from the LUT

Broadband adaptive beamforming with low complexity and frequency invariant response

This thesis proposes different methods to reduce the computational complexity as well as increasing the adaptation rate of adaptive broadband beamformers. This is performed exemplarily for the generalised sidelobe canceller (GSC) structure. The GSC is an alternative implementation of the linearly constrained minimum variance beamformer, which can utilise well-known adaptive filtering algorithms, such as the least mean square (LMS) or the recursive least squares (RLS) to perform unconstrained adaptive optimisation.A direct DFT implementation, by which broadband signals are decomposed into frequency bins and processed by independent narrowband beamforming algorithms, is thought to be computationally optimum. However, this setup fail to converge to the time domain minimum mean square error (MMSE) if signal components are not aligned to frequency bins, resulting in a large worst case error. To mitigate this problem of the so-called independent frequency bin (IFB) processor, overlap-save based GSC beamforming structures have been explored. This system address the minimisation of the time domain MMSE, with a significant reduction in computational complexity when compared to time-domain implementations, and show a better convergence behaviour than the IFB beamformer. By studying the effects that the blocking matrix has on the adaptive process for the overlap-save beamformer, several modifications are carried out to enhance both the simplicity of the algorithm as well as its convergence speed. These modifications result in the GSC beamformer utilising a significantly lower computational complexity compare to the time domain approach while offering similar convergence characteristics.In certain applications, especially in the areas of acoustics, there is a need to maintain constant resolution across a wide operating spectrum that may extend across several octaves. To attain constant beamwidth is difficult, particularly if uniformly spaced linear sensor array are employed for beamforming, since spatial resolution is reciprocally proportional to both the array aperture and the frequency. A scaled aperture arrangement is introduced for the subband based GSC beamformer to achieve near uniform resolution across a wide spectrum, whereby an octave-invariant design is achieved. This structure can also be operated in conjunction with adaptive beamforming algorithms. Frequency dependent tapering of the sensor signals is proposed in combination with the overlap-save GSC structure in order to achieve an overall frequency-invariant characteristic. An adaptive version is proposed for frequency-invariant overlap-save GSC beamformer. Broadband adaptive beamforming algorithms based on the family of least mean squares (LMS) algorithms are known to exhibit slow convergence if the input signal is correlated. To improve the convergence of the GSC when based on LMS-type algorithms, we propose the use of a broadband eigenvalue decomposition (BEVD) to decorrelate the input of the adaptive algorithm in the spatial dimension, for which an increase in convergence speed can be demonstrated over other decorrelating measures, such as the Karhunen-Loeve transform. In order to address the remaining temporal correlation after BEVD processing, this approach is combined with subband decomposition through the use of oversampled filter banks. The resulting spatially and temporally decorrelated GSC beamformer provides further enhanced convergence speed over spatial or temporal decorrelation methods on their own

Spatio-Temporal processing for Optimum Uplink-Downlink WCDMA Systems

The capacity of a cellular system is limited by two different phenomena, namely multipath fading and multiple access interference (MAl). A Two Dimensional (2-D) receiver combats both of these by processing the signal both in the spatial and temporal domain. An ideal 2-D receiver would perform joint space-time processing, but at the price of high computational complexity. In this research we investigate computationally simpler technique termed as a Beamfom1er-Rake. In a Beamformer-Rake, the output of a beamfom1er is fed into a succeeding temporal processor to take advantage of both the beamformer and Rake receiver. Wireless service providers throughout the world are working to introduce the third generation (3G) and beyond (3G) cellular service that will provide higher data rates and better spectral efficiency. Wideband COMA (WCDMA) has been widely accepted as one of the air interfaces for 3G. A Beamformer-Rake receiver can be an effective solution to provide the receivers enhanced capabilities needed to achieve the required performance of a WCDMA system. We consider three different Pilot Symbol Assisted (PSA) beamforming techniques, Direct Matrix Inversion (DMI), Least-Mean Square (LMS) and Recursive Least Square (RLS) adaptive algorithms. Geometrically Based Single Bounce (GBSB) statistical Circular channel model is considered, which is more suitable for array processing, and conductive to RAKE combining. The performances of the Beam former-Rake receiver are evaluated in this channel model as a function of the number of antenna elements and RAKE fingers, in which are evaluated for the uplink WCDMA system. It is shown that, the Beamformer-Rake receiver outperforms the conventional RAKE receiver and the conventional beamformer by a significant margin. Also, we optimize and develop a mathematical formulation for the output Signal to Interference plus Noise Ratio (SINR) of a Beam former-Rake receiver. In this research, also, we develop, simulate and evaluate the SINR and Signal to Noise Ratio (Et!Nol performances of an adaptive beamforming technique in the WCDMA system for downlink. The performance is then compared with an omnidirectional antenna system. Simulation shows that the best perfom1ance can be achieved when all the mobiles with same Angle-of-Arrival (AOA) and different distance from base station are formed in one beam

Performance of Adaptive Satellite Antenna Array Processing and Comparison with Optimal Multi-User Communications

Eine Methode eine hohe spektrale Effizienz in Satellitenkommunikationssystemen zu erzielen, ist die koordinierte Wiederverwendung von Frequenzen in ausreichend voneinander entfernten geographischen Regionen. Die Frequenzwiederverwendung und damit die spektrale Effizienz können durch den Einsatz von Maßnahmen maximiert werden, die die Interferenz von nahe benachbarten Gleichkanal-Nutzern effizienter unterdrücken. In der Literatur kann man zwei fundamental unterschiedliche Ansätze finden, die eine bessere Unterdrückung der Interferenz von Gleichkanal-Nutzern ermöglichen. Der erste Ansatz fußt auf Dekodierungsmethoden, die durch die informationstheoretische Beschreibung des Mehrfachzugriffskanals (multiple access channel (MAC)) nahegelegt werden. Als eine der Möglichkeiten stellt Sukzessive Dekodierung (successive decoding) dabei eine attraktive Alternative zu komplexeren Verfahren dar, weil die Komplexität einerseits nur linear mit der Zahl der Quellen ansteigt und weil mit gewissen Einschränkungen dieselben Informationsraten erreicht werden können wie mit der optimalen Verbunddekodierung. Der zweite Ansatz versucht die räumliche Verteilung der interferierenden Gleichkanal-Nutzer effizient zu nutzen, indem eine Gruppenantenne (antenna array) zusammen mit adaptiver Strahlformung (adaptive beamforming) am Satelliten eingesetzt wird. Folgende Fragestellungen ergeben sich innerhalb des oben beschriebenen Rahmens: Ist es möglich, die oben beschriebenen Empfängervarianten, die entweder feste oder adaptive Strahlformung, bzw. entweder unabhängige oder sukzessive Dekodierung anwenden, in einer einheitlichen Weise zu beschreiben? Gibt es eine einfache Lösung für das Problem der Ressourcenzuteilung, die Sendeleistungen den Quellen zuzuordnen, welche notwendig sind, um eine bestimmte Informationsrate für alle Quellen zu erzielen? Wie ist die Leistungsfähigkeit eines Empfängers, der adaptive Strahlformung und/oder sukzessive Dekodierung anwendet, im Vergleich zu einem Empfänger, der feste Strahlformung und unabhängige Dekodierung einsetzt, wie es heutzutage der Standard ist? Wie nahe liegt die Leistung des Empfängers, der sowohl adaptive Strahlformung, als auch sukzessive Dekodierung verwendet, an der des Empfängers, der nur entweder adaptive Strahlformung oder sukzessive Dekodierung verwendet? Ist der Empfänger, der feste Strahlformung mit sukzessiver Dekodierung implementiert, besser als der, der adaptive Strahlformung mit unabhängiger Dekodierung implementiert, oder umgekehrt? Wie hängen die Antworten auf obige Fragen ab von der jeweiligen Quellenverteilung und dem daraus resultierenden Interferenzszenario

Spatio-Temporal processing for Optimum Uplink-Downlink WCDMA Systems

The capacity of a cellular system is limited by two different phenomena, namely multipath fading and multiple access interference (MAl). A Two Dimensional (2-D) receiver combats both of these by processing the signal both in the spatial and temporal domain. An ideal 2-D receiver would perform joint space-time processing, but at the price of high computational complexity. In this research we investigate computationally simpler technique termed as a Beamfom1er-Rake. In a Beamformer-Rake, the output of a beamfom1er is fed into a succeeding temporal processor to take advantage of both the beamformer and Rake receiver. Wireless service providers throughout the world are working to introduce the third generation (3G) and beyond (3G) cellular service that will provide higher data rates and better spectral efficiency. Wideband COMA (WCDMA) has been widely accepted as one of the air interfaces for 3G. A Beamformer-Rake receiver can be an effective solution to provide the receivers enhanced capabilities needed to achieve the required performance of a WCDMA system. We consider three different Pilot Symbol Assisted (PSA) beamforming techniques, Direct Matrix Inversion (DMI), Least-Mean Square (LMS) and Recursive Least Square (RLS) adaptive algorithms. Geometrically Based Single Bounce (GBSB) statistical Circular channel model is considered, which is more suitable for array processing, and conductive to RAKE combining. The performances of the Beam former-Rake receiver are evaluated in this channel model as a function of the number of antenna elements and RAKE fingers, in which are evaluated for the uplink WCDMA system. It is shown that, the Beamformer-Rake receiver outperforms the conventional RAKE receiver and the conventional beamformer by a significant margin. Also, we optimize and develop a mathematical formulation for the output Signal to Interference plus Noise Ratio (SINR) of a Beam former-Rake receiver. In this research, also, we develop, simulate and evaluate the SINR and Signal to Noise Ratio (Et!Nol performances of an adaptive beamforming technique in the WCDMA system for downlink. The performance is then compared with an omnidirectional antenna system. Simulation shows that the best perfom1ance can be achieved when all the mobiles with same Angle-of-Arrival (AOA) and different distance from base station are formed in one beam