arXiv subjects

Giuseppe Caire

Publications and source records attributed to Giuseppe Caire.

At least 199 records · Page 11Linked to original sources

arXiv2022

Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks

We consider a user-centric scalable cell-free massive MIMO network with a total of $LM$ distributed remote radio unit antennas serving $K$ user equipments (UEs). Many works in the current literature assume $LM\gg K$, enabling high UE data rates but also leading to a system not operating at its maximum performance in terms of sum throughput. We provide a new perspective on cell-free massive MIMO networks, investigating rate allocation and the UE density regime in which the network makes use of its full capability. The UE density $K$ approximately equal to $\frac{LM}{2}$ is the range in which the system reaches the largest sum throughput. In addition, there is a significant fraction of UEs with relatively low throughput, when serving $K>\frac{LM}{2}$ UEs simultaneously. We propose to reduce the number of active UEs per time slot, such that the system does not operate at ``full load'', and impose throughput fairness among all users via a scheduler designed to maximize a suitably defined concave componentwise non-decreasing network utility function. Our numerical simulations show that we can tune the system such that a desired distribution of the UE throughput, depending on the utility function, is achieved.

cs.IT↗

arXiv2022

On the Effective Usage of Priors in RSS-based Localization

In this paper, we study the localization problem in dense urban settings. In such environments, Global Navigation Satellite Systems fail to provide good accuracy due to low likelihood of line-of-sight (LOS) links between the receiver (Rx) to be located and the satellites, due to the presence of obstacles like the buildings. Thus, one has to resort to other technologies, which can reliably operate under non-line-of-sight (NLOS) conditions. Recently, we proposed a Received Signal Strength (RSS) fingerprint and convolutional neural network-based algorithm, LocUNet, and demonstrated its state-of-the-art localization performance with respect to the widely adopted k-nearest neighbors (kNN) algorithm, and to state-of-the-art time of arrival (ToA) ranging-based methods. In the current work, we first recognize LocUNet's ability to learn the underlying prior distribution of the Rx position or Rx and transmitter (Tx) association preferences from the training data, and attribute its high performance to these. Conversely, we demonstrate that classical methods based on probabilistic approach, can greatly benefit from an appropriate incorporation of such prior information. Our studies also numerically prove LocUNet's close to optimal performance in many settings, by comparing it with the theoretically optimal formulations.

eess.SP↗

arXiv2022

RIS-Based Steerable Beamforming Antenna with Near-Field Eigenmode Feeder

We present a novel, power and hardware efficient, antenna system leveraging the eigenmodes of the over-the-air propagation matrix from an active multi-antenna feeder (AMAF) to a large reflective intelligent surface (RIS), both configured as standard linear arrays and placed in the near field of each other. We demonstrate the flexibility of the proposed architecture by showing that it is capable of generating radiation patterns for multiple applications such as very narrow beams with low side lobes for space-division multiple access communications, wide-angle beams for short range automotive sensing and sectorial beaconing, and monopulse patterns for radar angular tracking. A key parameter in our design is the AMAF-RIS distance which must be optimized and it is generally much less than the Rayleigh distance. For a given AMAF aperture, the optimal AMAF-RIS distance increases as a function of the RIS size. The AMAF-RIS loss is compensated almost exactly by the larger aperture gain of the RIS leading to almost constant RIS gain with increasing RIS sizes. This allows to choose different beam angular selectivities with the same center beam gain. Active RF amplification is done at the AMAF only, thus resulting in a much higher power efficiency and much lower hardware complexity than conventional phased arrays with same beamforming performance.

eess.SP↗

arXiv2022

Subspace-Based Pilot Decontamination in User-Centric Scalable Cell-Free Wireless Networks

