arXiv subjects

Giuseppe Caire

Publications and source records attributed to Giuseppe Caire.

At least 289 records · Page 16Linked to original sources

arXiv2019

Randomized Channel Sparsifying Hybrid Precoding for FDD Massive MIMO Systems

We propose a novel randomized channel sparsifying hybrid precoding (RCSHP) design to reduce the signaling overhead of channel estimation and the hardware cost and power consumption at the base station (BS), in order to fully harvest benefits of frequency division duplex (FDD) massive multiple-input multiple-output (MIMO) systems. RCSHP allows time-sharing among multiple analog precoders, each serving a compatible user group. The analog precoder is adapted to the channel statistics to properly sparsify the channel for the associated user group, such that the resulting effective channel (product of channel and analog precoder) not only has enough spatial degrees of freedom (DoF) to serve this group of users, but also can be accurately estimated under the limited pilot budget. The digital precoder is adapted to the effective channel based on the duality theory to facilitate the power allocation and exploit the spatial multiplexing gain. We formulate the joint optimization of the time-sharing factors and the associated sets of analog precoders and power allocations as a general utility optimization problem, which considers the impact of effective channel estimation error on the system performance. Then we propose an efficient stochastic successive convex approximation algorithm to provably obtain Karush-Kuhn-Tucker (KKT) points of this problem.

eess.SP↗

arXiv2019

Capacity Scaling of Massive MIMO in Strong Spatial Correlation Regimes

This paper investigates the capacity scaling of multicell massive MIMO systems in the presence of spatially correlated fading. In particular, we focus on the strong spatial correlation regimes where the covariance matrix of each user channel vector has a rank that scales sublinearly with the number of base station antennas, as the latter grows to infinity. We also consider the case where the covariance eigenvectors corresponding to the non-zero eigenvalues span randomly selected subspaces. For this channel model, referred to as the "random sparse angular support" model, we characterize the asymptotic capacity scaling law in the limit of large number of antennas. To achieve the asymptotic capacity results, statistical spatial despreading based on the second-order channel statistics plays a pivotal role in terms of pilot decontamination and interference suppression. A remarkable result is that even when the number of users scales linearly with base station antennas, a linear growth of the capacity with respect to the number of antennas is achievable under the sparse angular support model. We note that the achievable rate lower bound based on massive MIMO "channel hardening", widely used in the massive MIMO literature, yields rather loose results in the strong spatial correlation regimes and may significantly underestimate the achievable rate of massive MIMO. This work therefore considers an alternative bounding technique which is better suited to the strong correlation regimes. In fading channels with sparse angular support, it is further shown that spatial despreading (spreading) in uplink (downlink) has a more prominent impact on the performance of massive MIMO than channel hardening.

cs.IT↗

arXiv2019

Uplink-Downlink Channel Covariance Transformations and Precoding Design for FDD Massive MIMO

A large majority of cellular networks deployed today make use of Frequency Division Duplexing (FDD) where, in contrast with Time Division Duplexing (TDD), the channel reciprocity does not hold and explicit downlink (DL) probing and uplink (UL) feedback are needed in order to achieve spatial multiplexing gain. To support massive MIMO, the overhead incurred by conventional DL probing and UL feedback schemes scales linearly with the number of BS antennas and, therefore, may be very large. In this paper, we present a new approach to achieve a very competitive trade-off between spatial multiplexing gain and probing-feedback overhead in such systems. Our approach is based on two novel methods: (i) an efficient regularization technique based on Deep Neural Networks (DNN) that learns the Angular Spread Function (ASF) of users channels and permits to estimate the DL covariance matrix from the noisy i.i.d. channel observations obtained freely via UL pilots (UL-DL covariance transformation), (ii) a novel "sparsifying precoding" technique that uses the estimated DL covariance matrix from (i) and imposes a controlled sparsity on the DL channel such that given any assigned DL pilot dimension, it is able to find an optimal sparsity level and a corresponding sparsifying precoder for which the "effective" channel vectors after sparsification can be estimated at the BS with a low mean-square error. We compare our proposed DNN-based method in (i) with other methods in the literature via numerical simulations and show that it yields a very competitive performance. We also compare our sparsifying precoder in (ii) with the state-of-the-art statistical beamforming methods under the assumption that those methods also have access to the covariance knowledge in the DL and show that our method yields higher spectral efficiency since it uses in addition the instantaneous channel information after sparsification.

