arXiv subjects

Maxime Guillaud

Publications and source records attributed to Maxime Guillaud.

At least 37 records · Page 2Linked to original sources

arXiv2020

Multi-User Detection Based on Expectation Propagation for the Non-Coherent SIMO Multiple Access Channel

We consider the non-coherent single-input multiple-output (SIMO) multiple access channel with general signaling under spatially correlated Rayleigh block fading. We propose a novel soft-output multi-user detector that computes an approximate marginal posterior of each transmitted signal using only the knowledge about the channel distribution. Our detector is based on expectation propagation (EP) approximate inference and has polynomial complexity in the number of users, the number of receive antennas, and channel coherence time. We also propose two simplifications of this detector with reduced complexity. With Grassmannian signaling, the proposed detectors outperform a state-of-the-art non-coherent detector with projection-based interference mitigation. With pilot-assisted signaling, the EP detector outperforms, in terms of symbol error rate, some conventional coherent pilot-based detectors, including a sphere decoder and a joint channel estimation-data detection scheme. Our EP-based detectors produce accurate approximates of the true posterior leading to high achievable sum-rates. The gains of these detectors are further observed in terms of the bit error rate when using their soft outputs for a turbo channel decoder.

cs.IT↗

arXiv2020

6G White Paper on Localization and Sensing

This white paper explores future localization and sensing opportunities for beyond 5G wireless communication systems by identifying key technology enablers and discussing their underlying challenges, implementation issues, and identifying potential solutions. In addition, we present exciting new opportunities for localization and sensing applications, which will disrupt traditional design principles and revolutionize the way we live, interact with our environment, and do business. Following the trend initiated in the 5G NR systems, 6G will continue to develop towards even higher frequency ranges, wider bandwidths, and massive antenna arrays. In turn, this will enable sensing solutions with very fine range, Doppler and angular resolutions, as well as localization to cm-level degree of accuracy. Moreover, new materials, device types, and reconfigurable surfaces will allow network operators to reshape and control the electromagnetic response of the environment. At the same time, machine learning and artificial intelligence will leverage the unprecedented availability of data and computing resources to tackle the biggest and hardest problems in wireless communication systems. 6G will be truly intelligent wireless systems that will not only provide ubiquitous communication but also empower high accuracy localization and high-resolution sensing services. They will become the catalyst for this revolution by bringing about a unique new set of features and service capabilities, where localization and sensing will coexist with communication, continuously sharing the available resources in time, frequency and space. This white paper concludes by highlighting foundational research challenges, as well as implications and opportunities related to privacy, security, and trust. Addressing these challenges will undoubtedly require an inter-disciplinary and concerted effort from the research community.

eess.SY↗

arXiv2020

DNN-based Localization from Channel Estimates: Feature Design and Experimental Results

We consider the use of deep neural networks (DNNs) in the context of channel state information (CSI)-based localization for Massive MIMO cellular systems. We discuss the practical impairments that are likely to be present in practical CSI estimates, and introduce a principled approach to feature design for CSI-based DNN applications based on the objective of making the features invariant to the considered impairments. We demonstrate the efficiency of this approach by applying it to a dataset constituted of geo-tagged CSI measured in an outdoors campus environment, and training a DNN to estimate the position of the UE on the basis of the CSI. We provide an experimental evaluation of several aspects of that learning approach, including localization accuracy, generalization capability, and data aging.

cs.NI↗

arXiv2020

Covariance-Aided CSI Acquisition with Non-Orthogonal Pilots in Massive MIMO: A Large-System Performance Analysis