We consider a cell-free wireless system operated in Time Division Duplex (TDD) mode with user-centric clusters of remote radio units (RUs). Since the uplink pilot dimensions per channel coherence slot is limited, co-pilot users might incur mutual pilot contamination. In the current literature, it is assumed that the long-term statistical knowledge of all user channels is available. This enables Minimum Mean-Square Error channel estimation or simplified dominant subspace projection, which achieves significant pilot decontamination under certain assumptions on the channel covariance matrices. However, estimating the channel covariance matrix or even just its dominant subspace at all RUs forming a user cluster is not an easy task. In fact, if not properly designed, a piloting scheme for such long-term statistics estimation will also be subject to the contamination problem. In this paper, we propose a new channel subspace estimation scheme explicitly designed for cell-free wireless networks. Our scheme is based on 1) a sounding reference signal (SRS) using latin squares wideband frequency hopping, and 2) a subspace estimation method based on robust Principal Component Analysis (R-PCA). The SRS hopping scheme ensures that for any user and any RU participating in its cluster, only a few pilot measurements will contain strong co-pilot interference. These few heavily contaminated measurements are (implicitly) eliminated by R-PCA, which is designed to regularize the estimation and discount the ``outlier'' measurements. Our simulation results show that the proposed scheme achieves almost perfect subspace knowledge, which in turns yields system performance very close to that with ideal channel state information, thus essentially solving the problem of pilot contamination in cell-free user-centric TDD wireless networks.

cs.IT↗

arXiv2022

On the Capacity of "Beam-Pointing" Channels with Block Memory and Feedback: The Binary Case

Millimeter-wave (mmWave) communication is one of the key enablers for 5G systems as it provides larger system bandwidth and the possibility of packing numerous antennas in a small form factor for highly directional communication. In order to materialize the potentially very high beamforming gain, the transmitter and receiver beams need to be aligned. Practically, the Angle-of-Departure (AoD) remains almost constant over numerous consecutive time slots, which presents a state-dependent channel with memory. In addition, the backscatter signal can be modeled as a (causal) generalized feedback. The capacity of such channels with memory is generally an open problem in information theory. Towards solving this difficult problem, we consider a "toy model", consisting of a binary state-dependent (BSD) channel with in-block memory (iBM) [1] and one unit-delayed feedback. The capacity of this model under the peak transmission cost constraint is characterized by an iterative closed-form expression. We propose a capacity-achieving scheme where the transmitted signal carries information and meanwhile uniformly and randomly probes the beams with the help of feedback.

cs.IT↗

arXiv2022

Overloaded Pilot Assignment with Pilot Decontamination for Cell-Free Systems

The pilot contamination in cell-free massive multiple-input-multiple-output (CF-mMIMO) must be addressed for accommodating a large number of users. In previous works, we have investigated a decontamination method called subspace projection (SP). The SP separates interference from co-pilot users by using the orthogonality of the principal components of the users' channel subspaces. Non-overloaded pilot assignment (PA), where each radio unit (RU) does not assign the same pilot to different users, limits the spectral efficiency (SE) of the system, since SP channel estimation is able to deal with co-pilot users that have nearly orthogonal subspaces. Motivated by this limitation, this paper introduces overloaded PA methods adjusted for the decontamination in order to improve the sum SE of CF systems. Numerical simulations show that the overloaded PA methods give higher SE than that of non-overloaded PA at a high user density scenario.

cs.IT↗

arXiv2022

A Beam-Space Active Sensing Scheme for Integrated Communication and Sensing Applications

In this paper, we develop an active sensing strategy for a millimeter wave (mmWave) band Integrated Sensing and Communication (ISAC) system adopting a realistic hybrid digital-analog (HDA) architecture. To maintain a desired SNR level, initial beam acquisition (BA) must be established prior to data transmission. In the considered setup, a Base Station (BS) Tx transmits data via a digitally modulated waveform and a co-located radar receiver simultaneously performs radar estimation from the backscattered signal. In this BA scheme, a single common data stream is broadcast over a wide angular sector such that the radar receiver can detect the presence of not yet acquired users and perform coarse parameter estimation (angle of arrival, time of flight, and Doppler). As a result of the HDA architecture, we consider the design of multi-block adaptive RF-domain 'reduction matrices' (from antennas to RF chains) at the radar receiver, to achieve a compromise between the exploration capability in the angular domain and the directivity of the beamforming patterns. Our numerical results demonstrate that the proposed approach is able to reliably detect multiple targets while significantly reducing the initial acquisition time.