cs.IT↗

arXiv2019

Grant-Free Massive Random Access With a Massive MIMO Receiver

We consider the problem of unsourced random access (U-RA), a grant-free uncoordinated form of random access, in a wireless channel with a massive MIMO base station equipped with a large number $M$ of antennas and a large number of wireless single-antenna devices (users). We consider a block fading channel model where the $M$-dimensional channel vector of each user remains constant over a coherence block containing $L$ signal dimensions in time-frequency. In the considered setting, the number of potential users $K_\text{tot}$ is much larger than $L$ but at each time slot only $K_a \ll K_\text{tot}$ of them are active. Previous results, based on compressed sensing, require that $K_a < L$, which is a bottleneck in massive deployment scenarios such as Internet-of-Things and U-RA. In the context of activity detection it is known that such a limitation can be overcome when the number of base station antennas $M$ is sufficiently large and a covariance based recovery algorithm is employed at the receiver. We show that, in the context of U-RA, the same concept allows to achieve high spectral efficiencies in the order of $\mathcal{O}(L \log L)$, although at an exponentially growing complexity. We show also that a concatenated coding scheme can be used to reduce the complexity to an acceptable level while still achieving total spectral efficiencies in the order of $\mathcal{O}(L/\log L)$.

cs.IT↗

arXiv2019

Structured Channel Covariance Estimation from Limited Samples in Massive MIMO

Obtaining channel covariance knowledge is of great importance in various Multiple-Input Multiple-Output MIMO communication applications, including channel estimation and covariance-based user grouping. In a massive MIMO system, covariance estimation proves to be challenging due to the large number of antennas ($M\gg 1$) employed in the base station and hence, a high signal dimension. In this case, the number of pilot transmissions $N$ becomes comparable to the number of antennas and standard estimators, such as the sample covariance, yield a poor estimate of the true covariance and are undesirable. In this paper, we propose a Maximum-Likelihood (ML) massive MIMO covariance estimator, based on a parametric representation of the channel angular spread function (ASF). The parametric representation emerges from super-resolving discrete ASF components via the well-known MUltiple SIgnal Classification (MUSIC) method plus approximating its continuous component using suitable limited-support density function. We maximize the likelihood function using a concave-convex procedure, which is initialized via a non-negative least-squares optimization problem. Our simulation results show that the proposed method outperforms the state of the art in various estimation quality metrics and for different sample size to signal dimension ($N/M$) ratios.

cs.IT↗

arXiv2019

Machine Learning for Geometrically-Consistent Angular Spread Function Estimation in Massive MIMO

In the spatial channel models used in multi-antenna wireless communications, the propagation from a single-antenna transmitter (e.g., a user) to an M-antenna receiver (e.g., a Base Station) occurs through scattering clusters located in the far field of the receiving antenna array. The Angular Spread Function (ASF) of the corresponding M-dim channel vector describes the angular density of the received signal power at the array. The modern literature on massive MIMO has recognized that the knowledge of covariance matrix of user channel vectors is very useful for various applications such as hybrid digital analog beamforming, pilot decontamination, etc. Therefore, most literature has focused on the estimation of such channel covariance matrices. However, in some applications such as uplink-downlink covariance transformation (for FDD massive MIMO precoding) and channel sounding some form of ASF estimation is required either implicitly or explicitly. It turns out that while covariance estimation is well-known and well-conditioned, the ASF estimation is a much harder problem and is in general ill-posed. In this paper, we show that under additional geometrically-consistent group-sparsity structure on the ASF, which is prevalent in almost all wireless propagation scenarios, one is able to estimate ASF properly. We propose sparse dictionary-based algorithms that promote this group-sparsity structure via suitable regularizations. Since generally it is difficult to capture the notion of group-sparsity through proper regularization, we propose another algorithm based on Deep Neural Networks (DNNs) that learns this structure. We provide numerical simulations to assess the performance of our proposed algorithms. We also compare the results with that of other methods in the literature, where we re-frame those methods in the context of ASF estimation in massive MIMO.

cs.IT↗

arXiv2019

Fully-/Partially-Connected Hybrid Beamforming Architectures for mmWave MU-MIMO

