arXiv subjects

Erik G. Larsson

Publications and source records attributed to Erik G. Larsson.

At least 109 records · Page 6Linked to original sources

arXiv2022

Activity Detection in Distributed MIMO: Distributed AMP via Likelihood Ratio Fusion

We develop a new algorithm for activity detection for grant-free multiple access in distributed multiple-input multiple-output (MIMO). The algorithm is a distributed version of the approximate message passing (AMP) based on a soft combination of likelihood ratios computed independently at multiple access points. The underpinning theoretical basis of our algorithm is a new observation that we made about the state evolution in the AMP. Specifically, with a minimum mean-square error denoiser, the state maintains a block-diagonal structure whenever the covariance matrices of the signals have such a structure. We show by numerical examples that the algorithm outperforms competing schemes from the literature.

cs.IT↗

arXiv2022

Energy-Efficient Power Allocation for an Underlay Spectrum Sharing RadioWeaves Network

RadioWeaves network operates a large number of distributed antennas using cell-free architecture to provide high data rates and support a large number of users. Operating this network in an energy-efficient manner in the limited available spectrum is crucial. Therefore, we consider energy efficiency (EE) maximization of a RadioWeaves network that shares spectrum with a collocated primary network in underlay mode. To simplify the problem, we lower bound the non-convex EE objective function to form a convex problem. We then propose a downlink power allocation policy that maximizes the EE of the secondary RadioWeaves network subject to power constraint at each access point and interference constraint at each primary user. Our numerical results investigate the secondary system's performance in interference, power, and EE constrained regimes with correlated fading channels. Furthermore, they show that the proposed power allocation scheme performs significantly better than the simpler equal power allocation scheme.

cs.IT↗

arXiv2022

Physical Layer Abstraction Model for RadioWeaves

RadioWeaves, in which distributed antennas with integrated radio and compute resources serve a large number of users, is envisioned to provide high data rates in next generation wireless systems. In this paper, we develop a physical layer abstraction model to evaluate the performance of different RadioWeaves deployment scenarios. This model helps speed up system-level simulators of the RadioWeaves and is made up of two blocks. The first block generates a vector of signal-to-interference-plus-noise ratios (SINRs) corresponding to each coherence block, and the second block predicts the packet error rate corresponding to the SINRs generated. The vector of SINRs generated depends on different parameters such as the number of users, user locations, antenna configurations, and precoders. We have also considered different antenna gain patterns, such as omni-directional and directional microstrip patch antennas. Our model exploits the benefits of exponential effective SINR mapping (EESM). We study the robustness and accuracy of the EESM for RadioWeaves.

cs.IT↗

arXiv2022

Downlink Power Allocation in Massive MIMO via Deep Learning: Adversarial Attacks and Training

The successful emergence of deep learning (DL) in wireless system applications has raised concerns about new security-related challenges. One such security challenge is adversarial attacks. Although there has been much work demonstrating the susceptibility of DL-based classification tasks to adversarial attacks, regression-based problems in the context of a wireless system have not been studied so far from an attack perspective. The aim of this paper is twofold: (i) we consider a regression problem in a wireless setting and show that adversarial attacks can break the DL-based approach and (ii) we analyze the effectiveness of adversarial training as a defensive technique in adversarial settings and show that the robustness of DL-based wireless system against attacks improves significantly. Specifically, the wireless application considered in this paper is the DL-based power allocation in the downlink of a multicell massive multi-input-multi-output system, where the goal of the attack is to yield an infeasible solution by the DL model. We extend the gradient-based adversarial attacks: fast gradient sign method (FGSM), momentum iterative FGSM, and projected gradient descent method to analyze the susceptibility of the considered wireless application with and without adversarial training. We analyze the deep neural network (DNN) models performance against these attacks, where the adversarial perturbations are crafted using both the white-box and black-box attacks.

cs.LG↗

arXiv2022

Combining Reciprocity and CSI Feedback in MIMO Systems