Massive multiple-input multiple-output (MIMO) systems use antenna arrays with a large number of antenna elements to serve many different users simultaneously. The large number of antennas in the system makes, however, the channel state information (CSI) acquisition strategy design critical and particularly challenging. Interestingly, in the context of massive MIMO systems, channels exhibit a large degree of spatial correlation which results in strongly rank-deficient spatial covariance matrices at the base station (BS). With the final objective of analyzing the benefits of covariance-aided uplink multi-user CSI acquisition in massive MIMO systems, here we compare the channel estimation mean-square error (MSE) for (i) conventional CSI acquisition, which does not assume any knowledge on the user spatial covariance matrices and uses orthogonal pilot sequences; and (ii) covariance-aided CSI acquisition, which exploits the individual covariance matrices for channel estimation and enables the use of non-orthogonal pilot sequences. We apply a large-system analysis to the latter case, for which new asymptotic MSE expressions are established under various assumptions on the distributions of the pilot sequences and on the covariance matrices. We link these expressions to those describing the estimation MSE of conventional CSI acquisition with orthogonal pilot sequences of some equivalent length. This analysis provides insights on how much training overhead can be reduced with respect to the conventional strategy when a covariance-aided approach is adopted.

cs.IT↗

arXiv2020

Joint Constellation Design for the Two-User Non-Coherent Multiple-Access Channel

We consider the joint constellation design problem for the two-user non-coherent multiple-access channel (MAC). Based on an analysis on the non-coherent maximum-likelihood (ML) detection error, we propose novel design criteria so as to minimize the error probability. Based on these criteria, we propose a simple and efficient construction consisting in partitioning a single-user constellation. Numerical results show that our proposed metrics are meaningful, and can be used as objectives to generate constellations through numerical optimization that perform better than other schemes for the same transmission rate and power.

cs.IT↗

arXiv2018

CSI-based Outdoor Localization for Massive MIMO: Experiments with a Learning Approach

We report on experimental results on the use of a learning-based approach to infer the location of a mobile user of a cellular network within a cell, for a 5G-type Massive multiple input, multiple output (MIMO) system. We describe how the sample spatial covariance matrix computed from the CSI can be used as the input to a learning algorithm which attempts to relate it to user location. We discuss several learning approaches, and analyze in depth the application of extreme learning machines, for which theoretical approximate performance benchmarks are available, to the localization problem. We validate the proposed approach using experimental data collected on a Huawei 5G testbed, provide some performance and robustness benchmarks, and discuss practical issues related to the deployment of such a technique in 5G networks.

cs.IT↗

arXiv2018

The Optimal DoF Region for the Two-User Non-Coherent SIMO Multiple-Access Channel

The optimal degree-of-freedom (DoF) region of the non-coherent multiple-access channels is still unknown in general. In this paper, we make some progress by deriving the entire optimal DoF region in the case of the two-user single-input multiple-output (SIMO) generic block fading channels. The achievability is based on a simple training-based scheme. The novelty of our result lies in the converse using a genie-aided bound and the duality upper bound. As a by-product, our result generalizes previous proofs for the single-user Rayleigh block fading channels.

cs.IT↗

arXiv2017

A Framework for Over-the-air Reciprocity Calibration for TDD Massive MIMO Systems

One of the biggest challenges in operating massive multiple-input multiple-output systems is the acquisition of accurate channel state information at the transmitter. To take up this challenge, time division duplex is more favorable thanks to its channel reciprocity between downlink and uplink. However, while the propagation channel over the air is reciprocal, the radio-frequency front-ends in the transceivers are not. Therefore, calibration is required to compensate the RF hardware asymmetry. Although various over-the-air calibration methods exist to address the above problem, this paper offers a unified representation of these algorithms, providing a higher level view on the calibration problem, and introduces innovations on calibration methods. We present a novel family of calibration methods, based on antenna grouping, which improve accuracy and speed up the calibration process compared to existing methods. We then provide the Cramér-Rao bound as the performance evaluation benchmark and compare maximum likelihood and least squares estimators. We also differentiate between coherent and non-coherent accumulation of calibration measurements, and point out that enabling non-coherent accumulation allows the training to be spread in time, minimizing impact to the data service. Overall, these results have special value in allowing to design reciprocity calibration techniques that are both accurate and resource-effective.

cs.IT↗

arXiv2016

Cube-Split: Structured Quantizers on the Grassmannian of Lines

