arXiv subjects

Faouzi Bellili

Publications and source records attributed to Faouzi Bellili.

27 records · Page 2Linked to original sources

arXiv2021

Achievable Rate with Antenna Size Constraint: Shannon meets Chu and Bode

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing circuit-theoretic multiport models for radio communication systems, we derive the information-theoretic limits of compact antennas. We first describe an equivalent Chu's antenna circuit under the physical realizability conditions of its reflection coefficient. Such a design allows us to subsequently compute the achievable rate for a given receive antenna size thereby providing a physical bound on the system performance that we compare to the standard size-unconstrained Shannon capacity. We also determine the effective signal-to-noise ratio (SNR) which strongly depends on the antenna size and experiences an apparent finite-size performance degradation where only a fraction of Shannon capacity can be achieved. We further determine the optimal signaling bandwidth which shows that impedance matching is essential in both narrowband and broadband scenarios. We also examine the achievable rate in presence of interference showing that the size constraint is immaterial in interference-limited scenarios. Finally, our numerical results of the derived achievable rate as function of the antenna size and the SNR reveal new insights for the physically consistent design of radio systems.

cs.IT↗

arXiv2021

Joint Active and Passive Beamforming Design for IRS-Assisted Multi-User MIMO Systems: A VAMP-Based Approach

This paper tackles the problem of joint active and passive beamforming optimization for an intelligent reflective surface (IRS)-assisted multi-user downlink multiple-input multiple-output (MIMO) communication system. We aim to maximize spectral efficiency of the users by minimizing the mean square error (MSE) of the received symbol. For this, a joint optimization problem is formulated under the minimum mean square error (MMSE) criterion. First, block coordinate descent (BCD) is used to decouple the joint optimization into two sub-optimization problems to separately find the optimal active precoder at the base station (BS) and the optimal matrix of phase shifters for the IRS. While the MMSE active precoder is obtained in a closed form, the optimal phase shifters are found iteratively using a modified version (also introduced in this paper) of the vector approximate message passing (VAMP) algorithm. We solve the joint optimization problem for two different models for IRS phase shifts. First, we determine the optimal phase matrix under a unimodular constraint on the reflection coefficients, and then under the constraint when the IRS reflection coefficients are modeled by a reactive load, thereby validating the robustness of the proposed solution. Numerical results are presented to illustrate the performance of the proposed method using multiple channel configurations. The results validate the superiority of the proposed solution as it achieves higher throughput compared to state-of-the-art techniques.

cs.IT↗

arXiv2020

Massive MIMO with Dense Arrays and 1-bit Data Converters

We consider wireless communication systems with compact planar arrays having densely spaced antenna elements in conjunction with one-bit analog-to-digital and digital-to-analog converters (ADCs/DACs). We provide closed-form expressions for the achievable rates with simple linear processing techniques for the uplink as well as the downlink scenarios while taking into account the effects of antenna mutual coupling. In the downlink case, we introduce the concept of non-radiating dithering to combat correlations of the quantization errors. Under higher antenna element density, we show that the performance of the quantized system can be made close to the ideal performance regardless of the operating signal-to-noise ratio.

cs.IT↗

arXiv2020

Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO

We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is key to URA in massive connectivity setups. The proposed scheme relies on a slotted transmission framework but eliminates the need for concatenated coding that was introduced in the context of the coupled compressive sensing (CCS) paradigm. Indeed, all existing works on CCS-based URA rely on an inner/outer tree-based encoder/decoder to stitch the slot-wise recovered sequences. This paper takes a different path by harnessing the nature-provided correlations between the slotwise reconstructed channels of each user in order to put together its decoded sequences. The required slot-wise channel estimates and decoded sequences are first obtained through the hybrid generalized approximate message passing (HyGAMP) algorithm which systematically accommodates the multiantenna-induced group sparsity. Then, a channel correlation-aware clustering framework based on the expectation-maximization (EM) concept is used together with the Hungarian algorithm to find the slotwise optimal assignment matrices by enforcing two clustering constraints that are very specific to the problem at hand. Stitching is then accomplished by associating the decoded sequences to their respective users according to the ensuing assignment matrices. Exhaustive computer simulations reveal that the proposed scheme can bring performance improvements, at high spectral efficiencies, as compared to a state-of-the-art technique that investigates the use of large-scale antenna arrays in the context of massive URA.

cs.IT↗

arXiv2020

Bilinear Generalized Vector Approximate Message Passing

We introduce the bilinear generalized vector approximate message passing (BiG-VAMP) algorithm which jointly recovers two matrices U and V from their noisy product through a probabilistic observation model. BiG-VAMP provides computationally efficient approximate implementations of both max-sum and sumproduct loopy belief propagation (BP). We show how the proposed BiG-VAMP algorithm recovers different types of structured matrices and overcomes the fundamental limitations of other state-of-the-art approaches to the bilinear recovery problem, such as BiG-AMP, BAd-VAMP and LowRAMP. In essence, BiG-VAMP applies to a broader class of practical applications which involve a general form of structured matrices. For the sake of theoretical performance prediction, we also conduct a state evolution (SE) analysis of the proposed algorithm and show its consistency with the asymptotic empirical mean-squared error (MSE). Numerical results on various applications such as matrix factorization, dictionary learning, and matrix completion demonstrate unambiguously the effectiveness of the proposed BiG-VAMP algorithm and its superiority over stateof-the-art algorithms. Using the developed SE framework, we also examine (as one example) the phase transition diagrams of the matrix completion problem, thereby unveiling a low detectability region corresponding to the low signal-to-noise ratio (SNR) regime.