Hybrid digital analog (HDA) beamforming has attracted considerable attention in practical implementation of millimeter wave (mmWave) multiuser multiple-input multiple-output (MU-MIMO) systems due to the low power consumption with respect to its fully digital baseband counterpart. The implementation cost, performance, and power efficiency of HDA beamforming depends on the level of connectivity and reconfigurability of the analog beamforming network. In this paper, we investigate the performance of two typical architectures that can be regarded as extreme cases, namely, the fully-connected (FC) and the one-stream-per-subarray (OSPS) architectures. In the FC architecture each RF antenna port is connected to all antenna elements of the array, while in the OSPS architecture the RF antenna ports are connected to disjoint subarrays. We jointly consider the initial beam acquisition and data communication phases, such that the latter takes place by using the beam direction information obtained by the former. We use the state-of-the-art beam alignment (BA) scheme previously proposed by the authors and consider a family of MU-MIMO precoding schemes well adapted to the beam information extracted from the BA phase. We also evaluate the power efficiency of the two HDA architectures taking into account the power dissipation at different hardware components as well as the power backoff under typical power amplifier constraints. Numerical results show that the two architectures achieve similar sum spectral efficiency, while the OSPS architecture is advantageous with respect to the FC case in terms of hardware complexity and power efficiency, at the sole cost of a slightly longer BA time-to-acquisition due to its reduced beam angle resolution.

cs.IT↗

arXiv2019

On the Effectiveness of OTFS for Joint Radar and Communication

We consider a joint radar estimation and communication system using orthogonal time frequency space (OTFS) modulation. The scenario is motivated by vehicular applications where a vehicle equipped with a mono-static radar wishes to communicate data to its target receiver, while estimating parameters of interest related to this receiver. In a point-to-point communication setting over multi-path time-frequency selective channels, we study the joint radar and communication system from two perspectives, i.e., the radar estimation at the transmitter as well as the symbol detection at the receiver. For the radar estimation part, we derive an efficient approximated Maximum Likelihood algorithm and the corresponding Cramér- Rao lower bound for range and velocity estimation. Numerical examples demonstrate that multi-carrier digital formats such as OTFS can achieve as accurate radar estimation as state-of-the-art radar waveforms such as frequency-modulated continuous wave (FMCW). For the data detection part, we focus on separate detection and decoding and consider a soft-output detector that exploits efficiently the channel sparsity in the Doppler-delay domain. We quantify the detector performance in terms of its pragmatic capacity, i.e. the achievable rate of the channel induced by the signal constellation and the detector soft output. Simulations show that the proposed scheme outperforms concurrent state-of-the-art solutions. Overall, our work shows that a suitable digitally modulated waveform enables to efficiently operate joint radar and communication by achieving full information rate of the modulation and near-optimal radar estimation performance. Furthermore, OTFS appears to be particularly suited to the scope.

cs.IT↗

arXiv2019

On the Optimality of Treating Inter-Cell Interference as Noise: Downlink Cellular Networks and Uplink-Downlink Duality

We consider the information-theoretic optimality of treating inter-cell interference as noise (multi-cell TIN) in downlink cellular networks. We focus on scenarios modeled by the Gaussian interfering broadcast channel (IBC), comprising $K$ mutually interfering Gaussian broadcast channels (BCs), each formed by a base station communicating independent messages to an arbitrary number of users. We establish a new power allocation duality between the IBC and its dual interfering multiple access channel (IMAC), which entails that the corresponding generalized degrees-of-freedom regions achieved through multi-cell TIN and power control (TINA regions) for both networks are identical. As by-products of this duality, we obtain an explicit characterization of the IBC TINA region from a previously established characterization of the IMAC TINA region; and identify a multi-cell convex-TIN regime in which the IBC TINA region is a polyhedron (hence convex) without the need for time-sharing. We then identify a smaller multi-cell TIN regime in which the IBC TINA region is optimal and multi-cell TIN achieves the entire capacity region of the IBC, up to a constant gap. This is accomplished by deriving a new genie-aided outer bound for the IBC, that reveals a novel BC-type order that holds amongst users in each constituent BC (or cell) under inter-cell interference, which in turn is not implied by previously known BC-type orders (i.e. degraded, less noisy and more capable orders). The multi-cell TIN regime that we identify for the IBC coincides with a corresponding multi-cell TIN regime previously identified for the IMAC, hence establishing a comprehensive uplink-downlink duality of multi-cell TIN in the GDoF (and approximate capacity) sense.

