Feedback of channel state information in multi-antenna systems based on quantization of channel Gram matrices

This dissertation deals with the proper design of efficient feedback strategies for Multiple-Input Multiple-Output (MIMO) communication systems. MIMO systems outperform single antenna systems in terms of achievable throughput and are more resilient to noise and interference, which are becoming the limiting factors in the current and future communications. Apart from the clear performance advantages, MIMO systems introduce an additional complexity factor, since they require knowledge of the propagation channel in order to be able to adapt the transmission to the propagation channel’s characteristics and achieve optimum performance. This channel knowledge, also known as Channel State Information (CSI), is estimated at the receiver and sent to the transmitter through a limited feedback link. In this dissertation, first, the minimum channel information necessary at the transmitter for the optimum precoding design is identified. This minimum information for the optimum design of the system corresponds to the channel Gram matrix. It is essential for the design of optimized systems to avoid the transmission of redundant feedback information. Following this idea, a quantization algorithm that exploits the differential geometry of the set of Gram matrices and the correlation in time present in most propagation channels is developed in order to greatly improve the feedback performance. This scheme is applied first to single-user MIMO communications, then to some particular multiuser scenarios, and finally it is extended to general multiuser broadcast communications. To conclude, the feedback link sizing is studied. An analysis of the tradeoff between size of the forward link and size of the feedback link isformulated and the radio resource allocation problem, in terms of transmission energy, time, and bandwidth of the forward and feedback links is presented.En un mundo cada vez más interconectado, donde hay una clara tendencia hacia un mayor número de comunicaciones inalámbricas simultáneas (comunicaciones M2M: Machine to Machine, redes de sensores, etc.) y en el que las necesidades de capacidad de transmisión de los enlaces de comunicaciones aumentan de manera vertiginosa (audio, video, contenidos multimedia, alta definición, etc.) el problema de la interferencia se convierte en uno de los factores limitadores de los enlaces junto con los desvanecimientos del nivel de señal y las pérdidas de propagación. Por este motivo los sistemas que emplean múltiples antenas tanto en la transmisión como en la recepción (los llamados sistemas MIMO: Multiple-Input Multiple-Output) se presentan como una de las soluciones más interesantes para satisfacer los crecientes requisitos de capacidad y comportamiento relativo a interferencias. Los sistemas MIMO permiten obtener un mejor rendimiento en términos de tasa de transmisión de información y a su vez son más robustos frente a ruido e interferencias en el canal. Esto significa que pueden usarse para aumentar la capacidad de los enlaces de comunicaciones actuales o para reducir drásticamente el consumo energético manteniendo las mismas prestaciones. Por otro lado, además de estas claras ventajas, los sistemas MIMO introducen un punto de complejidad adicional puesto que para aprovechar al máximo las posibilidades de estos sistemas es necesario tener conocimiento de la información de estado del canal (CSI: Channel State Information) tanto en el transmisor como en el receptor. Esta CSI se obtiene mediante estimación de canal en el receptor y posteriormente se envía al transmisor a través de un canal de realimentación. Esta tesis trata sobre el diseño del canal de realimentación para la transmisión de CSI, que es un elemento fundamental de los sistemas de comunicaciones del presente y del futuro. Las técnicas de transmisión que consideran activamente el efecto de la interferencia y el ruido requieren adaptarse al canal y, para ello, la realimentación de CSI es necesaria. En esta tesis se identifica, en primer lugar, la mínima información sobre el estado del canal necesaria para implementar un diseño óptimo en el transmisor, con el fin de evitar transmitir información redundante y obtener así un sistema más eficiente. Esta información es la matriz de Gram del canal MIMO. Seguidamente, se desarrolla un algoritmo de cuantificación adaptado a la geometría diferencial del conjunto que contiene la información a cuantificar y que además aprovecha la correlación temporal existente en los canales de propagación inalámbricos. Este algoritmo se implementa y evalúa primero en comunicaciones MIMO punto a punto entre dos usuarios, después se implementa para algunos casos particulares con múltiples usuarios, y finalmente se amplía para el caso general de sistemas broadcast multi-usuario. Adicionalmente, esta tesis también estudia y optimiza el dimensionamiento del canal de realimentación en función de la cantidad de recursos radio disponibles, en términos de ancho de banda, tiempo y potencia de transmisión. Para ello presenta el problema de la distribución óptima de dichos recursos radio entre el enlace de transmisión de datos y el enlace de realimentación para transmisión de información sobre estado del canal como un problema de optimización

A review of blind source separation in NMR spectroscopy