eess.SP↗

arXiv2022

SD-Based Low-Complexity Precoder Design for Gaussian MIMO Wiretap Channels

This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and Eve jointly decode their interested messages, we aim to maximize the sum secrecy rate of the system by precoder design. Although this problem could be solved by first using the iterative majorization minimization (MM) based algorithm to get a sequence of convex log-determinant optimization subproblems and then using some general tools, e.g., the interior point method, to deal with each subproblem, this strategy involves quite high computational complexity. Therefore, we propose a simultaneous diagonalization based low-complexity (SDLC) method to maximize the secrecy rate of a simple one-user wiretap channel, and then use this method to iteratively optimize the covariance matrix of each user. Simulation results show that in contrast to the existing approaches, the SDLC scheme achieves similar secrecy performance but requires much lower complexity.

cs.IT↗

arXiv2022

Orthogonal Time Frequency Space Modulation -- Part I: Fundamentals and Challenges Ahead

This letter is the first part of a three-part tutorial on orthogonal time frequency space (OTFS) modulation, which is a promising candidate waveform for future wireless networks. This letter introduces and compares two popular implementations of OTFS modulation, namely the symplectic finite Fourier transform (SFFT)- and discrete Zak transform (DZT)-based architectures. Based on these transceiver architectures, fundamental concepts of OTFS modulation, including the delay-Doppler (DD) domain, DD domain information multiplexing, and its potential benefits, are discussed. Finally, the challenges ahead for OTFS modulation are highlighted. Parts II and III of this tutorial on OTFS modulation focus on transceiver designs and integrated sensing and communication (ISAC), respectively.

cs.IT↗

arXiv2022

Orthogonal Time Frequency Space Modulation -- Part II: Transceiver Designs

The fundamental concepts and challenges of orthogonal time frequency space (OTFS) modulation have been reviewed in Part I of this three-part tutorial. In this second part, we provide an overview of the state-of-the-art transceiver designs for OTFS systems, with a particular focus on the cyclic prefix (CP) design, window design, pulse shaping, channel estimation, and signal detection. Furthermore, we analyze the performance of OTFS modulation, including the diversity gain and the achievable rate. Specifically, comparative simulations are presented to evaluate the error performance of different OTFS detection schemes, and the advantages of coded OTFS systems over coded orthogonal frequency-division multiplexing (OFDM) systems are investigated.

cs.IT↗

arXiv2022

Orthogonal Time Frequency Space Modulation -- Part III: ISAC and Potential Applications

The first two parts of this tutorial on orthogonal time frequency space (OTFS) modulation have discussed the fundamentals of delay-Doppler (DD) domain communications as well as some advanced technologies for transceiver design. In this letter, we will present an OTFS-based integrated sensing and communications (ISAC) system, which is regarded as an enabling technology in next generation wireless communications. In particular, we illustrate the sensing as well as the communication models for OTFS-ISAC systems. Next, we show that benefiting from time-invariant DD channels, the sensing parameters can be used for inferring the communication channels, leading to an efficient transmission scheme. As both functionalities are realized in the same DD domain, we briefly discuss several promising benefits of OTFS-based ISAC systems, which have not been completely unveiled yet. Finally, a range of potential applications of OTFS for the future wireless networks will be highlighted.

cs.IT↗

arXiv2022

SwiftAgg+: Achieving Asymptotically Optimal Communication Loads in Secure Aggregation for Federated Learning