Reciprocity-based time-division duplex (TDD) Massive MIMO (multiple-input multiple-output) systems utilize channel estimates obtained in the uplink to perform precoding in the downlink. However, this method has been criticized of breaking down, in the sense that the channel estimates are not good enough to spatially separate multiple user terminals, at low uplink reference signal signal-to-noise ratios, due to insufficient channel estimation quality. Instead, codebook-based downlink precoding has been advocated for as an alternative solution in order to bypass this problem. We analyze this problem by considering a "grid-of-beams world" with a finite number of possible downlink channel realizations. Assuming that the terminal accurately can detect the downlink channel, we show that in the case where reciprocity holds, carefully designing a mapping between the downlink channel and the uplink reference signals will perform better than both the conventional TDD Massive MIMO and frequency-division duplex (FDD) Massive MIMO approach. We derive elegant metrics for designing this mapping, and further, we propose algorithms that find good sequence mappings.

cs.IT↗

arXiv2022

Analog MIMO Communication for One-shot Distributed Principal Component Analysis

A fundamental algorithm for data analytics at the edge of wireless networks is distributed principal component analysis (DPCA), which finds the most important information embedded in a distributed high-dimensional dataset by distributed computation of a reduced-dimension data subspace, called principal components (PCs). In this paper, to support one-shot DPCA in wireless systems, we propose a framework of analog MIMO transmission featuring the uncoded analog transmission of local PCs for estimating the global PCs. To cope with channel distortion and noise, two maximum-likelihood (global) PC estimators are presented corresponding to the cases with and without receive channel state information (CSI). The first design, termed coherent PC estimator, is derived by solving a Procrustes problem and reveals the form of regularized channel inversion where the regulation attempts to alleviate the effects of both receiver noise and data noise. The second one, termed blind PC estimator, is designed based on the subspace channel-rotation-invariance property and computes a centroid of received local PCs on a Grassmann manifold. Using the manifold-perturbation theory, tight bounds on the mean square subspace distance (MSSD) of both estimators are derived for performance evaluation. The results reveal simple scaling laws of MSSD concerning device population, data and channel signal-to-noise ratios (SNRs), and array sizes. More importantly, both estimators are found to have identical scaling laws, suggesting the dispensability of CSI to accelerate DPCA. Simulation results validate the derived results and demonstrate the promising latency performance of the proposed analog MIMO

cs.IT↗

arXiv2022

Optimal MIMO Combining for Blind Federated Edge Learning with Gradient Sparsification

We provide the optimal receive combining strategy for federated learning in multiple-input multiple-output (MIMO) systems. Our proposed algorithm allows the clients to perform individual gradient sparsification which greatly improves performance in scenarios with heterogeneous (non i.i.d.) training data. The proposed method beats the benchmark by a wide margin.

cs.IT↗

arXiv2022

Data Size-Aware Downlink Massive MIMO: A Session-Based Approach

This letter considers the development of transmission strategies for the downlink of massive multiple-input multiple-output networks, with the objective of minimizing the completion time of the transmission. Specifically, we introduce a session-based scheme that splits time into sessions and allocates different rates in different sessions for the different users. In each session, one user is selected to complete its transmission and will not join subsequent sessions, which results in successively lower levels of interference when moving from one session to the next. An algorithm is developed to assign users and allocate transmit power that minimizes the completion time. Numerical results show that our proposed session-based scheme significantly outperforms conventional non-session-based schemes.

cs.IT↗

arXiv2022

Participatory Sensing for Localization of a GNSS Jammer

GNSS receivers are vulnerable to jamming and spoofing attacks, and numerous such incidents have been reported worldwide in the last decade. It is important to detect attacks fast and localize attackers, which can be hard if not impossible without dedicated sensing infrastructure. The notion of participatory sensing, or crowdsensing, is that a large ensemble of voluntary contributors provides the measurements, rather than relying on dedicated sensing infrastructure. This work considers embedded GNSS receivers to provide measurements for participatory jamming detection and localization. Specifically, this work proposes a novel jamming localization algorithm, based on participatory sensing, that exploits AGC and C/N_0 estimates from commercial GNSS receivers. The proposed algorithm does not require knowledge of the jamming power nor of the channels, but automatically estimates all parameters. The algorithm is shown to outperform similar state-of-the-art localization algorithms in relevant scenarios.