cs.IT↗

arXiv2019

Generalized Approximate Message Passing for Massive MIMO mmWave Channel Estimation with Laplacian Prior

This paper tackles the problem of millimeter-Wave (mmWave) channel estimation in massive MIMO communication systems. A new Bayes-optimal channel estimator is derived using recent advances in the approximate belief propagation (BP) Bayesian inference paradigm. By leveraging the inherent sparsity of the mmWave MIMO channel in the angular domain, we recast the underlying channel estimation problem into that of reconstructing a compressible signal from a set of noisy linear measurements. Then, the generalized approximate message passing (GAMP) algorithm is used to find the entries of the unknown mmWave MIMO channel matrix. Unlike all the existing works on the same topic, we model the angular-domain channel coefficients by Laplacian distributed random variables. Further, we establish the closed-form expressions for the various statistical quantities that need to be updated iteratively by GAMP. To render the proposed algorithm fully automated, we also develop an expectation-maximization (EM) based procedure that can be easily embedded within GAMP's iteration loop in order to learn all the unknown parameters of the underlying Bayesian inference problem. Computer simulations show that the proposed combined EM-GAMP algorithm under a Laplacian prior exhibits improvements both in terms of channel estimation accuracy, achievable rate, and computational complexity as compared to the Gaussian mixture prior that has been advocated in the recent literature. In addition, it is found that the Laplacian prior speeds up the convergence time of GAMP over the entire signal-to-noise ratio (SNR) range.

cs.IT↗

arXiv2019

Angular Parameters Estimation of Multiple Incoherently Distributed Sources Generating Noncircular Signals

We introduce a new method for the estimation of the angular parameters [i.e., central directions of arrival (DOAs) and angular spreads] of multiple non-circular and incoherently-distributed (ID) sources and thoroughly analyze its performance. By decoupling the estimation of the central DOAs from that of the angular spreads, we reduce significantly the complexity of the proposed technique. The latter outperforms most well-known state-of-the-art techniques in terms of estimation accuracy and robustness.

eess.SP↗

arXiv2015

Time Synchronization of Turbo-Coded Square-QAM-Modulated Transmissions: Code-Aided ML Estimator and Closed-Form Cramér-Rao Lower Bounds

This paper introduces a new maximum likelihood (ML) solution for the code-aided (CA) timing recovery problem in square-QAM transmissions and derives, for the very first time, its CA Cramér-Rao lower bounds (CRLBs) in closed-form expressions. By exploiting the full symmetry of square-QAM constellations and further scrutinizing the Gray-coding mechanism, we express the likelihood function (LF) of the system explicitly in terms of the code bits' \textit{a priori} log-likelihood ratios (LLRs). The timing recovery task is then embedded in the turbo iteration loop wherein increasingly accurate estimates for such LLRs are computed from the output of the soft-input soft-output (SISO) decoders and exploited at a per-turbo-iteration basis in order to refine the ML time delay estimate. The latter is then used to better re-synchronize the system, through feedback to the matched filter (MF), so as to obtain more reliable symbol-rate samples for the next turbo iteration. In order to properly benchmark the new CA ML estimator, we also derive for the very first time the closed-form expressions for the exact CRLBs of the underlying turbo synchronization problem. Computer simulations will show that the new closed-form CRLBs coincide exactly with their empirical counterparts evaluated previously using exhaustive Monte-Carlo simulations. They will also show unambiguously the potential performance gains in time synchronization that can be achieved owing to the decoder assistance. Moreover, the new CA ML estimator almost reaches the underlying CA CRLBs, even for small SNRs, thereby confirming its statistical efficiency in practice. It also enjoys significant improvements in computational complexity as compared to the most powerful existing ML solution, namely the combined sum-product and expectation-maximization (SP-EM) algorithm.

cs.IT↗

arXiv2014

Maximum Likelihood SNR Estimation of Linearly-Modulated Signals over Time-Varying Flat-Fading SIMO Channels

In this paper, we tackle for the first time the problem of maximum likelihood (ML) estimation of the signal-to-noise ratio (SNR) parameter over time-varying single-input multiple-output (SIMO) channels. Both the data-aided (DA) and the non-data-aided (NDA) schemes are investigated. Unlike classical techniques where the channel is assumed to be slowly time-varying and, therefore, considered as constant over the entire observation period, we address the more challenging problem of instantaneous (i.e., short-term or local) SNR estimation over fast time-varying channels. The channel variations are tracked locally using a polynomial-in-time expansion. First, we derive in closed-form expressions the DA ML estimator and its bias. The latter is subsequently subtracted in order to obtain a new unbiased DA estimator whose variance and the corresponding Cramér-Rao lower bound (CRLB) are also derived in closed form. Due to the extreme nonlinearity of the log-likelihood function (LLF) in the NDA case, we resort to the expectation-maximization (EM) technique to iteratively obtain the exact NDA ML SNR estimates within very few iterations. Most remarkably, the new EM-based NDA estimator is applicable to any linearly-modulated signal and provides sufficiently accurate soft estimates (i.e., soft detection) for each of the unknown transmitted symbols. Therefore, hard detection can be easily embedded in the iteration loop in order to improve its performance at low to moderate SNR levels. We show by extensive computer simulations that the new estimators are able to accurately estimate the instantaneous per-antenna SNRs as they coincide with the DA CRLB over a wide range of practical SNRs.

stat.AP↗