We propose SwiftAgg+, a novel secure aggregation protocol for federated learning systems, where a central server aggregates local models of $N \in \mathbb{N}$ distributed users, each of size $L \in \mathbb{N}$, trained on their local data, in a privacy-preserving manner. SwiftAgg+ can significantly reduce the communication overheads without any compromise on security, and achieve optimal communication loads within diminishing gaps. Specifically, in presence of at most $D=o(N)$ dropout users, SwiftAgg+ achieves a per-user communication load of $(1+\mathcal{O}(\frac{1}{N}))L$ symbols and a server communication load of $(1+\mathcal{O}(\frac{1}{N}))L$ symbols, with a worst-case information-theoretic security guarantee, against any subset of up to $T=o(N)$ semi-honest users who may also collude with the curious server. Moreover, the proposed SwiftAgg+ allows for a flexible trade-off between communication loads and the number of active communication links. In particular, for $T<N-D$ and for any $K\in\mathbb{N}$, SwiftAgg+ can achieve the server communication load of $(1+\frac{T}{K})L$ symbols, and per-user communication load of up to $(1+\frac{T+D}{K})L$ symbols, where the number of pair-wise active connections in the network is $\frac{N}{2}(K+T+D+1)$.

cs.IT↗

arXiv2022

FDD Massive MIMO Channel Training Optimal Rate Distortion Bounds and the Efficiency of one-shot Schemes

We study the problem of providing channel state information (CSI) at the transmitter in multi-user massive MIMO systems operating in frequency division duplexing (FDD). The wideband MIMO channel is a vector-valued random process correlated in time, space (antennas), and frequency (subcarriers). The base station (BS) broadcasts periodically beta_tr pilot symbols from its M antenna ports to K single-antenna users (UEs). Correspondingly, the K UEs send feedback messages about their channel state using beta_fb symbols in the uplink (UL). Using results from remote rate-distortion theory, we show that, as snr reaches infty, the optimal feedback strategy achieves a channel state estimation mean squared error (MSE) that behaves as Theta(1) if beta_tr < r and as Theta(snr^(-alpha)) when beta_tr >=r, where alpha = min(beta_fb/r, 1), where r is the rank of the channel covariance matrix. The MSE-optimal rate-distortion strategy implies encoding of long sequences of channel states, which would yield completely stale CSI and therefore poor multiuser precoding performance. Hence, we consider three practical one-shot CSI strategies with minimum one-slot delay and analyze their large-SNR channel estimation MSE behavior. These are: (1) digital feedback via entropy-coded scalar quantization (ECSQ), (2) analog feedback (AF), and (3) local channel estimation at the UEs and digital feedback. These schemes have different requirements in terms of knowledge of the channel statistics at the UE and at the BS. In particular, the latter strategy requires no statistical knowledge and is closely inspired by a CSI feedback scheme currently proposed in 3GPP standardization.

cs.IT↗

arXiv2022

A Note on Fourier-Motzkin Elimination with Three Eliminating Variables

In this note, we show how difficult the brute-force Fourier-Motzkin elimination is, even in a simple case with three eliminating variables. Specifically, we first give a theorem, which plays quite an important role in the study of information-theoretic security for a multiple access wiretap (MAC-WT) channel, and then prove it for the case with three users by directly using the Fourier-Motzkin procedure. It is shown that large amounts of inequalities are generated in the elimination procedure while most of them are redundant. Actually, the number of generated inequalities grows doubly exponentially with the number of users or eliminating variables. It thus becomes unmanageable to directly prove the theorem in this brute-force way. Besides the great complexity, another disadvantage of the direct strategy is that it works only if the number of users is given. Obviously, this makes the strategy inappropriate for the proof of the theorem since it is a general result for any number of users. It is thus urgent and challenging to generally prove the theorem.

cs.IT↗

arXiv2022

Beam-Space MIMO Radar for Joint Communication and Sensing with OTFS Modulation