eess.SP↗

arXiv2021

MRT-based Joint Unicast and Multigroup Multicast Transmission in Massive MIMO Systems

We study joint unicast and multigroup multicast transmission in single-cell massive multiple-input-multiple-output (MIMO) systems, under maximum ratio transmission. For the unicast transmission, the objective is to maximize the weighted sum spectral efficiency (SE) of the unicast user terminals (UTs) and for the multicast transmission the objective is to maximize the minimum SE of the multicast UTs. These two problems are coupled to each other in a conflicting manner, due to their shared power resource and interference. To address this, we formulate a multiobjective optimization problem (MOOP). We derive the Pareto boundary of the MOOP analytically and determine the values of the system parameters to achieve any desired Pareto optimal point. Moreover, we prove that the Pareto region is convex, hence the system should serve the unicast and multicast UTs at the same time-frequency resource.

cs.IT↗

arXiv2021

Human and Machine Type Communications can Coexist in Uplink Massive MIMO Systems

Future cellular networks are expected to support new communication paradigms such as machine-type communication (MTC) services along with human-type communication (HTC) services. This requires base stations to serve a large number of devices in relatively short channel coherence intervals which renders allocation of orthogonal pilot sequence per-device approaches impractical. Furthermore, the stringent power constraints, place-and-play type connectivity and various data rate requirements of MTC devices make it impossible for the traditional cellular architecture to accommodate MTC and HTC services together. Massive multiple-input-multiple-output (MaMIMO) technology has the potential to allow the coexistence of HTC and MTC services, thanks to its inherent spatial multiplexing properties and low transmission power requirements. In this work, we investigate the performance of a single cell under a shared physical channel assumption for MTC and HTC services and propose a novel scheme for sharing the time-frequency resources. The analysis reveals that MaMIMO can significantly enhance the performance of such a setup and allow the inclusion of MTC services into the cellular networks without requiring additional resources.

cs.IT↗

arXiv2021

NOMA Versus Massive MIMO in Rayleigh Fading

This paper compares the sum rates and rate regions achieved by power-domain NOMA (non-orthogonal multiple access) and standard massive MIMO (multiple-input multiple-output) techniques. We prove analytically that massive MIMO always outperforms NOMA in i.i.d.~Rayleigh fading channels, if a sufficient number of antennas are used at the base stations. The simulation results show that the crossing point occurs already when having 20-30 antennas, which is far less than what is considered for the next generation cellular networks.

cs.IT↗

arXiv2021

BeamSync: Over-The-Air Carrier Synchronization in Distributed RadioWeaves

In a distributed multi-antenna system, multiple geographically separated transmit nodes communicate simultaneously to a receive node. Synchronization of these nodes is essential to achieve a good performance at the receiver. RadioWeaves is a new paradigm of cell-free massive MIMO array deployment using distributed multi-antenna panels in indoor environments. In this paper, we study the carrier frequency synchronization problem in distributed RadioWeave panels. We propose a novel, over-the-air synchronization protocol, which we call as BeamSync, to synchronize all the different multi-antenna transmit panels. We also show that beamforming the synchronization signal in the dominant direction of the channel between the panels is optimal and the synchronization performance is significantly better than traditional beamforming techniques.

cs.IT↗

arXiv2021

Distributed Computation of A Posteriori Bit Likelihood Ratios in Cell-Free Massive MIMO

This paper presents a novel strategy to decentralize the soft detection procedure in an uplink cell-free massive multiple-input-multiple-output network. We propose efficient approaches to compute the a posteriori probability-per-bit, exactly or approximately when having a sequential fronthaul. More precisely, each access point (AP) in the network computes partial sufficient statistics locally, fuses it with received partial statistics from another AP, and then forwards the result to the next AP. Once the sufficient statistics reach the central processing unit, it performs the soft demodulation by computing the log-likelihood ratio (LLR) per bit, and then a channel decoding algorithm (e.g., a Turbo decoder) is utilized to decode the bits. We derive the distributed computation of LLR analytically.