27 pagesInternational audienceFourier transform is the data processing naturally associated to most NMR experiments. Notable exceptions are Pulse Field Gradient and relaxation analysis, the structure of which is only partially suitable for FT. With the revamp of NMR of complex mixtures, fueled by analytical challenges such as metabolomics, alternative and more apt mathematical methods for data processing have been sought, with the aim of decomposing the NMR signal into simpler bits. Blind source separation is a very broad definition regrouping several classes of mathematical methods for complex signal decomposition that use no hypothesis on the form of the data. Developed outside NMR, these algorithms have been increasingly tested on spectra of mixtures. In this review, we shall provide an historical overview of the application of blind source separation methodologies to NMR, including methods specifically designed for the specificity of this spectroscopy

Linear Transmit-Receive Strategies for Multi-user MIMO Wireless Communications

Die Notwendigkeit zur Unterdrueckung von Interferenzen auf der einen Seite und zur Ausnutzung der durch Mehrfachzugriffsverfahren erzielbaren Gewinne auf der anderen Seite rueckte die raeumlichen Mehrfachzugriffsverfahren (Space Division Multiple Access, SDMA) in den Fokus der Forschung. Ein Vertreter der raeumlichen Mehrfachzugriffsverfahren, die lineare Vorkodierung, fand aufgrund steigender Anzahl an Nutzern und Antennen in heutigen und zukuenftigen Mobilkommunikationssystemen besondere Beachtung, da diese Verfahren das Design von Algorithmen zur Vorcodierung vereinfachen. Aus diesem Grund leistet diese Dissertation einen Beitrag zur Entwicklung linearer Sende- und Empfangstechniken fuer MIMO-Technologie mit mehreren Nutzern. Zunaechst stellen wir ein Framework zur Approximation des Datendurchsatzes in Broadcast-MIMO-Kanaelen mit mehreren Nutzern vor. In diesem Framework nehmen wir das lineare Vorkodierverfahren regularisierte Blockdiagonalisierung (RBD) an. Durch den Vergleich von Dirty Paper Coding (DPC) und linearen Vorkodieralgorithmen (z.B. Zero Forcing (ZF) und Blockdiagonalisierung (BD)) ist es uns moeglich, untere und obere Schranken fuer den Unterschied bezueglich Datenraten und bezueglich Leistung zwischen beiden anzugeben. Im Weiteren entwickeln wir einen Algorithmus fuer koordiniertes Beamforming (Coordinated Beamforming, CBF), dessen Loesung sich in geschlossener Form angeben laesst. Dieser CBF-Algorithmus basiert auf der SeDJoCo-Transformation und loest bisher vorhandene Probleme im Bereich CBF. Im Anschluss schlagen wir einen iterativen CBF-Algorithmus namens FlexCoBF (flexible coordinated beamforming) fuer MIMO-Broadcast-Kanaele mit mehreren Nutzern vor. Im Vergleich mit bis dato existierenden iterativen CBF-Algorithmen kann als vielversprechendster Vorteil die freie Wahl der linearen Sende- und Empfangsstrategie herausgestellt werden. Das heisst, jede existierende Methode der linearen Vorkodierung kann als Sendestrategie genutzt werden, waehrend die Strategie zum Empfangsbeamforming frei aus MRC oder MMSE gewaehlt werden darf. Im Hinblick auf Szenarien, in denen Mobilfunkzellen in Clustern zusammengefasst sind, erweitern wir FlexCoBF noch weiter. Hier wurde das Konzept der koordinierten Mehrpunktverbindung (Coordinated Multipoint (CoMP) transmission) integriert. Zuletzt stellen wir drei Moeglichkeiten vor, Kanalzustandsinformationen (Channel State Information, CSI) unter verschiedenen Kanalumstaenden zu erlangen. Die Qualitaet der Kanalzustandsinformationen hat einen starken Einfluss auf die Guete des Uebertragungssystems. Die durch unsere neuen Algorithmen erzielten Verbesserungen haben wir mittels numerischer Simulationen von Summenraten und Bitfehlerraten belegt.In order to combat interference and exploit large multiplexing gains of the multi-antenna systems, a particular interest in spatial division multiple access (SDMA) techniques has emerged. Linear precoding techniques, as one of the SDMA strategies, have obtained more attention due to the fact that an increasing number of users and antennas involved into the existing and future mobile communication systems requires a simplification of the precoding design. Therefore, this thesis contributes to the design of linear transmit and receive strategies for multi-user MIMO broadcast channels in a single cell and clustered multiple cells. First, we present a throughput approximation framework for multi-user MIMO broadcast channels employing regularized block diagonalization (RBD) linear precoding. Comparing dirty paper coding (DPC) and linear precoding algorithms (e.g., zero forcing (ZF) and block diagonalization (BD)), we further quantify lower and upper bounds of the rate and power offset between them as a function of the system parameters such as the number of users and antennas. Next, we develop a novel closed-form coordinated beamforming (CBF) algorithm (i.e., SeDJoCo based closed-form CBF) to solve the existing open problem of CBF. Our new algorithm can support a MIMO system with an arbitrary number of users and transmit antennas. Moreover, the application of our new algorithm is not only for CBF, but also for blind source separation (BSS), since the same mathematical model has been used in BSS application.Then, we further propose a new iterative CBF algorithm (i.e., flexible coordinated beamforming (FlexCoBF)) for multi-user MIMO broadcast channels. Compared to the existing iterative CBF algorithms, the most promising advantage of our new algorithm is that it provides freedom in the choice of the linear transmit and receive beamforming strategies, i.e., any existing linear precoding method can be chosen as the transmit strategy and the receive beamforming strategy can be flexibly chosen from MRC or MMSE receivers. Considering clustered multiple cell scenarios, we extend the FlexCoBF algorithm further and introduce the concept of the coordinated multipoint (CoMP) transmission. Finally, we present three strategies for channel state information (CSI) acquisition regarding various channel conditions and channel estimation strategies. The CSI knowledge is required at the base station in order to implement SDMA techniques. The quality of the obtained CSI heavily affects the system performance. The performance enhancement achieved by our new strategies has been demonstrated by numerical simulation results in terms of the system sum rate and the bit error rate