Motivated by automotive applications, we consider joint radar sensing and data communication for a system operating at millimeter wave (mmWave) frequency bands, where a Base Station (BS) is equipped with a co-located radar receiver and sends data using the Orthogonal Time Frequency Space (OTFS) modulation format. We consider two distinct modes of operation. In Discovery mode, a single common data stream is broadcast over a wide angular sector. The radar receiver must detect the presence of not yet acquired targets and perform coarse estimation of their parameters (angle of arrival, range, and velocity). In Tracking mode, the BS transmits multiple individual data streams to already acquired users via beamforming, while the radar receiver performs accurate estimation of the aforementioned parameters. Due to hardware complexity and power consumption constraints, we consider a hybrid digital-analog architecture where the number of RF chains and A/D converters is significantly smaller than the number of antenna array elements. In this case, a direct application of the conventional MIMO radar approach is not possible. Consequently, we advocate a beam-space approach where the vector observation at the radar receiver is obtained through a RF-domain beamforming matrix operating the dimensionality reduction from antennas to RF chains. Under this setup, we propose a likelihood function-based scheme to perform joint target detection and parameter estimation in Discovery, and high-resolution parameter estimation in Tracking mode, respectively. Our numerical results demonstrate that the proposed approach is able to reliably detect multiple targets while closely approaching the Cramer-Rao Lower Bound (CRLB) of the corresponding parameter estimation problem.

eess.SP↗

arXiv2022

Distributed Information Bottleneck for a Primitive Gaussian Diamond Channel with Rayleigh Fading

This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and Rayleigh fading. Due to the bottleneck constraint, it is impossible for the relays to inform the destination node of the perfect channel state information (CSI) in each realization. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node knows the CSI and the relays can cooperate with each other, and also three achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed achievable schemes can come close to the upper bound on a wide range of relevant system parameters.

cs.IT↗

arXiv2022

Coded Caching for Two-Dimensional Multi-Access Networks

This paper studies a novel multi-access coded caching (MACC) model in the two-dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC model proposed by Hachem et al. The 2D MACC model is formed by a server containing $N$ files, $K_1\times K_2$ cache-nodes with $M$ files located at a grid with $K_1$ rows and $K_2$ columns, and $K_1\times K_2$ cache-less users where each user is connected to $L^2$ nearby cache-nodes. The server is connected to the users through an error-free shared link, while the users can retrieve the cached content of the connected cache-nodes without cost. Our objective is to minimize the worst-case transmission load over all possible users' demands. In this paper, we first propose a grouping scheme for the case where $K_1$ and $K_2$ are divisible by $L$. By partitioning the cache-nodes and users into $L^2$ groups such that no two users in the same group share any cache-node, we use the shared-link coded caching scheme proposed by Maddah-Ali and Niesen for each group. Then for any model parameters satisfying $\min\{K_1,K_2\}>L$, we propose a transformation approach which constructs a 2D MACC scheme from two classes of 1D MACC schemes in vertical and horizontal projections, respectively. As a result, we can construct 2D MACC schemes that achieve maximum local caching gain and improved coded caching gain, compared to the baseline scheme by a direct extension from 1D MACC schemes.

cs.IT↗

arXiv2022

Optimal User Load and Energy Efficiency in User-Centric Cell-Free Wireless Networks

Cell-free massive MIMO is a variant of multiuser MIMO and massive MIMO, in which the total number of antennas $LM$ is distributed among the $L$ remote radio units (RUs) in the system, enabling macrodiversity and joint processing. Due to pilot contamination and system scalability, each RU can only serve a limited number of users. Obtaining the optimal number of users simultaneously served on one resource block (RB) by the $L$ RUs regarding the sum spectral efficiency (SE) is not a simple challenge though, as many of the system parameters are intertwined. For example, the dimension $τ_p$ of orthogonal Demodulation Reference Signal (DMRS) pilots limits the number of users that an RU can serve. Thus, depending on $τ_p$, the optimal user load yielding the maximum sum SE will vary. Another key parameter is the users' uplink transmit power $P^{\rm ue}_{\rm tx}$, where a trade-off between users in outage, interference and energy inefficiency exists. We study the effect of multiple parameters in cell-free massive MIMO on the sum SE and user outage, as well as the performance of different levels of RU antenna distribution. We provide extensive numerical investigations to illuminate the behavior of the system SE with respect to the various parameters, including the effect of the system load, i.e., the number of active users to be served on any RB. The results show that in general a system with many RUs and few RU antennas yields the largest sum SE, where the benefits of distributed antennas reduce in very dense networks.

cs.IT↗