cs.IT↗

arXiv2019

On the Fundamental Limits of MIMO Massive Access Communication

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC often assumes fixed and small number of the users. In this paper, we consider the massive access channel with multiple antennas system, where the base station (BS) with multiple receiving antennas serves the users in a single cell. The magnitude of users is assumed to grow unbounded with $n$. We investigate the achievable region of MIMO massive access channel, where among the total users, an unknown subset referred to active users may transmit data periodically. The asymptotic active user identification cost is also quantified. With the theoretical analysis, it was shown that given finite number of the receiving antennas, the individual rate for each user can be formulated as the sum rate multiplied by some specific factors, which correspond to the allocation of sum capacity. The successive decoding does not apply due to the interferences from growing unbounded users. Theoretical analysis shows that successive decoding works only when the number of receiving antennas goes to infinity with the increasing codelength.

cs.IT↗

arXiv2019

On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications

Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN), that includes a Macro-cell Base Station (MBS) co-located with the content server, several cache-equipped Small-cell Base Stations (SBSs), and many users without caches. Some users are served directly by the MBS broadcast downlink, while other users are served by the SBSs. The SBSs can also exchange data via rounds of direct communication via a side channel, referred to as "sidelink". For this novel Fog-RAN model, the fundamental tradeoff among (a) the amount of cache memory at the SBSs, (b) the load on the downlink (from MBS to directly served users and SBSs), and (c) the aggregate load on the sidelink is studied, under the standard worst-case demand scenario. Several existing results are recovered as special cases of this network model and byproduct results of independent interest are given. Finally, the role of topology-aware versus topology-agnostic caching is discussed.

cs.IT↗

arXiv2019

Data-Aided Secure Massive MIMO Transmission under the Pilot Contamination Attack

In this paper, we study the design of secure communication for time division duplex multi-cell multi-user massive multiple-input multiple-output (MIMO) systems with active eavesdropping. We assume that the eavesdropper actively attacks the uplink pilot transmission and the uplink data transmission before eavesdropping the downlink data transmission of the users. We exploit both the received pilots and the received data signals for uplink channel estimation. We show analytically that when the number of transmit antennas and the length of the data vector both tend to infinity, the signals of the desired user and the eavesdropper lie in different eigenspaces of the received signal matrix at the base station provided that their signal powers are different. This finding reveals that decreasing (instead of increasing) the desired user's signal power might be an effective approach to combat a strong active attack from an eavesdropper. Inspired by this observation, we propose a data-aided secure downlink transmission scheme and derive an asymptotic achievable secrecy sum-rate expression for the proposed design. For the special case of a single-cell single-user system with independent and identically distributed fading, the obtained expression reveals that the secrecy rate scales logarithmically with the number of transmit antennas. This is the same scaling law as for the achievable rate of a single-user massive MIMO system in the absence of eavesdroppers. Numerical results indicate that the proposed scheme achieves significant secrecy rate gains compared to alternative approaches based on matched filter precoding with artificial noise generation and null space transmission.

cs.IT↗

arXiv2019

Routing-Based Delivery in Combination-Type Networks with Random Topology

The coded caching scheme proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages to users equipped with caches and it is known to be optimal within a constant factor. This work extends this caching scheme to two-hop relay networks with one main server with access to a library of $N$ files, and $H$ relays communicating with $K$ users with cache, each of which is connected to a random subset of relays. This topology can be considered as a generalized version of a celebrated family of networks, referred to as combination networks. Our approach is simply based on routing MAN packets through the network. The optimization of the routing can be formulated as a Linear Program (LP). In addition, to reduce the computation complexity, a dynamic algorithm is proposed to approach the LP solution. Numerical simulations show that the proposed scheme outperforms the existing caching schemes for this class of networks.

cs.IT↗

arXiv2019

WiFi-Based Indoor Localization via Multi-Band Splicing and Phase Retrieval