This paper introduces a new quantization scheme for real and complex Grassmannian sources. The proposed approach relies on a structured codebook based on a geometric construction of a collection of bent grids defined from an initial mesh on the unit-norm sphere. The associated encoding and decoding algorithms have very low complexity (equivalent to a scalar quantizer), while their efficiency (in terms of the achieved distortion) is on par with the best known structured approaches, and compares well with the theoretical bounds. These properties make this codebook suitable for high-resolutions, real-time applications such as channel state feedback in massive multiple-input multiple-output (MIMO) wireless communication systems.

cs.IT↗

arXiv2016

SNOPS: Short Non-Orthogonal Pilot Sequences for Downlink Channel State Estimation in FDD Massive MIMO

Channel state information (CSI) acquisition is a significant bottleneck in the design of Massive MIMO wireless systems, due to the length of the training sequences required to distinguish the antennas (in the downlink) and the users (for the uplink where a given spectral resource can be shared by a large number of users). In this article, we focus on the downlink CSI estimation case. Considering the presence of spatial correlation at the base transceiver station (BTS) side, and assuming that the per-user channel statistics are known, we seek to exploit this correlation to minimize the length of the pilot sequences. We introduce a scheme relying on non-orthogonal pilot sequences and feedback from the user terminal (UT), which enables the BTS to estimate all downlink channels. Thanks to the relaxed orthogonality assumption on the pilots, the length of the obtained pilot sequences can be strictly lower than the number of antennas at the BTS, while the CSI estimation error is kept arbitrarily small. We introduce two algorithms to dynamically design the required pilot sequences, analyze and validate the performance of the proposed CSI estimation method through numerical simulations using a realistic scenario based on the one-ring channel model.

cs.IT↗

arXiv2016

Trends and Challenges in Wireless Channel Modeling for an Evolving Radio Access

With the advent of 5G, standardization and research are currently defining the next generation of the radio access. Considering the high constraints imposed by the future standards, disruptive technologies such as Massive MIMO and mmWave are being proposed. At the heart of this process are wireless channel models that now need to cover a massive increase in design parameters, a large variety of frequency bands, and heterogeneous deployments. This tutorial describes how channel models address this new level of complexity and which tools the community prepares to efficiently but accurately capture the upcoming changes in radio access design. We analyze the main drivers behind these new modeling tools, the challenges they pose, and survey the current approaches to overcome them.

cs.IT↗

arXiv2016

Channel Covariance Estimation in Massive MIMO Frequency Division Duplex Systems

Channel covariance is emerging as a critical ingredient of the acquisition of instantaneous channel state information (CSI) in multi-user Massive MIMO systems operating in frequency division duplex (FDD) mode. In this context, channel reciprocity does not hold, and it is generally expected that covariance information about the downlink channel must be estimated and fed back by the user equipment (UE). As an alternative CSI acquisition technique, we propose to infer the downlink covariance based on the observed uplink covariance. This inference process relies on a dictionary of uplink/downlink covariance matrices, and on interpolation in the corresponding Riemannian space; once the dictionary is known, the estimation does not rely on any form of feedback from the UE. In this article, we present several variants of the interpolation method, and benchmark them through simulations.

cs.IT↗

arXiv2016

Pilot Length Optimization for Spatially Correlated Multi-User MIMO Channel Estimation

We address the design of pilot sequences for channel estimation in the context of multiple-user Massive MIMO; considering the presence of channel correlation, and assuming that the statistics are known, we seek to exploit the spatial correlation of the channels to minimize the length of the pilot sequences, and specifically the fact that the users can be separated either through their spatial signature (low-rank channel covariance matrices), or through the use of different training sequences. We introduce an algorithm to design short training sequences for a given set of user covariance matrices. The obtained pilot sequences are in general non-orthogonal, however they ensure that the channel estimation error variance is uniformly upper-bounded by a chosen constant over all channel dimensions. We show through simulations using a realistic scenario based on the one-ring channel model that the proposed technique can yield pilot sequences of length significantly smaller than the number of users in the system.

cs.IT↗

arXiv2015

Interference Alignment with Quantized Grassmannian Feedback in the K-user Constant MIMO Interference Channel