Algorithmes pour la diagonalisation conjointe de tenseurs sans contrainte unitaire. Application à la séparation MIMO de sources de télécommunications numériques

This thesis develops joint diagonalization of matrices and third-order tensors methods for MIMO source separation in the field of digital telecommunications. After a state of the art, the motivations and the objectives are presented. Then the joint diagonalisation and the blind source separation issues are defined and a link between both fields is established. Thereafter, five Jacobi-like iterative algorithms based on an LU parameterization are developed. For each of them, we propose to derive the diagonalization matrix by optimizing an inverse criterion. Two ways are investigated : minimizing the criterion in a direct way or assuming that the elements from the considered set are almost diagonal. Regarding the parameters derivation, two strategies are implemented : one consists in estimating each parameter independently, the other consists in the independent derivation of couple of well-chosen parameters. Hence, we propose three algorithms for the joint diagonalization of symmetric complex matrices or hermitian ones. The first one relies on searching for the roots of the criterion derivative, the second one relies on a minor eigenvector research and the last one relies on a gradient descent method enhanced by computation of the optimal adaptation step. In the framework of joint diagonalization of symmetric, INDSCAL or non symmetric third-order tensors, we have developed two algorithms. For each of them, the parameters derivation is done by computing the roots of the considered criterion derivative. We also show the link between the joint diagonalization of a third-order tensor set and the canonical polyadic decomposition of a fourth-order tensor. We confront both methods through numerical simulations. The good behavior of the proposed algorithms is illustrated by means of computing simulations. Finally, they are applied to the source separation of digital telecommunication signals.Cette thèse développe des méthodes de diagonalisation conjointe de matrices et de tenseurs d’ordre trois, et son application à la séparation MIMO de sources de télécommunications numériques. Après un état, les motivations et objectifs de la thèse sont présentés. Les problèmes de la diagonalisation conjointe et de la séparation de sources sont définis et un lien entre ces deux domaines est établi. Par la suite, plusieurs algorithmes itératifs de type Jacobi reposant sur une paramétrisation LU sont développés. Pour chacun des algorithmes, on propose de déterminer les matrices permettant de diagonaliser l’ensemble considéré par l’optimisation d’un critère inverse. On envisage la minimisation du critère selon deux approches : la première, de manière directe, et la seconde, en supposant que les éléments de l’ensemble considéré sont quasiment diagonaux. En ce qui concerne l’estimation des différents paramètres du problème, deux stratégies sont mises en œuvre : l’une consistant à estimer tous les paramètres indépendamment et l’autre reposant sur l’estimation indépendante de couples de paramètres spécifiquement choisis. Ainsi, nous proposons trois algorithmes pour la diagonalisation conjointe de matrices complexes symétriques ou hermitiennes et deux algorithmes pour la diagonalisation conjointe d’ensembles de tenseurs symétriques ou non-symétriques ou admettant une décomposition INDSCAL. Nous montrons aussi le lien existant entre la diagonalisation conjointe de tenseurs d’ordre trois et la décomposition canonique polyadique d’un tenseur d’ordre quatre, puis nous comparons les algorithmes développés à différentes méthodes de la littérature. Le bon comportement des algorithmes proposés est illustré au moyen de simulations numériques. Puis, ils sont validés dans le cadre de la séparation de sources de télécommunications numériques