We study the problem of indoor localization using commodity WiFi channel state information (CSI) measurements. The accuracy of methods developed to address this problem is limited by the overall bandwidth used by the WiFi device as well as various types of signal distortions imposed by the underlying hardware. In this paper, we propose a localization method that performs channel impulse response (CIR) estimation by splicing measured CSI over multiple WiFi bands. In order to overcome hardware-induced phase distortions, we propose a phase retrieval (PR) scheme that only uses CSI magnitude values to estimate the CIR. To achieve high localization accuracy, the PR scheme involves a sparse recovery step, which exploits the fact that the CIR is sparse over the delay domain, due to the small number of contributing signal paths in an indoor environment. Simulation results indicate that our approach outperforms the state of the art by an order of magnitude (cm-level localization accuracy) for more than 90% of the trials and for various SNR regimes.

cs.NI↗

arXiv2019

On the Fundamental Limits of MIMO Massive Multiple Access Channels

In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access channels (MIMO mMAC) is investigated. While joint typicality decoding is utilized to establish the achievability of capacity region for conventional MAC with fixed number of users, the technique is not directly applicable for MIMO mMAC. Instead, an information-theoretic approach based on Gallager's error exponent analysis is exploited to characterize the \textcolor[rgb]{0,0,0}{finite dimension region} of MIMO mMAC. Theoretical results reveal that the finite dimension region of MIMO mMAC is dominated by sum rate constraint only, and the individual user rate is determined by a specific factor that corresponds to the allocation of sum rate. The rate in conventional MAC is not achievable with massive multiple access, which is due to the fact that successive interference cancellation cannot guarantee an arbitrary small error decoding probability for MIMO mMAC. The results further imply that, asymptotically, the individual user rate is independent of the number of transmit antennas, and channel hardening makes the individual user rate close to that when only statistic knowledge of channel is available at receiver. The finite dimension region of MIMO mMAC is a generalization of the symmetric rate in Chen \emph{et al.} (2017).

cs.IT↗

arXiv2019

Joint State Sensing and Communication over Memoryless Multiple Access Channels

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The scenario is motivated by a joint radar and communication system where the radar and data applications share the same bandwidth. An achievable capacity-distortion tradeoff region is derived that outperforms a resource-sharing scheme through a binary erasure MAC with binary states.

cs.IT↗

arXiv2019

Performance Analysis of Joint Radar and Communication using OFDM and OTFS

We consider a joint radar estimation and communication system using orthogonal frequency division multiplexing (OFDM) and orthogonal time frequency space (OTFS) modulations. The scenario is motivated by vehicular applications where a vehicle equipped with a mono-static radar wishes to communicate data to its target receiver, while estimating parameters of interest related to this receiver. By focusing on the case of a single target, we derive the maximum likelihood (ML) estimator and the Cramér-Rao lower bound on joint velocity and range estimation. Numerical examples demonstrate that both digital modulation formats can achieve as accurate range/velocity estimation as state-of-the-art radar waveforms such as frequency modulated continuous wave (FMCW) while sending digital information at their full achievable rate. We conclude that it is possible to obtain significant data transmission rate without compromising the radar estimation capabilities of the system.

cs.IT↗

arXiv2019

Joint User Selection, Power Allocation, and Precoding Design with Imperfect CSIT for Multi-Cell MU-MIMO Downlink Systems

In this paper, a new optimization framework is presented for the joint design of user selection, power allocation, and precoding in multi-cell multi-user multiple-input multiple-output (MU-MIMO) systems when imperfect channel state information at transmitter (CSIT) is available. By representing the joint optimization variables in a higher-dimensional space, the weighted sum-spectral efficiency maximization is formulated as the maximization of the product of Rayleigh quotients. Although this is still a non-convex problem, a computationally efficient algorithm, referred to as generalized power iteration precoding (GPIP), is proposed. The algorithm converges to a stationary point (local maximum) of the objective function and therefore it guarantees the first-order optimality of the solution. By adjusting the weights in the weighted sum-spectral efficiency, the GPIP yields a joint solution for user selection, power allocation, and downlink precoding. The GPIP is also extended to a multi-cell scenario, where cooperative base stations perform joint user selection and design their precoding vectors by sharing global yet imperfect CSIT within the cooperative BSs. System-level simulations show the gains of the proposed approach with respect to conventional user selection and linear downlink precoding.

cs.IT↗