A simple channel state information (CSI) feedback scheme is proposed for interference alignment (IA) over the K-user constant Multiple-Input-Multiple-Output Interference Channel (MIMO IC). The proposed technique relies on the identification of invariants in the IA equations, which enables the reformulation of the CSI quantization problem as a single quantization on the Grassmann manifold at each receiver. The scaling of the number of feedback bits with the transmit power sufficient to preserve the multiplexing gain that can be achieved under perfect CSI is established. We show that the CSI feedback requirements of the proposed technique are better (lower) than what is required when using previously published methods, for system dimensions (number of users and antennas) of practical interest. Furthermore, we show through simulations that this advantage persists at low SNR, in the sense that the proposed technique yields a higher sum-rate performance for a given number of feedback bits. Finally, to complement our analysis, we introduce a statistical model that faithfully captures the properties of the quantization error obtained for random vector quantization (RVQ) on the Grassmann manifold for large codebooks; this enables the numerical (Monte-Carlo) analysis of general Grassmannian RVQ schemes for codebook sizes that would be impractically large to simulate.

cs.IT↗

arXiv2013

Interference Alignment via Message-Passing

We introduce an iterative solution to the problem of interference alignment (IA) over MIMO channels based on a message-passing formulation. We propose a parameterization of the messages that enables the computation of IA precoders by a min-sum algorithm over continuous variable spaces -- under this parameterization, suitable approximations of the messages can be computed in closed-form. We show that the iterative leakage minimization algorithm of Cadambe et al. is a special case of our message-passing algorithm, obtained for a particular schedule. Finally, we show that the proposed algorithm compares favorably to iterative leakage minimization in terms of convergence speed, and discuss a distributed implementation.

cs.IT↗

arXiv2013

Degrees of Freedom of Certain Interference Alignment Schemes with Distributed CSIT

In this work, we consider the use of interference alignment (IA) in a MIMO interference channel (IC) under the assumption that each transmitter (TX) has access to channel state information (CSI) that generally differs from that available to other TXs. This setting is referred to as distributed CSIT. In a setting where CSI accuracy is controlled by a set of power exponents, we show that in the static 3-user MIMO square IC, the number of degrees-of-freedom (DoF) that can be achieved with distributed CSIT is at least equal to the DoF achieved with the worst accuracy taken across the TXs and across the interfering links. We conjecture further that this represents exactly the DoF achieved. This result is in strong contrast with the centralized CSIT configuration usually studied (where all the TXs share the same, possibly imperfect, channel estimate) for which it was shown that the DoF achieved at receiver (RX) i is solely limited by the quality of its own feedback. This shows the critical impact of CSI discrepancies between the TXs, and highlights the price paid by distributed precoding.

cs.IT↗

arXiv2013

CSIT Sharing over Finite Capacity Backhaul for Spatial Interference Alignment

Cellular systems that employ time division duplexing (TDD) transmission are good candidates for implementation of interference alignment (IA) in the downlink since channel reciprocity enables the estimation of the channel state by the base stations (BS) in the uplink phase. However, the interfering BSs need to share their channel estimates via backhaul links of finite capacity. A quantization scheme is proposed which reduces the amount of information exchange (compared to conventional methods) required to achieve IA in a TDD system. The scaling (with the transmit power) of the number of bits to be exchanged between the BSs that is sufficient to preserve the multiplexing gain of IA is derived.

cs.IT↗

arXiv2010

Receive Diversity and Ergodic Performance of Interference Alignment on the MIMO Gaussian Interference Channel

We consider interference alignment (IA) over K-user Gaussian MIMO interference channel (MIMO-IC) when the SNR is not asymptotically high. We introduce a generalization of IA which enables receive diversity inside the interference-free subspace. We generalize the existence criterion of an IA solution proposed by Yetis et al. to this case, thereby establishing a multi-user diversity-multiplexing trade-off (DMT) for the interference channel. Furthermore, we derive a closed-form tight lower-bound for the ergodic mutual information achievable using IA over a Gaussian MIMO-IC with Gaussian i.i.d. channel coefficients at arbitrary SNR, when the transmitted signals are white inside the subspace defined by IA. Finally, as an application of the previous results, we compare the performance achievable by IA at various operating points allowed by the DMT, to a recently introduced distributed method based on game theory.

cs.IT↗