cs.IT↗

arXiv2021

RadioWeaves for Extreme Spatial Multiplexing in Indoor Environments

With the advances in virtual and augmented reality, gaming applications, and entertainment, certain indoor scenarios will require vastly higher capacity than what can be delivered by 5G. In this paper, we focus on massive MIMO for indoor environments. We provide a case study of the distributed deployment of the antenna elements over the walls of a room and not restricting the antenna separation to be half the wavelength. This is a new paradigm of massive MIMO antenna deployment, introduced under the name RadioWeaves. We investigate different antenna deployment scenarios in line of sight communication. We observe that the RadioWeaves deployment can spatially separate users much better than a conventional co-located deployment, which outweighs the losses caused by grating lobes and thus saves a lot on transmit power. Through simulations, we show that the RadioWeaves technology can provide high rates to multiple users by spending very little power at the transmitter compared to a co-located deployment.

cs.IT↗

arXiv2021

Clustering-Based Activity Detection Algorithms for Grant-Free Random Access in Cell-Free Massive MIMO

Future wireless networks need to support massive machine type communication (mMTC) where a massive number of devices accesses the network and massive MIMO is a promising enabling technology. Massive access schemes have been studied for co-located massive MIMO arrays. In this paper, we investigate the activity detection in grant-free random access for mMTC in cell-free massive MIMO networks using distributed arrays. Each active device transmits a non-orthogonal pilot sequence to the access points (APs) and the APs send the received signals to a central processing unit (CPU) for joint activity detection. The maximum likelihood device activity detection problem is formulated and algorithms for activity detection in cell-free massive MIMO are provided to solve it. The simulation results show that the macro-diversity gain provided by the cell-free architecture improves the activity detection performance compared to co-located architecture when the coverage area is large.

cs.IT↗

arXiv2021

Model-based and Data-driven Approaches for Downlink Massive MIMO Channel Estimation

We study downlink channel estimation in a multi-cell Massive multiple-input multiple-output (MIMO) system operating in time-division duplex. The users must know their effective channel gains to decode their received downlink data. Previous works have used the mean value as the estimate, motivated by channel hardening. However, this is associated with a performance loss in non-isotropic scattering environments. We propose two novel estimation methods that can be applied without downlink pilots. The first method is model-based and asymptotic arguments are utilized to identify a connection between the effective channel gain and the average received power during a coherence interval. The second method is data-driven and trains a neural network to identify a mapping between the available information and the effective channel gain. Both methods can be utilized for any channel distribution and precoding. For the model-aided method, we derive all expressions in closed form for the case when maximum ratio or zero-forcing precoding is used. We compare the proposed methods with the state-of-the-art using the normalized mean-squared error and spectral efficiency (SE). The results suggest that the two proposed methods provide better SE than the state-of-the-art when there is a low level of channel hardening, while the performance difference is relatively small with the uncorrelated channel model.

cs.IT↗

arXiv2021

Energy-Efficient Massive MIMO for Serving Multiple Federated Learning Groups

With its privacy preservation and communication efficiency, federated learning (FL) has emerged as a learning framework that suits beyond 5G and towards 6G systems. This work looks into a future scenario in which there are multiple groups with different learning purposes and participating in different FL processes. We give energy-efficient solutions to demonstrate that this scenario can be realistic. First, to ensure a stable operation of multiple FL processes over wireless channels, we propose to use a massive multiple-input multiple-output network to support the local and global FL training updates, and let the iterations of these FL processes be executed within the same large-scale coherence time. Then, we develop asynchronous and synchronous transmission protocols where these iterations are asynchronously and synchronously executed, respectively, using the downlink unicasting and conventional uplink transmission schemes. Zero-forcing processing is utilized for both uplink and downlink transmissions. Finally, we propose an algorithm that optimally allocates power and computation resources to save energy at both base station and user sides, while guaranteeing a given maximum execution time threshold of each FL iteration. Compared to the baseline schemes, the proposed algorithm significantly reduces the energy consumption, especially when the number of base station antennas is large.

cs.IT↗