Gradient-type subspace iteration methods for the symmetric eigenvalue problem

This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a Grassmann manifold viewpoint are developed. A gradient method as well as a conjugate gradient technique are described. Convergence of the gradient-based algorithm is analyzed and a few numerical experiments are reported, indicating that the proposed algorithms are sometimes superior to a standard Chebyshev-based subspace iteration when compared in terms of number of matrix vector products, but do not require estimating optimal parameters. An important contribution of this paper to achieve this good performance is the accurate and efficient implementation of an exact line search. In addition, new convergence proofs are presented for the non-accelerated gradient method that includes a locally exponential convergence if started in a $\mathcal{O(\sqrt{\delta})}$ neighbourhood of the dominant subspace with spectral gap $\delta$.Comment: 29 page

Quantum Control Landscapes

Numerous lines of experimental, numerical and analytical evidence indicate that it is surprisingly easy to locate optimal controls steering quantum dynamical systems to desired objectives. This has enabled the control of complex quantum systems despite the expense of solving the Schrodinger equation in simulations and the complicating effects of environmental decoherence in the laboratory. Recent work indicates that this simplicity originates in universal properties of the solution sets to quantum control problems that are fundamentally different from their classical counterparts. Here, we review studies that aim to systematically characterize these properties, enabling the classification of quantum control mechanisms and the design of globally efficient quantum control algorithms.Comment: 45 pages, 15 figures; International Reviews in Physical Chemistry, Vol. 26, Iss. 4, pp. 671-735 (2007

Diagonalizing transfer matrices and matrix product operators: a medley of exact and computational methods

Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices and matrix product operators. The results in this paper are a mixture of classic results, presented from the point of view of tensor networks, and of new results. Topics discussed are exact solutions of transfer matrices in equilibrium and non-equilibrium statistical physics, tensor network states, matrix product operator algebras, and numerical matrix product state methods for finding extremal eigenvectors of matrix product operators.Comment: Lecture notes from a course at Vienna Universit

The calculation of optical absorption spectra using linear-scaling density-functional theory

The goal of the work presented in this thesis was to develop and implement a method for calculating optical absorption spectra for large electronic systems within a linear-scaling density-functional theory (LS-DFT) formalism. The key feature of this method was the development of a scheme for optimizing a set of localized orbitals to accurately represent unoccupied Kohn-Sham states, which are not well represented by the localized orbital basis sets used for ground state LS-DFT calculations. Three different schemes were compared for the calculation of unoccupied states using a one-dimensional “toy model” and the most promising of these, based on the use of a projection operator, was implemented in a fully-functional LS-DFT code. Using the toy model, two methods for the calculation of band structures within a localized basis set were investigated and some of the features required by localized basis sets in order to produce accurate band structures were identified. The method was tested by the application to both molecular and extended systems, with calculations of densities of states, band structures and optical absorption spectra. The results for the smaller systems were validated by comparison with a cubic-scaling plane-wave density-functional theory code, with which excellent agreement was achieved. Additionally, the method was shown to be linear-scaling for a conjugated polymer for system sizes up to 1000 atoms. The use of the projection method was shown to be crucial for calculating the above results, as was the implementation of a momentum operator based formalism for the calculation of spectra. Finally, it was shown that the method can be used to identify the transitions responsible for particular peaks in the spectra and is sensitive enough to distinguish between spectra for systems with very similar structures, demonstrating the capabilities of the method to aid the interpretation of experimental results

Constructing networks of quantum channels for state preparation

Entangled possibly mixed states are an essential resource for quantum computation, communication, metrology, and the simulation of many-body systems. It is important to develop and improve preparation protocols for such states. One possible way to prepare states of interest is to design an open system that evolves only towards the desired states. A Markovian evolution of a quantum system can be generally described by a Lindbladian. Tensor networks provide a framework to construct physically relevant entangled states. In particular, matrix product density operators (MPDOs) form an important variational class of states. MPDOs generalize matrix product states to mixed states, can represent thermal states of local one-dimensional Hamiltonians at sufficiently large temperatures, describe systems that satisfy the area law of entanglement, and form the basis of powerful numerical methods. In this work we develop an algorithm that determines for a given linear subspace of MPDOs whether this subspace can be the stable space of some frustration free k-local Lindbladian and, if so, outputs an appropriate Lindbladian. We proceed by using machine learning with networks of quantum channels, also known as quantum neural networks (QNNs), to train denoising post-processing devices for quantum sources. First, we show that QNNs can be trained on imperfect devices even when part of the training data is corrupted. Second, we show that QNNs can be trained to extrapolate quantum states to, e.g., lower temperatures. Third, we show how to denoise quantum states in an unsupervised manner. We develop a novel quantum autoencoder that successfully denoises Greenberger-Horne-Zeilinger, W, Dicke, and cluster states subject to spin-flip, dephasing errors, and random unitary noise. Finally, we develop recurrent QNNs (RQNNs) for denoising that requires memory, such as combating drifts. RQNNs can be thought of as matrix product quantum channels with a quantum algorithm for training and are closely related to MPDOs. The proposed preparation and denoising protocols can be beneficial for various emergent quantum technologies and are within reach of present-day experiments

Matrix and Tensor-based ESPRIT Algorithm for Joint Angle and Delay Estimation in 2D Active Broadband Massive MIMO Systems and Analysis of Direction of Arrival Estimation Algorithms for Basal Ice Sheet Tomography

In this thesis, we apply and analyze three direction of arrival algorithms (DoA) to tackle two distinct problems: one belongs to wireless communication, the other to radar signal processing. Though the essence of these two problems is DoA estimation, their formulation, underlying assumptions, application scenario, etc. are totally different. Hence, we write them separately, with ESPRIT algorithm the focus of Part I and MUSIC and MLE detailed in Part II. For wireless communication scenario, mobile data traffic is expected to have an exponential growth in the future. In order to meet the challenge as well as the form factor limitation on the base station, 2D "massive MIMO" has been proposed as one of the enabling technologies to significantly increase the spectral efficiency of a wireless system. In "massive MIMO" systems, a base station will rely on the uplink sounding signals from mobile stations to figure out the spatial information to perform MIMO beamforming. Accordingly, multi-dimensional parameter estimation of a ray-based multi-path wireless channel becomes crucial for such systems to realize the predicted capacity gains. In the first Part, we study joint angle and delay estimation for 2D "massive MIMO" systems in mobile wireless communications. To be specific, we first introduce a low complexity time delay and 2D DoA estimation algorithm based on unitary transformation. Some closed-form results and capacity analysis are involved. Furthermore, the matrix and tensor-based 3D ESPRIT-like algorithms are applied to jointly estimate angles and delay. Significant improvements of the performance can be observed in our communication scheme. Finally, we found that azimuth estimation is more vulnerable compared to elevation estimation. Results suggest that the dimension of the antenna array at the base station plays an important role in determining the estimation performance. These insights will be useful for designing practical "massive MIMO" systems in future mobile wireless communications. For the problem of radar remote sensing of ice sheet topography, one of the key requirements for deriving more realistic ice sheet models is to obtain a good set of basal measurements that enables accurate estimation of bed roughness and conditions. For this purpose, 3D tomography of the ice bed has been successfully implemented with the help of DoA algorithms such as MUSIC and MLE techniques. These methods have enabled fine resolution in the cross-track dimension using synthetic aperture radar (SAR) images obtained from single pass multichannel data. In Part II, we analyze and compare the results obtained from the spectral MUSIC algorithm and an alternating projection (AP) based MLE technique. While the MUSIC algorithm is more attractive computationally compared to MLE, the performance of the latter is known to be superior in most situations. The SAR focused datasets provide a good case study to explore the performance of these two techniques to the application of ice sheet bed elevation estimation. For the antenna array geometry and sample support used in our tomographic application, MUSIC performs better originally using a cross-over analysis where the estimated topography from crossing flightlines are compared for consistency. However, after several improvements applied to MLE, i.e., replacing ideal steering vector generation with measured steering vectors, automatic determination of the number of scatter sources, smoothing the 3D tomography in order to get a more accurate height estimation and introducing a quality metric for the estimated signals, etc., MLE outperforms MUSIC. It confirms that MLE is indeed the optimal estimator for our particular ice bed tomographic application. We observe that, the spatial bottom smoothing, aiming to remove the artifacts made by MLE algorithm, is the most essential step in the post-processing procedure. The 3D tomography we obtained lays a good foundation for further analysis and modeling of ice sheets