Researcher profile

H. Vincent Poor

H. Vincent Poor contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

147works

0followers

26topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Arithmetic Complexity of Solutions of the Dirichlet Problem

The classical Dirichlet problem on the unit disk can be solved by different numerical approaches. The two most common and popular approaches are the integration of the associated Poisson integral and, by applying Dirichlet's principle, solving a particular minimization problem. For practical use, these procedures need to be implemented on concrete computing platforms. This paper studies the realization of these procedures on Turing machines, the fundamental model for any digital computer. We show that on this computing platform both approaches to solve Dirichlet's problem yield generally a solution that is not Turing computable, even if the boundary function is computable. Then the paper provides a precise characterization of this non-computability in terms of the Zheng--Weihrauch hierarchy. For both approaches, we derive a lower and an upper bound on the degree of non-computability in the Zheng--Weihrauch hierarchy.

preprint2026arXiv

Confusions and Erasures of Error-Bounded Block Decoders with Finite Blocklength

This paper investigates two distinct types of block errors - undetected errors (confusions) and erasures - in additive white Gaussian noise (AWGN) channels with error-bounded block decoders operating in the finite blocklength (FBL) regime. While block error rate (BLER) is a common metric, it does not distinguish between confusions and erasures, which can have significantly different impacts in cross-layer protocol design, despite upper-layer protocols universally assuming physical (PHY) errors manifest as packet erasures rather than undetected corruptions - an assumption lacking rigorous PHY-layer validation. We present a systematic analysis of confusions and erasures under BLER-constrained maximum likelihood (ML) decoding. Through sphere-packing analysis, we provide analytical bounds for both block confusion and erasure probabilities, and derive the sensitivities of these bounds to blocklength and signal-to-noise ratio (SNR). To the best of our knowledge, this is the first study on this topic in the FBL regime. Our findings provide theoretical validation for the block erasure channel abstraction commonly assumed in medium access control (MAC) and network layer protocols, confirming that, for practical FBL codes, block confusions are negligible compared to block erasures, especially at large blocklengths and high SNR.

preprint2026arXiv

Frontiers of Generative AI for Network Optimization: Theories, Limits, and Visions

While interest in the application of generative AI (GenAI) in network optimization has surged in recent years, its rapid progress has often overshadowed critical limitations intrinsic to generative models that remain insufficiently examined in existing literature. This survey provides a comprehensive review and critical analysis of GenAI in network optimization. We focus on the two dominant paradigms of GenAI including generative diffusion models (GDMs) and large pre-trained models (LPTMs), and organize our discussion around a categorization we introduce, dividing network optimization problems into two primary formulations: one-shot optimization and Markov decision process (MDP). We first trace key works, including foundational contributions from the AI community, and categorize current efforts in network optimization. We also review frontier applications of GDMs and LPTMs in other networking tasks, providing additional context. Furthermore, we present theoretical generalization bounds for GDMs in both one-shot and MDP settings, offering insights into the fundamental factors affecting model performance. Most importantly, we reflect on the overestimated perception of GenAI's general capabilities and caution against the all-in-one illusion it may convey. We highlight critical limitations, including difficulties in constraint satisfying, limited concept understanding, and the inherent probabilistic nature of outputs. We also propose key future directions, such as bridging the gap between generation and optimization. Although they are increasingly integrated in implementations, they differ fundamentally in both objectives and underlying mechanisms, necessitating a deeper understanding of their theoretical connections. Ultimately, this survey aims to provide a structured overview and a deeper insight into the strengths, limitations, and potential of GenAI in network optimization.

preprint2026arXiv

Large Language Models over Networks: Collaborative Intelligence under Resource Constraints

Large language models (LLMs) are transforming society, powering applications from smartphone assistants to autonomous driving. Yet cloud-based LLM services alone cannot serve a growing class of applications, including those operating under intermittent connectivity, sub-second latency budgets, data-residency constraints, or sustained high-volume inference. On-device deployment is in turn constrained by limited computation and memory. No single endpoint can deliver high-quality service across this spectrum. This article focuses on collaborative intelligence, a paradigm in which multiple independent LLMs distributed across device and cloud endpoints collaborate at the task level through natural language or structured messages. Such collaboration strives for superior response quality under heterogeneous resource constraints spanning computation, memory, communication, and cost across network tiers. We present collaborative inference along two complementary and composable dimensions: vertical device-cloud collaboration and horizontal multi-agent collaboration, which can be combined into hybrid topologies in practice. We then examine learning to collaborate, addressing the training of routing policies and the development of cooperative capabilities among LLMs. Finally, we identify open research challenges including scaling under resource heterogeneity and trustworthy collaborative intelligence.

preprint2026arXiv

Optimizing Server Placement for Vertical Federated Learning in Dynamic Edge/Fog Networks

We investigate the control and optimization of vertical federated learning (VFL), a class of distributed machine learning (ML) methods in which edge/fog devices contain separate data features, in dynamic edge/fog networks. Owing to heterogeneous data features and hardware across edge/fog networks, devices' contributions to VFL vary substantially, and, moreover, dynamic edge/fog networks can lead to the permanent exit or entry of select data features. In this setting, our proposed methodology, server controlled VFL in dynamic networks (SC-DN), first establishes the existence of a global first-order stationary point for every global round, and then leverages this result to jointly optimize ML model training and resource consumption based on four key control variables: (i) server placement, (ii) device-to-server transmit power, (iii) local device processor frequency, and (iv) local training iterations per global round. The resulting optimization formulation contains coupled variables as well as numerous forms of logarithmic constraints which we show is a mixed-integer signomial program, an NP-hard problem, and for which we develop a general solver. Finally, via experiments on both image and multi-modal datasets, we show that our methodology demonstrates superior classification/regression performance and resource consumption savings than even greedy methodologies.

preprint2025arXiv

Beam-Squint-Aided Hierarchical Sensing for Integrated Sensing and Communications with Uniform Planar Arrays

In this paper, we propose a novel hierarchical sensing framework for wideband integrated sensing and communications with uniform planar arrays (UPAs). Leveraging the beam-squint effect inherent in wideband orthogonal frequency-division multiplexing (OFDM) systems, the proposed framework enables efficient two-dimensional angle estimation through a structured multi-stage sensing process. Specifically, the sensing procedure first searches over the elevation angle domain, followed by a dedicated search over the azimuth angle domain given the estimated elevation angles. In each stage, true-time-delay lines and phase shifters of the UPA are jointly configured to cover multiple grid points simultaneously across OFDM subcarriers. To enable accurate and efficient target localization, we formulate the angle estimation problem as a sparse signal recovery problem and develop a modified matching pursuit algorithm tailored to the hierarchical sensing architecture. Additionally, we design power allocation strategies that minimize total transmit power while meeting performance requirements for both sensing and communication. Numerical results demonstrate that the proposed framework achieves superior performance over conventional sensing methods with reduced sensing power.

preprint2025arXiv

Time-Modulated Intelligent Reflecting Surfaces for Integrated Sensing, Communication and Security: A Generative AI Design Framework

We propose a novel approach to achieve physical layer security for integrated sensing and communication (ISAC) systems operating in the presence of targets that may be eavesdroppers. The system is aided by a time-modulated intelligent reflecting surface (TM-IRS), which is configured to preserve the integrity of the transmitted data at one or more legitimate communication users (CUs) while making them appear scrambled in all other directions. The TM-IRS design leverages a generative flow network (GFlowNet) framework to learn a stochastic policy that samples high-performing TM-IRS configurations from a vast discrete parameter space. Specifically, we begin by formulating the achievable sum rate for the legitimate CUs and the beampattern gain toward the target direction, based on which we construct reward functions for GFlowNets that jointly capture both communication and sensing performance. The TM-IRS design is modeled as a deterministic Markov decision process (MDP), where each terminal state corresponds to a complete configuration of TM-IRS parameters. GFlowNets, parametrized by deep neural networks are employed to learn a stochastic policy that samples TM-IRS parameter sets with probability proportional to their associated reward. Experimental results demonstrate the effectiveness of the proposed GFlowNet-based method in integrating sensing, communication and security simultaneously, and also exhibit significant sampling efficiency as compared to the exhaustive combinatorial search and enhanced robustness against the existing benchmarks of physical layer security.

preprint2024arXiv

A Tutorial on Extremely Large-Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications

Extremely large-scale multiple-input-multiple-output (XL-MIMO), which offers vast spatial degrees of freedom, has emerged as a potentially pivotal enabling technology for the sixth generation (6G) of wireless mobile networks. With its growing significance, both opportunities and challenges are concurrently manifesting. This paper presents a comprehensive survey of research on XL-MIMO wireless systems. In particular, we introduce four XL-MIMO hardware architectures: uniform linear array (ULA)-based XL-MIMO, uniform planar array (UPA)-based XL-MIMO utilizing either patch antennas or point antennas, and continuous aperture (CAP)-based XL-MIMO. We comprehensively analyze and discuss their characteristics and interrelationships. Following this, we introduce several electromagnetic characteristics and general distance boundaries in XL-MIMO. Given the distinct electromagnetic properties of near-field communications, we present a range of channel models to demonstrate the benefits of XL-MIMO. We further discuss and summarize signal processing schemes for XL-MIMO. It is worth noting that the low-complexity signal processing schemes and deep learning empowered signal processing schemes are reviewed and highlighted to promote the practical implementation of XL-MIMO. Furthermore, we explore the interplay between XL-MIMO and other emergent 6G technologies. Finally, we outline several compelling research directions for future XL-MIMO wireless communication systems.

preprint2023arXiv

Acceleration Estimation of Signal Propagation Path Length Changes for Wireless Sensing

As indoor applications grow in diversity, wireless sensing, vital in areas like localization and activity recognition, is attracting renewed interest. Indoor wireless sensing relies on signal processing, particularly channel state information (CSI) based signal parameter estimation. Nonetheless, regarding reflected signals induced by dynamic human targets, no satisfactory algorithm yet exists for estimating the acceleration of dynamic path length change (DPLC), which is crucial for various sensing tasks in this context. Hence, this paper proposes DP-AcE, a CSI-based DPLC acceleration estimation algorithm. We first model the relationship between the phase difference of adjacent CSI measurements and the DPLC's acceleration. Unlike existing works assuming constant velocity, DP-AcE considers both velocity and acceleration, yielding a more accurate and objective representation. Using this relationship, an algorithm combining scaling with Fourier transform is proposed to realize acceleration estimation. We evaluate DP-AcE via the acceleration estimation and acceleration-based fall detection with the collected CSI. Experimental results reveal that, using distance as the metric, DP-AcE achieves a median acceleration estimation percentage error of 4.38%. Furthermore, in multi-target scenarios, the fall detection achieves an average true positive rate of 89.56% and a false positive rate of 11.78%, demonstrating its importance in enhancing indoor wireless sensing capabilities.

preprint2023arXiv

Active RIS vs. Passive RIS: Which Will Prevail in 6G?

As a revolutionary paradigm for controlling wireless channels, reconfigurable intelligent surfaces (RISs) have emerged as a candidate technology for future 6G networks. However, due to the "multiplicative fading" effect, the existing passive RISs only achieve limited capacity gains in many scenarios with strong direct links. In this paper, the concept of active RISs is proposed to overcome this fundamental limitation. Unlike passive RISs that reflect signals without amplification, active RISs can amplify the reflected signals via amplifiers integrated into their elements. To characterize the signal amplification and incorporate the noise introduced by the active components, we develop and verify the signal model of active RISs through the experimental measurements based on a fabricated active RIS element. Based on the verified signal model, we further analyze the asymptotic performance of active RISs to reveal the substantial capacity gain they provide for wireless communications. Finally, we formulate the sum-rate maximization problem for an active RIS aided multi-user multiple-input single-output (MU-MISO) system and a joint transmit beamforming and reflect precoding scheme is proposed to solve this problem. Simulation results show that, in a typical wireless system, passive RISs can realize only a limited sum-rate gain of 22%, while active RISs can achieve a significant sum-rate gain of 130%, thus overcoming the "multiplicative fading" effect.

preprint2023arXiv

Asymptotic Learning Requirements for Stealth Attacks on Linearized State Estimation

Information-theoretic stealth attacks are data injection attacks that minimize the amount of information acquired by the operator about the state variables, while simultaneously limiting the Kullback-Leibler divergence between the distribution of the measurements under attack and the distribution under normal operation with the aim of controling the probability of detection. For Gaussian distributed state variables, attack construction requires knowledge of the second order statistics of the state variables, which is estimated from a finite number of past realizations using a sample covariance matrix. Within this framework, the attack performance is studied for the attack construction with the sample covariance matrix. This results in an analysis of the amount of data required to learn the covariance matrix of the state variables used on the attack construction. The ergodic attack performance is characterized using asymptotic random matrix theory tools, and the variance of the attack performance is bounded. The ergodic performance and the variance bounds are assessed with simulations on IEEE test systems.

preprint2023arXiv

Impact of Channel Models on Performance Characterization of RIS-Assisted Wireless Systems

The performance characterization of communication systems assisted by large reconfigurable intelligent surfaces (RISs) significantly depends on the adopted models for the underlying channels. Under unrealistic channel models, the system performance may be over- or under-estimated which yields inaccurate conclusions for the system design. In this paper, we review five channel models that are chosen to progressively improve the modeling accuracy for large RISs. For each channel model, we highlight the underlying assumptions, its advantages, and its limitations. We compare the system performance under the aforementioned channel models using RIS configuration algorithms from the literature and a new scalable algorithm proposed in this paper specifically for the configuration of extremely large RISs.

preprint2022arXiv

6G for Vehicle-to-Everything (V2X) Communications: Enabling Technologies, Challenges, and Opportunities

We are on the cusp of a new era of connected autonomous vehicles with unprecedented user experiences, tremendously improved road safety and air quality, highly diverse transportation environments and use cases, as well as a plethora of advanced applications. Realizing this grand vision requires a significantly enhanced vehicle-to-everything (V2X) communication network which should be extremely intelligent and capable of concurrently supporting hyper-fast, ultra-reliable, and low-latency massive information exchange. It is anticipated that the sixth-generation (6G) communication systems will fulfill these requirements of the next-generation V2X. In this article, we outline a series of key enabling technologies from a range of domains, such as new materials, algorithms, and system architectures. Aiming for truly intelligent transportation systems, we envision that machine learning will play an instrumental role for advanced vehicular communication and networking. To this end, we provide an overview on the recent advances of machine learning in 6G vehicular networks. To stimulate future research in this area, we discuss the strength, open challenges, maturity, and enhancing areas of these technologies.

preprint2022arXiv

A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence

A common way of characterizing minimax estimators in point estimation is by moving the problem into the Bayesian estimation domain and finding a least favorable prior distribution. The Bayesian estimator induced by a least favorable prior, under mild conditions, is then known to be minimax. However, finding least favorable distributions can be challenging due to inherent optimization over the space of probability distributions, which is infinite-dimensional. This paper develops a dimensionality reduction method that allows us to move the optimization to a finite-dimensional setting with an explicit bound on the dimension. The benefit of this dimensionality reduction is that it permits the use of popular algorithms such as projected gradient ascent to find least favorable priors. Throughout the paper, in order to make progress on the problem, we restrict ourselves to Bayesian risks induced by a relatively large class of loss functions, namely Bregman divergences.

preprint2022arXiv

A Joint Learning and Communications Framework for Federated Learning over Wireless Networks

In this paper, the problem of training federated learning (FL) algorithms over a realistic wireless network is studied. In particular, in the considered model, wireless users execute an FL algorithm while training their local FL models using their own data and transmitting the trained local FL models to a base station (BS) that will generate a global FL model and send it back to the users. Since all training parameters are transmitted over wireless links, the quality of the training will be affected by wireless factors such as packet errors and the availability of wireless resources. Meanwhile, due to the limited wireless bandwidth, the BS must select an appropriate subset of users to execute the FL algorithm so as to build a global FL model accurately. This joint learning, wireless resource allocation, and user selection problem is formulated as an optimization problem whose goal is to minimize an FL loss function that captures the performance of the FL algorithm. To address this problem, a closed-form expression for the expected convergence rate of the FL algorithm is first derived to quantify the impact of wireless factors on FL. Then, based on the expected convergence rate of the FL algorithm, the optimal transmit power for each user is derived, under a given user selection and uplink resource block (RB) allocation scheme. Finally, the user selection and uplink RB allocation is optimized so as to minimize the FL loss function. Simulation results show that the proposed joint federated learning and communication framework can reduce the FL loss function value by up to 10% and 16%, respectively, compared to: 1) An optimal user selection algorithm with random resource allocation and 2) a standard FL algorithm with random user selection and resource allocation.

preprint2022arXiv

Achievable Information-Energy Region in the Finite Block-Length Regime with Finite Constellations

This paper characterizes an achievable information-energy region of simultaneous information and energy transmission over an additive white Gaussian noise channel. This analysis is performed in the finite block-length regime with finite constellations. More specifically, a method for constructing a family of codes is proposed and the set of achievable tuples of information rate, energy rate, decoding error probability (DEP) and energy outage probability (EOP) is characterized. Using existing converse results, it is shown that the construction is information rate, energy rate, and EOP optimal. The achieved DEP is, however, sub-optimal.

preprint2022arXiv

Active RISs: Signal Modeling, Asymptotic Analysis, and Beamforming Design

Reconfigurable intelligent surfaces (RISs) have emerged as a candidate technology for future 6G networks. However, due to the "multiplicative fading" effect, the existing passive RISs only achieve a negligible capacity gain in environments with strong direct links. In this paper, the concept of active RISs is studied to overcome this fundamental limitation. Unlike the existing passive RISs that reflect signals without amplification, active RISs can amplify the reflected signals via amplifiers integrated into their elements. To characterize the signal amplification and incorporate the noise introduced by the active components, we verify the signal model of active RISs through the experimental measurements on a fabricated active RIS element. Based on the verified signal model, we formulate the sum-rate maximization problem for an active RIS aided multi-user multiple-input single-output (MU-MISO) system and a joint transmit precoding and reflect beamforming algorithm is proposed to solve this problem. Simulation results show that, in a typical wireless system, the existing passive RISs can realize only a negligible sum-rate gain of 3%, while the active RISs can achieve a significant sum-rate gain of 62%, thus overcoming the "multiplicative fading" effect. Finally, we develop a 64-element active RIS aided wireless communication prototype, and the significant gain of active RISs is validated by field test.

preprint2022arXiv

An Indirect Rate-Distortion Characterization for Semantic Sources: General Model and the Case of Gaussian Observation

A new source model, which consists of an intrinsic state part and an extrinsic observation part, is proposed and its information-theoretic characterization, namely its rate-distortion function, is defined and analyzed. Such a source model is motivated by the recent surge of interest in the semantic aspect of information: the intrinsic state corresponds to the semantic feature of the source, which in general is not observable but can only be inferred from the extrinsic observation. There are two distortion measures, one between the intrinsic state and its reproduction, and the other between the extrinsic observation and its reproduction. Under a given code rate, the tradeoff between these two distortion measures is characterized by the rate-distortion function, which is solved via the indirect rate-distortion theory and is termed as the semantic rate-distortion function of the source. As an application of the general model and its analysis, the case of Gaussian extrinsic observation is studied, assuming a linear relationship between the intrinsic state and the extrinsic observation, under a quadratic distortion structure. The semantic rate-distortion function is shown to be the solution of a convex programming programming problem with respect to an error covariance matrix, and a reverse water-filling type of solution is provided when the model further satisfies a diagonalizability condition.

preprint2022arXiv

An Information-Theoretic View of Mixed-Delay Traffic in 5G and 6G

Fifth generation mobile communication systems (5G) have to accommodate both Ultra-Reliable Low-Latency Communication (URLLC) and enhanced Mobile Broadband (eMBB) services. While, eMBB applications support high data rates, URLLC services aim at guaranteeing low-latencies and high-reliabilities. eMBB and URLLC services are scheduled on the same frequency band, where the different latency requirements of the communications render the coexistence challenging. In this survey, we review, from an information theoretic perspective, coding schemes that simultaneously accommodate URLLC and eMBB transmissions and show that they outperform traditional scheduling approaches. Various communication scenarios are considered, including point-to-point channels, broadcast channels, interference networks, cellular models, and cloud radio access networks (C-RANs). The main focus is on the set of rate pairs that can simultaneously be achieved for URLLC and eMBB messages, which well captures the tension between the two types of communications. We also discuss finite-blocklength results where the measure of interest is the set of error probability pairs that can simultaneously be achieved on the two communication regimes.

preprint2022arXiv

Approximation-based Threshold Optimization from Single Antenna to Massive SIMO Authentication

In a wireless sensor network, data from various sensors are gathered to estimate the system-state of the process system. However, adversaries aim at distorting the system-state estimate, for which they may infiltrate sensors or position additional devices in the environment. To authenticate the received process values, the integrity of the measurements from different sensors can be evaluated jointly with the temporal integrity of channel measurements from each sensor. For this purpose, we design a security protocol, in which Kalman filters are used to predict the system-state and the channel-state values, and the received data are authenticated by a hypothesis test. We theoretically analyze the adversarial success probability and the reliability rate obtained in the hypothesis test in two ways, based on a chi-square approximation and on a Gaussian approximation. The two approximations are exact for small and large data vectors, respectively. The Gaussian approximation is suitable for analyzing massive single-input multiple-output (SIMO) setups. To obtain additional insights, the approximation is further adapted for the case of channel hardening, which occurs in massive SIMO fading channels. As adversaries always look for the weakest point of a system, a time-constant security level is required. To provide such a service, the approximations are used to propose time-varying threshold values for the hypothesis test, which approximately attain a constant security level. Numerical results show that a constant security level can only be achieved by a time-varying threshold choice, while a constant threshold value leads to a time-varying security level.

preprint2022arXiv

Beamforming Design for the Performance Optimization of Intelligent Reflecting Surface Assisted Multicast MIMO Networks

In this paper, the problem of maximizing the sum of data rates of all users in an intelligent reflecting surface (IRS)-assisted millimeter wave multicast multiple-input multiple-output communication system is studied. In the considered model, one IRS is deployed to assist the communication from a multiantenna base station (BS) to the multi-antenna users that are clustered into several groups. Our goal is to maximize the sum rate of all users by jointly optimizing the transmit beamforming matrices of the BS, the receive beamforming matrices of the users, and the phase shifts of the IRS. To solve this non-convex problem, we first use a block diagonalization method to represent the beamforming matrices of the BS and the users by the phase shifts of the IRS. Then, substituting the expressions of the beamforming matrices of the BS and the users, the original sum-rate maximization problem can be transformed into a problem that only needs to optimize the phase shifts of the IRS. To solve the transformed problem, a manifold method is used. Simulation results show that the proposed scheme can achieve up to 28.6% gain in terms of the sum rate of all users compared to the algorithm that optimizes the hybrid beamforming matrices of the BS and the users using our proposed scheme and randomly determines the phase shifts of the IRS.

preprint2022arXiv

Block Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications

Low-rate and short-packet transmissions are important for ultra-reliable low-latency communications (URLLC). In this paper, we put forth a new family of sparse superposition codes for URLLC, called block orthogonal sparse superposition (BOSS) codes. We first present a code construction method for the efficient encoding of BOSS codes. The key idea is to construct codewords by the superposition of the orthogonal columns of a dictionary matrix with a sequential bit mapping strategy. We also propose an approximate maximum a posteriori probability (MAP) decoder with two stages. The approximate MAP decoder reduces the decoding latency significantly via a parallel decoding structure while maintaining a comparable decoding complexity to the successive cancellation list (SCL) decoder of polar codes. Furthermore, to gauge the code performance in the finite-blocklength regime, we derive an exact analytical expression for block-error rates (BLERs) for single-layered BOSS codes in terms of relevant code parameters. Lastly, we present a cyclic redundancy check aided-BOSS (CA-BOSS) code with simple list decoding to boost the code performance. Our experiments verify that CA-BOSS with the simple list decoder outperforms CA-polar codes with SCL decoding in the low-rate and finite-blocklength regimes while achieving the finite-blocklength capacity upper bound within one dB of signal-to-noise ratio.

preprint2022arXiv

Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties

The capacity of finite state channels (FSCs) with feedback has been shown to be a limit of a sequence of multi-letter expressions. Despite many efforts, a closed-form single-letter capacity characterization is unknown to date. In this paper, the feedback capacity is studied from a fundamental algorithmic point of view by addressing the question of whether or not the capacity can be algorithmically computed. To this aim, the concept of Turing machines is used, which provides fundamental performance limits of digital computers. It is shown that the feedback capacity of FSCs is not Banach-Mazur computable and therefore not Borel-Turing computable. As a consequence, it is shown that either achievability or converse is not Banach-Mazur computable, which means that there are computable FSCs for which it is impossible to find computable tight upper and lower bounds. Furthermore, it is shown that the feedback capacity cannot be characterized as the maximization of a finite-letter formula of entropic quantities.

preprint2022arXiv

Channel Estimation and Multipath Diversity Reception for RIS-Empowered Broadband Wireless Systems Based on Cyclic-Prefixed Single-Carrier Transmission

In this paper, a cyclic-prefixed single-carrier (CPSC) transmission scheme with phase shift keying (PSK) signaling is presented for broadband wireless communications systems empowered by a reconfigurable intelligent surface (RIS). In the proposed CPSC-RIS, the RIS is configured according to the transmitted PSK symbols such that different cyclically delayed versions of the incident signal are created by the RIS to achieve multipath diversity. A practical and efficient channel estimator is developed for CPSC-RIS and the mean square error of the channel estimation is expressed in closed-form. We analyze the bit error rate (BER) performance of CPSC-RIS over frequency-selective Nakagami-$m$ fading channels. An upper bound on the BER is derived by assuming the maximum-likelihood detection. Furthermore, by resorting to the concept of index modulation (IM), we propose an extension of CPSC-RIS, termed CPSC-RIS-IM, which enhances the spectral efficiency. In addition to conventional constellation information of PSK symbols, CPSC-RIS-IM uses the full permutations of cyclic delays caused by the RIS to carry information. A sub-optimal receiver is designed for CPSC-RIS-IM to aim at low computational complexity. Our simulation results in terms of BER corroborate the performance analysis and the superiority of CPSC-RIS(-IM) over the conventional CPSC without an RIS and orthogonal frequency division multiplexing with an RIS.

preprint2022arXiv

Cognitive Radio-Inspired Rate-Splitting Multiple Access for Semi-Grant-Free Transmissions

In this paper, we propose a cognitive radio-inspired rate-splitting multiple access (CR-RSMA) scheme to assist semi-grant-free (SGF) transmissions in which a grant-based user (GBU) and multiple grant-free users (GFUs) access the base-station (BS) by sharing the same resource block. Using the cognitive radio principle, the GBU and admitted GFU are treated as the primary and secondary users, respectively, and rate-splitting is applied at the admitted GFU to realize SGF transmissions. The admitted GFU's transmit power allocation, target rate allocation, and successive interference cancellation decoding order at the BS are jointly optimized to attain the maximum achievable rate for the admitted GFU without deteriorating the GBU's outage performance compared to orthogonal multiple access. Due to the extended non-outage zone, CR-RSMA-assised SGF (CR-RSMA-SGF) transmissions achieve a lower outage probability than SGF transmissions assisted by cognitive radio-inspired non-orthogonal multiple access. Exact expressions and asymptotic analysis for the admitted GFU's outage probability are derived to evaluate the system performance achieved by CR-RSMA-SGF transmissions. The superior outage performance and full multiuser diversity gain achieved by CR-RSMA-SGF transmissions are verified by the analytical and simulation results.

preprint2022arXiv

Compressive Sensing-Based Recovery of Molecular Mixtures with Cross-Reactive Receptor Arrays

In this paper, we propose a novel concept for engineered molecular communication (MC) systems inspired by animal olfaction. We focus on a multi-user scenario where transmitters employ unique mixtures of different types of signaling molecules to convey their messages to a central receiver, which is equipped with an array comprising $R$ different types of receptors to detect the emitted molecule mixtures. The hardware complexity of an MC system employing \textit{orthogonal} molecule-receptor pairs would linearly scale with the number of signaling molecule types $Q$ (i.e., $R=Q$). Natural olfaction systems avoid such high complexity by employing arrays of \textit{cross-reactive} receptors, where each type of molecule activates multiple types of receptors and each type of receptor is predominantly activated by multiple types of molecules albeit with different activation strengths. For instance, the human olfactory system is believed to discriminate several thousands of chemicals using only a few hundred receptor types, i.e., $Q\gg R$. Motivated by this observation, we first develop an end-to-end MC channel model that accounts for the key properties of olfaction. Subsequently, we formulate the molecule mixture recovery as a convex compressive sensing (CS) problem which can be efficiently solved via available numerical solvers. Our simulation results confirm the efficiency of the proposed CS problem for the recovery of the molecular mixture signal and quantify the system performance for various system parameters.

preprint2022arXiv

Context-Aware Security for 6G Wireless The Role of Physical Layer Security

Sixth generation systems are expected to face new security challenges, while opening up new frontiers towards context awareness in the wireless edge. The workhorse behind this projected technological leap will be a whole new set of sensing capabilities predicted for 6G devices, in addition to the ability to achieve high precision localization. The combination of these enhanced traits can give rise to a new breed of context-aware security protocols, following the quality of security (QoSec) paradigm. In this framework, physical layer security solutions emerge as competitive candidates for low complexity, low-delay and low-footprint, adaptive, flexible and context aware security schemes, leveraging the physical layer of the communications in genuinely cross-layer protocols, for the first time.

preprint2022arXiv

Contextual Model Aggregation for Fast and Robust Federated Learning in Edge Computing

Federated learning is a prime candidate for distributed machine learning at the network edge due to the low communication complexity and privacy protection among other attractive properties. However, existing algorithms face issues with slow convergence and/or robustness of performance due to the considerable heterogeneity of data distribution, computation and communication capability at the edge. In this work, we tackle both of these issues by focusing on the key component of model aggregation in federated learning systems and studying optimal algorithms to perform this task. Particularly, we propose a contextual aggregation scheme that achieves the optimal context-dependent bound on loss reduction in each round of optimization. The aforementioned context-dependent bound is derived from the particular participating devices in that round and an assumption on smoothness of the overall loss function. We show that this aggregation leads to a definite reduction of loss function at every round. Furthermore, we can integrate our aggregation with many existing algorithms to obtain the contextual versions. Our experimental results demonstrate significant improvements in convergence speed and robustness of the contextual versions compared to the original algorithms. We also consider different variants of the contextual aggregation and show robust performance even in the most extreme settings.

preprint2022arXiv

Decentralized Stochastic Optimization with Inherent Privacy Protection

Decentralized stochastic optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data usually contain sensitive information like user locations, healthcare records and financial transactions, privacy protection has become an increasingly pressing need in the implementation of decentralized stochastic optimization algorithms. In this paper, we propose a decentralized stochastic gradient descent algorithm which is embedded with inherent privacy protection for every participating agent against other participating agents and external eavesdroppers. This proposed algorithm builds in a dynamics based gradient-obfuscation mechanism to enable privacy protection without compromising optimization accuracy, which is in significant difference from differential-privacy based privacy solutions for decentralized optimization that have to trade optimization accuracy for privacy. The dynamics based privacy approach is encryption-free, and hence avoids incurring heavy communication or computation overhead, which is a common problem with encryption based privacy solutions for decentralized stochastic optimization. Besides rigorously characterizing the convergence performance of the proposed decentralized stochastic gradient descent algorithm under both convex objective functions and non-convex objective functions, we also provide rigorous information-theoretic analysis of its strength of privacy protection. Simulation results for a distributed estimation problem as well as numerical experiments for decentralized learning on a benchmark machine learning dataset confirm the effectiveness of the proposed approach.

preprint2022arXiv

Delay-Phase Precoding for Wideband THz Massive MIMO

Benefiting from tens of GHz bandwidth, terahertz (THz) communication is considered to be a promising technology to provide ultra-high speed data rates for future 6G wireless systems. To compensate for the serious propagation attenuation of THz signals, massive multiple-input multiple-output (MIMO) with hybrid precoding can be utilized to generate directional beams with high array gains. However, the standard hybrid precoding architecture based on frequency-independent phase-shifters cannot cope with the beam split effect in THz massive MIMO systems, where the directional beams will split into different physical directions at different subcarrier frequencies. The beam split effect will result in a serious array gain loss across the entire bandwidth, which has not been well investigated in THz massive MIMO systems. In this paper, we first reveal and quantify the seriousness of the beam split effect in THz massive MIMO systems by analyzing the array gain loss it causes. Then, we propose a new precoding architecture called delay-phase precoding (DPP) to mitigate this effect. Specifically, the proposed DPP introduces a time delay network as a new precoding layer between radio-frequency chains and phase-shifters in the standard hybrid precoding architecture. In this way, conventional phase-controlled analog beamforming can be converted into delay-phase controlled analog beamforming. Unlike frequency-independent phase shifts, the time delay network introduced in the DPP can realize frequency-dependent phase shifts, which can be designed to generate frequency-dependent beams towards the target physical direction across the entire THz bandwidth. Due to the joint control of delay and phase, the proposed DPP can significantly relieve the array gain loss caused by the beam split effect. Furthermore, we propose a hardware structure by using true-time-delayers to realize the concept of DPP.

preprint2022arXiv

Designing IRS-Aided MIMO Systems for Secrecy Enhancement

Intelligent reflecting surfaces (IRSs) enable multiple-input multiple-output (MIMO) transmitters to modify the communication channels between the transmitters and receivers. In the presence of eavesdropping terminals, this degree of freedom can be used to effectively suppress the information leakage towards such malicious terminals. This leads to significant potential secrecy gains in IRS-aided MIMO systems. This work exploits these gains via a tractable joint design of downlink beamformers and IRS phase-shifts. In this respect, we consider a generic IRS-aided MIMO wiretap setting and invoke fractional programming and alternating optimization techniques to iteratively find the beamformers and phase-shifts that maximize the achievable weighted secrecy sum-rate. Our design concludes two low-complexity algorithms for joint beamforming and phase-shift tuning. Performance of the proposed algorithms are numerically evaluated and compared to the benchmark. The results reveal that integrating IRSs into MIMO systems not only boosts the secrecy performance of the system, but also improves the robustness against passive eavesdropping.

preprint2022arXiv

Distributed Stochastic Gradient Descent: Nonconvexity, Nonsmoothness, and Convergence to Local Minima

In centralized settings, it is well known that stochastic gradient descent (SGD) avoids saddle points and converges to local minima in nonconvex problems. However, similar guarantees are lacking for distributed first-order algorithms. The paper studies distributed stochastic gradient descent (D-SGD)--a simple network-based implementation of SGD. Conditions under which D-SGD avoids saddle points and converges to local minima are studied. First, we consider the problem of computing critical points. Assuming loss functions are nonconvex and possibly nonsmooth, it is shown that, for each fixed initialization, D-SGD converges to critical points of the loss with probability one. Next, we consider the problem of avoiding saddle points. In this case, we again assume that loss functions may be nonconvex and nonsmooth, but are smooth in a neighborhood of a saddle point. It is shown that, for any fixed initialization, D-SGD avoids such saddle points with probability one. Results are proved by studying the underlying (distributed) gradient flow, using the ordinary differential equation (ODE) method of stochastic approximation, and extending classical techniques from dynamical systems theory such as stable manifolds. Results are proved in the general context of subspace-constrained optimization, of which D-SGD is a special case.

preprint2022arXiv

Energy-Efficient Resource Allocation for Aggregated RF/VLC Systems

Visible light communication (VLC) is envisioned as a core component of future wireless communication networks due to, among others, the huge unlicensed bandwidth it offers and the fact that it does not cause any interference to existing radio frequency (RF) communication systems. Most research on RF and VLC coexistence has focused on hybrid designs where data transmission to any user could originate from either an RF or a VLC access point (AP). However, hybrid RF/VLC systems fail to exploit the distinct transmission characteristics of RF and VLC systems to fully reap the benefits they can offer. Aggregated RF/VLC systems, in which any user can be served simultaneously by both RF and VLC APs, have recently emerged as a more promising and robust design for the coexistence of RF and VLC systems. To this end, this paper, for the first time, investigates AP assignment, subchannel allocation (SA), and transmit power allocation (PA) to optimize the energy efficiency (EE) of aggregated RF/VLC systems while considering the effects of interference and VLC line-of-sight link blockages. A novel and challenging EE optimization problem is formulated for which an efficient joint solution based on alternating optimization is developed. More particularly, an energy-efficient AP assignment algorithm based on matching theory is proposed. Then, a low-complexity SA scheme that allocates subchannels to users based on their channel conditions is developed. Finally, an effective PA algorithm is presented by utilizing the quadratic transform approach and a multi-objective optimization framework. Extensive simulation results reveal that: 1) the proposed joint AP assignment, SA, and PA solution obtains significant EE, sum-rate, and outage performance gains with low complexity, and 2) the aggregated RF/VLC system provides considerable performance improvement compared to hybrid RF/VLC systems.

preprint2022arXiv

Federated Stochastic Gradient Descent Begets Self-Induced Momentum

Federated learning (FL) is an emerging machine learning method that can be applied in mobile edge systems, in which a server and a host of clients collaboratively train a statistical model utilizing the data and computation resources of the clients without directly exposing their privacy-sensitive data. We show that running stochastic gradient descent (SGD) in such a setting can be viewed as adding a momentum-like term to the global aggregation process. Based on this finding, we further analyze the convergence rate of a federated learning system by accounting for the effects of parameter staleness and communication resources. These results advance the understanding of the Federated SGD algorithm, and also forges a link between staleness analysis and federated computing systems, which can be useful for systems designers.

preprint2022arXiv

Flexible LED Index Modulation for MIMO Optical Wireless Communications

The limited bandwidth of optical wireless communication (OWC) front-end devices motivates the use of multiple-input-multiple-output (MIMO) techniques to enhance data rates. It is known that very high multiplexing gains could be achieved by spatial multiplexing (SMX) in exchange for exhaustive detection complexity. Alternatively, in spatial modulation (SM), a single light emitting diode (LED) is activated per time instance where information is carried by both the signal and the LED index. Since only an LED is active, both transmitter (TX) and receiver (RX) complexity reduces significantly while retaining the information transmission in the spatial domain. However, significant spectral efficiency losses occur in SM compared to SMX. In this paper, we propose a technique which adopts the advantages of both systems. Accordingly, the proposed flexible LED index modulation (FLIM) technique harnesses the inactive state of the LEDs as a transmit symbol. Therefore, the number of active LEDs changes in each transmission, unlike conventional techniques. Moreover, the system complexity is reduced by employing a linear minimum mean squared error (MMSE) equalizer and an angle perturbed receiver at the RX. Numerical results show that FLIM outperforms the reference systems by at least 6 dB in the low and medium/high spectral efficiency regions.

preprint2022arXiv

How Should IRSs Scale to Harden Multi-Antenna Channels?

This work extends the concept of channel hardening to multi-antenna systems that are aided by intelligent reflecting surfaces (IRSs). For fading links between a multi-antenna transmitter and a single-antenna receiver, we derive an accurate approximation for the distribution of the input-output mutual information when the number of reflecting elements grows large. The asymptotic results demonstrate that by increasing the number of elements on the IRS, the end-to-end channel hardens as long as the physical dimensions of the IRS grow as well. The growth rate however need not to be of a specific order and can be significantly sub-linear. The validity of the analytical result is confirmed by numerical experiments.

preprint2022arXiv

Intelligent Omni-Surfaces: Reflection-Refraction Circuit Model, Full-Dimensional Beamforming, and System Implementation

The intelligent omni-surface (IOS) is a dynamic metasurface that has recently been proposed to achieve full-dimensional communications by realizing the dual function of anomalous reflection and anomalous refraction. Existing research works provide only simplified models for the reflection and refraction responses of the IOS, which do not explicitly depend on the physical structure of the IOS and the angle of incidence of the electromagnetic (EM) wave. Therefore, the available reflection-refraction models are insufficient to characterize the performance of full-dimensional communications. In this paper, we propose a complete and detailed circuit-based reflection-refraction model for the IOS, which is formulated in terms of the physical structure and equivalent circuits of the IOS elements, as well as we validate it against full-wave EM simulations. Based on the proposed circuit-based model for the IOS, we analyze the asymmetry between the reflection and transmission coefficients. Moreover, the proposed circuit-based model is utilized for optimizing the hybrid beamforming of IOS-assisted networks and hence improving the system performance. To verify the circuit-based model, the theoretical findings, and to evaluate the performance of full-dimensional beamforming, we implement a prototype of IOS and deploy an IOS-assisted wireless communication testbed to experimentally measure the beam patterns and to quantify the achievable rate. The obtained experimental results validate the theoretical findings and the accuracy of the proposed circuit-based reflection-refraction model for IOSs.

preprint2022arXiv

Interference Cancellation GAN Framework for Dynamic Channels

Symbol detection is a fundamental and challenging problem in modern communication systems, e.g., multiuser multiple-input multiple-output (MIMO) setting. Iterative Soft Interference Cancellation (SIC) is a state-of-the-art method for this task and recently motivated data-driven neural network models, e.g. DeepSIC, that can deal with unknown non-linear channels. However, these neural network models require thorough timeconsuming training of the networks before applying, and is thus not readily suitable for highly dynamic channels in practice. We introduce an online training framework that can swiftly adapt to any changes in the channel. Our proposed framework unifies the recent deep unfolding approaches with the emerging generative adversarial networks (GANs) to capture any changes in the channel and quickly adjust the networks to maintain the top performance of the model. We demonstrate that our framework significantly outperforms recent neural network models on highly dynamic channels and even surpasses those on the static channel in our experiments.

preprint2022arXiv

Joint Beam Management and Power Allocation in THz-NOMA Networks

This paper investigates how to apply non-orthogonal multiple access (NOMA) as an add-on in terahertz (THz) networks. In particular, prior to the implementation of NOMA, it is assumed that there exists a legacy THz system, where spatial beams have already been configured to serve legacy primary users. The aim of this paper is to study how these pre-configured spatial beams can be used as a type of bandwidth resources, on which additional secondary users are served without degrading the performance of the legacy primary users. A joint beam management and power allocation problem is first formulated as a mixed combinatorial non-convex optimization problem, and then solved by two methods with different performance-complexity tradeoffs, one based on the branch and bound method and the other based on successive convex approximation. Both analytical and simulation results are presented to illustrate the new features of beam-based resource allocation in THz-NOMA networks and also demonstrate that those pre-configured spatial beams can be employed to improve the system throughput and connectivity in a spectrally efficient manner.

preprint2022arXiv

Joint Coding of URLLC and eMBB in Wyner's Soft-Handoff Network in the Finite Blocklength Regime

Wyner's soft-handoff network is considered where transmitters simultaneously send messages of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) services. Due to the low-latency requirements, the URLLC messages are transmitted over fewer channel uses compared to the eMBB messages. To improve the reliability of the URLLC transmissions, we propose a coding scheme with finite blocklength codewords that exploits dirty-paper coding (DPC) to precancel the interference from eMBB transmissions. Rigorous bounds are derived for the error probabilities of eMBB and URLLC transmissions achieved by our scheme. Numerical results illustrate that they are lower than for standard time-sharing.

preprint2022arXiv

Learning Mixtures of Linear Dynamical Systems

We study the problem of learning a mixture of multiple linear dynamical systems (LDSs) from unlabeled short sample trajectories, each generated by one of the LDS models. Despite the wide applicability of mixture models for time-series data, learning algorithms that come with end-to-end performance guarantees are largely absent from existing literature. There are multiple sources of technical challenges, including but not limited to (1) the presence of latent variables (i.e. the unknown labels of trajectories); (2) the possibility that the sample trajectories might have lengths much smaller than the dimension $d$ of the LDS models; and (3) the complicated temporal dependence inherent to time-series data. To tackle these challenges, we develop a two-stage meta-algorithm, which is guaranteed to efficiently recover each ground-truth LDS model up to error $\tilde{O}(\sqrt{d/T})$, where $T$ is the total sample size. We validate our theoretical studies with numerical experiments, confirming the efficacy of the proposed algorithm.

preprint2022arXiv

Meta-material Sensor Based Internet of Things: Design, Optimization, and Implementation

For many applications envisioned for the Internet of Things (IoT), it is expected that the sensors will have very low costs and zero power, which can be satisfied by meta-material sensor based IoT, i.e., meta-IoT. As their constituent meta-materials can reflect wireless signals with environment-sensitive reflection coefficients, meta-IoT sensors can achieve simultaneous sensing and transmission without any active modulation. However, to maximize the sensing accuracy, the structures of meta-IoT sensors need to be optimized considering their joint influence on sensing and transmission, which is challenging due to the high computational complexity in evaluating the influence, especially given a large number of sensors. In this paper, we propose a joint sensing and transmission design method for meta-IoT systems with a large number of meta-IoT sensors, which can efficiently optimize the sensing accuracy of the system. Specifically, a computationally efficient received signal model is established to evaluate the joint influence of meta-material structure on sensing and transmission. Then, a sensing algorithm based on deep unsupervised learning is designed to obtain accurate sensing results in a robust manner. Experiments with a prototype verify that the system has a higher sensitivity and a longer transmission range compared to existing designs, and can sense environmental anomalies correctly within 2 meters.

preprint2022arXiv

Meta-Reinforcement Learning for Reliable Communication in THz/VLC Wireless VR Networks

In this paper, the problem of enhancing the quality of virtual reality (VR) services is studied for an indoor terahertz (THz)/visible light communication (VLC) wireless network. In the studied model, small base stations (SBSs) transmit high-quality VR images to VR users over THz bands and light-emitting diodes (LEDs) provide accurate indoor positioning services for them using VLC. Here, VR users move in real time and their movement patterns change over time according to their applications, where both THz and VLC links can be blocked by the bodies of VR users. To control the energy consumption of the studied THz/VLC wireless VR network, VLC access points (VAPs) must be selectively turned on so as to ensure accurate and extensive positioning for VR users. Based on the user positions, each SBS must generate corresponding VR images and establish THz links without body blockage to transmit the VR content. The problem is formulated as an optimization problem whose goal is to maximize the reliability of the VR network by selecting the appropriate VAPs to be turned on and controlling the user association with SBSs. To solve this problem, a policy gradient-based reinforcement learning (RL) algorithm that adopts a meta-learning approach is proposed. The proposed meta policy gradient (MPG) algorithm enables the trained policy to quickly adapt to new user movement patterns. In order to solve the problem of maximizing the average number of successfully served users for VR scenarios with a large number of users, a dual method based MPG algorithm (D-MPG) with a low complexity is proposed. Simulation results demonstrate that, compared to the trust region policy optimization algorithm (TRPO), the proposed MPG and D-MPG algorithms yield up to 26.8% and 21.9% improvement in the reliability as well as 81.2% and 87.5% gains in the convergence speed, respectively.

preprint2022arXiv

Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps

Eigenvector perturbation analysis plays a vital role in various data science applications. A large body of prior works, however, focused on establishing $\ell_{2}$ eigenvector perturbation bounds, which are often highly inadequate in addressing tasks that rely on fine-grained behavior of an eigenvector. This paper makes progress on this by studying the perturbation of linear functions of an unknown eigenvector. Focusing on two fundamental problems -- matrix denoising and principal component analysis -- in the presence of Gaussian noise, we develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector. In order to mitigate a non-negligible bias issue inherent to the natural ``plug-in'' estimator, we develop de-biased estimators that (1) achieve minimax lower bounds for a family of scenarios (modulo some logarithmic factor), and (2) can be computed in a data-driven manner without sample splitting. Noteworthily, the proposed estimators are nearly minimax optimal even when the associated eigen-gap is {\em substantially smaller} than what is required in prior statistical theory.

preprint2022arXiv

Near-Field Hierarchical Beam Management for RIS-Enabled Millimeter Wave Multi-Antenna Systems

In this paper, we present a low overhead beam management approach for near-field millimeter-wave multi-antenna communication systems enabled by Reconfigurable Intelligent Surfaces (RISs). We devise a novel variable-width hierarchical phaseshift codebook suitable for both the near- and far-field of the RIS, and present a fast alignment algorithm for the RIS phase shifts and the transceiver beamformers. Indicative performance evaluation results are shown, verifying the effectiveness of the proposed approach in comparison with various benchmark schemes.

preprint2022arXiv

Olfaction-inspired MCs: Molecule Mixture Shift Keying and Cross-Reactive Receptor Arrays

In this paper, we propose a novel concept for engineered molecular communication (MC) systems inspired by animal olfaction. We focus on a multi-user scenario where several transmitters wish to communicate with a central receiver. We assume that each transmitter employs a unique mixture of different types of signaling molecules to represent its message and the receiver is equipped with an array comprising $R$ different types of receptors in order to detect the emitted molecule mixtures. The design of an MC system based on \textit{orthogonal} molecule-receptor pairs implies that the hardware complexity of the receiver linearly scales with the number of signaling molecule types $Q$ (i.e., $R=Q$). Natural olfaction systems avoid such high complexity by employing arrays of \textit{cross-reactive} receptors, where each type of molecule activates multiple types of receptors and each type of receptor is predominantly activated by multiple types of molecules albeit with different activation strengths. For instance, the human olfactory system is believed to discriminate several thousands of chemicals using only a few hundred receptor types, i.e., $Q\gg R$. Motivated by this observation, we first develop an end-to-end MC channel model that accounts for the key properties of olfaction. Subsequently, we present the proposed transmitter and receiver designs. In particular, given a set of signaling molecules, we develop algorithms that allocate molecules to different transmitters and optimize the mixture alphabet for communication. Moreover, we formulate the molecule mixture recovery as a convex compressive sensing problem which can be efficiently solved via available numerical solvers.

preprint2022arXiv

On Differential Privacy for Federated Learning in Wireless Systems with Multiple Base Stations

In this work, we consider a federated learning model in a wireless system with multiple base stations and inter-cell interference. We apply a differential private scheme to transmit information from users to their corresponding base station during the learning phase. We show the convergence behavior of the learning process by deriving an upper bound on its optimality gap. Furthermore, we define an optimization problem to reduce this upper bound and the total privacy leakage. To find the locally optimal solutions of this problem, we first propose an algorithm that schedules the resource blocks and users. We then extend this scheme to reduce the total privacy leakage by optimizing the differential privacy artificial noise. We apply the solutions of these two procedures as parameters of a federated learning system. In this setting, we assume that each user is equipped with a classifier. Moreover, the communication cells are assumed to have mostly fewer resource blocks than numbers of users. The simulation results show that our proposed scheduler improves the average accuracy of the predictions compared with a random scheduler. Furthermore, its extended version with noise optimizer significantly reduces the amount of privacy leakage.

preprint2022arXiv

Performance Analysis of Joint Active User Detection and Channel Estimation for Massive Connectivity

This paper considers joint active user detection (AUD) and channel estimation (CE) for massive connectivity scenarios with sporadic traffic. The state-of-art method under a Bayesian framework to perform joint AUD and CE in such scenarios is approximate message passing (AMP). However, the existing theoretical analysis of AMP-based joint AUD and CE can only be performed with a given fixed point of the AMP state evolution function, lacking the analysis of AMP phase transition and Bayes-optimality. In this paper, we propose a novel theoretical framework to analyze the performance of the joint AUD and CE problem by adopting the replica method in the Bayes-optimal condition. Specifically, our analysis is based on a general channel model, which reduces to particular channel models in multiple typical MIMO communication scenarios. Our theoretical framework allows ones to measure the optimality and phase transition of AMP-based joint AUD and CE as well as to predict the corresponding performance metrics under our model. To reify our proposed theoretical framework, we analyze two typical scenarios from the massive random access literature, i.e., the isotropic channel scenario and the spatially correlated channel scenario. Accordingly, our performance analysis produces some novel results for both the isotropic Raleigh channel and spatially correlated channel case.

preprint2022arXiv

Performance Analysis of Multiple-Antenna Ambient Backscatter Systems at Finite Blocklengths

This paper analyzes the maximal achievable rate for a given blocklength and error probability over a multiple-antenna ambient backscatter channel with perfect channel state information at the receiver. The result consists of a finite blocklength channel coding achievability bound and a converse bound based on the Neyman-Pearson test and the normal approximation based on the Berry- Esseen Theorem. Numerical evaluation of these bounds shows fast convergence to the channel capacity as the blocklength increases and also proves that the channel dispersion is an accurate measure of the backoff from capacity due to finite blocklength.

preprint2022arXiv

Performance Optimization for Semantic Communications: An Attention-based Reinforcement Learning Approach

In this paper, a semantic communication framework is proposed for textual data transmission. In the studied model, a base station (BS) extracts the semantic information from textual data, and transmits it to each user. The semantic information is modeled by a knowledge graph (KG) that consists of a set of semantic triples. After receiving the semantic information, each user recovers the original text using a graph-to-text generation model. To measure the performance of the considered semantic communication framework, a metric of semantic similarity (MSS) that jointly captures the semantic accuracy and completeness of the recovered text is proposed. Due to wireless resource limitations, the BS may not be able to transmit the entire semantic information to each user and satisfy the transmission delay constraint. Hence, the BS must select an appropriate resource block for each user as well as determine and transmit part of the semantic information to the users. As such, we formulate an optimization problem whose goal is to maximize the total MSS by jointly optimizing the resource allocation policy and determining the partial semantic information to be transmitted. To solve this problem, a proximal-policy-optimization-based reinforcement learning (RL) algorithm integrated with an attention network is proposed. The proposed algorithm can evaluate the importance of each triple in the semantic information using an attention network and then, build a relationship between the importance distribution of the triples in the semantic information and the total MSS. Compared to traditional RL algorithms, the proposed algorithm can dynamically adjust its learning rate thus ensuring convergence to a locally optimal solution.

preprint2022arXiv

Phase Shift Design in RIS Empowered Wireless Networks: From Optimization to AI-Based Methods

Reconfigurable intelligent surfaces (RISs) have a revolutionary capability to customize the radio propagation environment for wireless networks. To fully exploit the advantages of RISs in wireless systems, the phases of the reflecting elements must be jointly designed with conventional communication resources, such as beamformers, transmit power, and computation time. However, due to the unique constraints on the phase shift, and massive numbers of reflecting units and users in large-scale networks, the resulting optimization problems are challenging to solve. This paper provides a review of current optimization methods and artificial intelligence-based methods for handling the constraints imposed by RIS and compares them in terms of solution quality and computational complexity. Future challenges in phase shift optimization involving RISs are also described and potential solutions are discussed.

preprint2022arXiv

Proximal Policy Optimization-based Transmit Beamforming and Phase-shift Design in an IRS-aided ISAC System for the THz Band

In this paper, an IRS-aided integrated sensing and communications (ISAC) system operating in the terahertz (THz) band is proposed to maximize the system capacity. Transmit beamforming and phase-shift design are transformed into a universal optimization problem with ergodic constraints. Then the joint optimization of transmit beamforming and phase-shift design is achieved by gradient-based, primal-dual proximal policy optimization (PPO) in the multi-user multiple-input single-output (MISO) scenario. Specifically, the actor part generates continuous transmit beamforming and the critic part takes charge of discrete phase shift design. Based on the MISO scenario, we investigate a distributed PPO (DPPO) framework with the concept of multi-threading learning in the multi-user multiple-input multiple-output (MIMO) scenario. Simulation results demonstrate the effectiveness of the primal-dual PPO algorithm and its multi-threading version in terms of transmit beamforming and phase-shift design.

preprint2022arXiv

Random Orthogonalization for Federated Learning in Massive MIMO Systems

We propose a novel uplink communication method, coined random orthogonalization, for federated learning (FL) in a massive multiple-input and multiple-output (MIMO) wireless system. The key novelty of random orthogonalization comes from the tight coupling of FL model aggregation and two unique characteristics of massive MIMO - channel hardening and favorable propagation. As a result, random orthogonalization can achieve natural over-the-air model aggregation without requiring transmitter side channel state information, while significantly reducing the channel estimation overhead at the receiver. Theoretical analyses with respect to both communication and machine learning performances are carried out. In particular, an explicit relationship among the convergence rate, the number of clients and the number of antennas is established. Experimental results validate the effectiveness and efficiency of random orthogonalization for FL in massive MIMO.

preprint2022arXiv

Rate-Splitting Multiple Access for Downlink MIMO: A Generalized Power Iteration Approach

Rate-splitting multiple access (RSMA) is a general multiple access scheme for downlink multi-antenna systems embracing both classical spatial division multiple access and more recent non-orthogonal multiple access. Finding a linear precoding strategy that maximizes the sum spectral efficiency of RSMA is a challenging yet significant problem. In this paper, we put forth a novel precoder design framework that jointly finds the linear precoders for the common and private messages for RSMA. Our approach is first to approximate the non-smooth minimum function part in the sum spectral efficiency of RSMA using a LogSumExp technique. Then, we reformulate the sum spectral efficiency maximization problem as a form of the log-sum of Rayleigh quotients to convert it into a tractable form. By interpreting the first-order optimality condition of the reformulated problem as an eigenvector-dependent nonlinear eigenvalue problem, we reveal that the leading eigenvector of the derived optimality condition is a local optimal solution. To find the leading eigenvector, we propose an algorithm inspired by a power iteration. Simulation results show that the proposed RSMA transmission strategy provides significant improvement in the sum spectral efficiency compared to the state-of-the-art RSMA transmission methods.

preprint2022arXiv

Reasoning on the Air: An Implicit Semantic Communication Architecture

Semantic communication is a novel communication paradigm which draws inspiration from human communication focusing on the delivery of the meaning of a message to the intended users. It has attracted significant interest recently due to its potential to improve efficiency and reliability of communication, enhance users' quality-of-experience (QoE), and achieve smoother cross-protocol/domain communication. Most existing works in semantic communication focus on identifying and transmitting explicit semantic meaning, e.g., labels of objects, that can be directly identified from the source signal. This paper investigates implicit semantic communication in which the hidden information, e.g., implicit causality and reasoning mechanisms of users, that cannot be directly observed from the source signal needs to be transported and delivered to the intended users. We propose a novel implicit semantic communication (iSC) architecture for representing, communicating, and interpreting the implicit semantic meaning. In particular, we first propose a graph-inspired structure to represent implicit meaning of message based on three key components: entity, relation, and reasoning mechanism. We then propose a generative adversarial imitation learning-based reasoning mechanism learning (GAML) solution for the destination user to learn and imitate the reasoning process of the source user. We prove that, by applying GAML, the destination user can accurately imitate the reasoning process of the users to generate reasoning paths that follow the same probability distribution as the expert paths. Numerical results suggest that our proposed architecture can achieve accurate implicit meaning interpretation at the destination user.

preprint2022arXiv

Security-Reliability Trade-Off Analysis for SWIPT- and AF-Based IoT Networks with Friendly Jammers

Radio-frequency (RF) energy harvesting (EH) in wireless relaying networks has attracted considerable recent interest, especially for supplying energy to relay nodes in Internet-of-Things (IoT) systems to assist the information exchange between a source and a destination. Moreover, limited hardware, computational resources, and energy availability of IoT devices have raised various security challenges. To this end, physical layer security (PLS) has been proposed as an effective alternative to cryptographic methods for providing information security. In this study, we propose a PLS approach for simultaneous wireless information and power transfer (SWIPT)-based half-duplex (HD) amplify-and-forward (AF) relaying systems in the presence of an eavesdropper. Furthermore, we take into account both static power splitting relaying (SPSR) and dynamic power splitting relaying (DPSR) to thoroughly investigate the benefits of each one. To further enhance secure communication, we consider multiple friendly jammers to help prevent wiretapping attacks from the eavesdropper. More specifically, we provide a reliability and security analysis by deriving closed-form expressions of outage probability (OP) and intercept probability (IP), respectively, for both the SPSR and DPSR schemes. Then, simulations are also performed to validate our analysis and the effectiveness of the proposed schemes. Specifically, numerical results illustrate the non-trivial trade-off between reliability and security of the proposed system. In addition, we conclude from the simulation results that the proposed DPSR scheme outperforms the SPSR-based scheme in terms of OP and IP under the influences of different parameters on system performance.

preprint2022arXiv

Semi-Data-Aided Channel Estimation for MIMO Systems via Reinforcement Learning

Data-aided channel estimation is a promising solution to improve channel estimation accuracy by exploiting data symbols as pilot signals for updating an initial channel estimate. In this paper, we propose a semi-data-aided channel estimator for multiple-input multiple-output communication systems. Our strategy is to leverage reinforcement learning (RL) for selecting reliable detected symbols among the symbols in the first part of transmitted data block. This strategy facilitates an update of the channel estimate before the end of data block transmission and therefore achieves a significant reduction in communication latency compared to conventional data-aided channel estimation approaches. Towards this end, we first define a Markov decision process (MDP) which sequentially decides whether to use each detected symbol as an additional pilot signal. We then develop an RL algorithm to efficiently find the best policy of the MDP based on a Monte Carlo tree search approach. In this algorithm, we exploit the a-posteriori probability for approximating both the optimal future actions and the corresponding state transitions of the MDP and derive a closed-form expression for the best policy. Simulation results demonstrate that the proposed channel estimator effectively mitigates both channel estimation error and detection performance loss caused by insufficient pilot signals.

preprint2022arXiv

Sensor Deployment and Link Analysis in Satellite IoT Systems for Wildfire Detection

Climate change has been identified as one of the most critical threats to human civilization and sustainability. Wildfires, which produce huge amounts of carbon emission, are both drivers and results of climate change. An early and timely wildfire detection system can constrain fires to short and small ones and yield significant carbon reduction. In this paper, we propose to use ground sensor deployment and satellite Internet of Things (IoT) technologies for wildfire detection by taking advantage of satellites' ubiquitous global coverage. We first develop an optimal IoT sensor placement strategy based on fire ignition and detection models. Then, we analyze the uplink satellite communication budget and the bandwidth required for wildfire detection under the narrowband IoT (NB-IoT) radio interface. Finally, we conduct simulations on the California wildfire database and quantify the potential economical benefits by factoring in carbon emission reductions and sensor/bandwidth costs.

preprint2022arXiv

Toward Experience-Driven Traffic Management and Orchestration in Digital-Twin-Enabled 6G Networks

The envisioned 6G networks are expected to support extremely high data rates, low-latency, and radically new applications empowered by machine learning. The futuristic 6G networks require a novel framework that can be used to operate, manage, and optimize its underlying services such as ultra-reliable and low-latency communication, and Internet of everything. In recent years, artificial intelligence (AI) has demonstrated significant success in optimizing and designing networks. The AI-enabled traffic orchestration can dynamically organize different network architectures and slices to provide quality of experience considering the dynamic nature of the wireless communication network. In this paper, we propose a digital twin enabled network framework, empowered by AI to cater the variability and complexity of envisioned 6G networks, to provide smart resource management and intelligent service provisioning. Digital twin paves a way for achieving optimizing 6G services by creating a virtual representation of the 6G network along with its associated communication technologies (e.g., intelligent reflecting surfaces, terahertz and millimeter communication), computing systems (e.g., cloud computing and fog computing) with its associated algorithms (e.g., optimization and machine learning). We then discuss and review the existing AI-enabled traffic management and orchestration techniques and highlight future research directions and potential solutions in 6G networks.

preprint2022arXiv

Towards Industry 5.0: Intelligent Reflecting Surface (IRS) in Smart Manufacturing

Industry 5.0 envisions close cooperation between humans and machines requiring ultra-reliable and low latency communications (URLLC). The Intelligent Reflecting Surface (IRS) has the potential to play a crucial role in realizing wireless URLLC for Industry 5.0. IRS is forecast to be a key enabler of 6G wireless communication networks as it can significantly improve wireless network performance by creating a controllable radio environment. In this paper, we first provide an overview of IRS technology and then conceptualize the potential for IRS implementation in a future smart manufacturing environment to support the emergence of Industry 5.0 with a series of applications. Finally, to stimulate future research in this area, we discuss the strength, open challenges, and opportunities of IRS technology in modern smart manufacturing.

preprint2022arXiv

Towards Ubiquitous Sensing and Localization With Reconfigurable Intelligent Surfaces

In future cellular systems, wireless localization and sensing functions will be built-in for specific applications, e.g., navigation, transportation, and healthcare, and to support flexible and seamless connectivity. Driven by this trend, the need rises for fine-resolution sensing solutions and cm-level localization accuracy, while the accuracy of current wireless systems is limited by the quality of the propagation environment. Recently, with the development of new materials, reconfigurable intelligent surfaces (RISs) provide an opportunity to reshape and control the electromagnetic characteristics of the environment, which can be utilized to improve the performance of wireless sensing and localization. In this tutorial, we will first review the background and motivation to utilize wireless signals for sensing and localization. Next, we introduce how to incorporate RIS into applications of sensing and localization, including key challenges and enabling techniques, and then some case studies will be presented. Finally, future research directions will also be discussed.

preprint2022arXiv

Wireless for Machine Learning

As data generation increasingly takes place on devices without a wired connection, machine learning (ML) related traffic will be ubiquitous in wireless networks. Many studies have shown that traditional wireless protocols are highly inefficient or unsustainable to support ML, which creates the need for new wireless communication methods. In this survey, we give an exhaustive review of the state-of-the-art wireless methods that are specifically designed to support ML services over distributed datasets. Currently, there are two clear themes within the literature, analog over-the-air computation and digital radio resource management optimized for ML. This survey gives a comprehensive introduction to these methods, reviews the most important works, highlights open problems, and discusses application scenarios.

preprint2021arXiv

A Novel Wireless Communication Paradigm for Intelligent Reflecting Surface Based Symbiotic Radio Systems

This paper investigates a novel intelligent reflecting surface (IRS)-based symbiotic radio (SR) system architecture consisting of a transmitter, an IRS, and an information receiver (IR). The primary transmitter communicates with the IR and at the same time assists the IRS in forwarding information to the IR. Based on the IRS's symbol period, we distinguish two scenarios, namely, commensal SR (CSR) and parasitic SR (PSR), where two different techniques for decoding the IRS signals at the IR are employed. We formulate bit error rate (BER) minimization problems for both scenarios by jointly optimizing the active beamformer at the base station and the phase shifts at the IRS, subject to a minimum primary rate requirement. Specifically, for the CSR scenario, a penalty-based algorithm is proposed to obtain a high-quality solution, where semi-closed-form solutions for the active beamformer and the IRS phase shifts are derived based on Lagrange duality and Majorization-Minimization methods, respectively. For the PSR scenario, we apply a bisection search-based method, successive convex approximation, and difference of convex programming to develop a computationally efficient algorithm, which converges to a locally optimal solution. Simulation results demonstrate the effectiveness of the proposed algorithms and show that the proposed SR techniques are able to achieve a lower BER than benchmark schemes.

preprint2021arXiv

A Tutorial on Ultra-Reliable and Low-Latency Communications in 6G: Integrating Domain Knowledge into Deep Learning

As one of the key communication scenarios in the 5th and also the 6th generation (6G) of mobile communication networks, ultra-reliable and low-latency communications (URLLC) will be central for the development of various emerging mission-critical applications. State-of-the-art mobile communication systems do not fulfill the end-to-end delay and overall reliability requirements of URLLC. In particular, a holistic framework that takes into account latency, reliability, availability, scalability, and decision making under uncertainty is lacking. Driven by recent breakthroughs in deep neural networks, deep learning algorithms have been considered as promising ways of developing enabling technologies for URLLC in future 6G networks. This tutorial illustrates how domain knowledge (models, analytical tools, and optimization frameworks) of communications and networking can be integrated into different kinds of deep learning algorithms for URLLC. We first provide some background of URLLC and review promising network architectures and deep learning frameworks for 6G. To better illustrate how to improve learning algorithms with domain knowledge, we revisit model-based analytical tools and cross-layer optimization frameworks for URLLC. Following that, we examine the potential of applying supervised/unsupervised deep learning and deep reinforcement learning in URLLC and summarize related open problems. Finally, we provide simulation and experimental results to validate the effectiveness of different learning algorithms and discuss future directions.

preprint2021arXiv

Artificial Intelligence Driven UAV-NOMA-MEC in Next Generation Wireless Networks

Driven by the unprecedented high throughput and low latency requirements in next-generation wireless networks, this paper introduces an artificial intelligence (AI) enabled framework in which unmanned aerial vehicles (UAVs) use non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) techniques to service terrestrial mobile users (MUs). The proposed framework enables the terrestrial MUs to offload their computational tasks simultaneously, intelligently, and flexibly, thus enhancing their connectivity as well as reducing their transmission latency and their energy consumption. To this end, the fundamentals of this framework are first introduced. Then, a number of communication and AI techniques are proposed to improve the quality of experiences of terrestrial MUs. To this end, federated learning and reinforcement learning are introduced for intelligent task offloading and computing resource allocation. For each learning technique, motivations, challenges, and representative results are introduced. Finally, several key technical challenges and open research issues of the proposed framework are summarized.

preprint2021arXiv

Covert Model Poisoning Against Federated Learning: Algorithm Design and Optimization

Federated learning (FL), as a type of distributed machine learning frameworks, is vulnerable to external attacks on FL models during parameters transmissions. An attacker in FL may control a number of participant clients, and purposely craft the uploaded model parameters to manipulate system outputs, namely, model poisoning (MP). In this paper, we aim to propose effective MP algorithms to combat state-of-the-art defensive aggregation mechanisms (e.g., Krum and Trimmed mean) implemented at the server without being noticed, i.e., covert MP (CMP). Specifically, we first formulate the MP as an optimization problem by minimizing the Euclidean distance between the manipulated model and designated one, constrained by a defensive aggregation rule. Then, we develop CMP algorithms against different defensive mechanisms based on the solutions of their corresponding optimization problems. Furthermore, to reduce the optimization complexity, we propose low complexity CMP algorithms with a slight performance degradation. In the case that the attacker does not know the defensive aggregation mechanism, we design a blind CMP algorithm, in which the manipulated model will be adjusted properly according to the aggregated model generated by the unknown defensive aggregation. Our experimental results demonstrate that the proposed CMP algorithms are effective and substantially outperform existing attack mechanisms.

preprint2021arXiv

Downlink and Uplink Intelligent Reflecting Surface Aided Networks: NOMA and OMA

Intelligent reflecting surfaces (IRSs) are envisioned to provide reconfigurable wireless environments for future communication networks. In this paper, both downlink and uplink IRS-aided non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) networks are studied, in which an IRS is deployed to enhance the coverage by assisting a cell-edge user device (UD) to communicate with the base station (BS). To characterize system performance, new channel statistics of the BS-IRS-UD link with Nakagami-$m$ fading are investigated. For each scenario, the closed-form expressions for the outage probability and ergodic rate are derived. To gain further insight, the diversity order and high signal-to-noise ratio (SNR) slope for each scenario are obtained according to asymptotic approximations in the high-SNR regime. It is demonstrated that the diversity order is affected by the number of IRS reflecting elements and Nakagami fading parameters, but the high-SNR slope is not related to these parameters. Simulation results validate our analysis and reveal the superiority of the IRS over the full-duplex decode-and-forward relay.

preprint2021arXiv

Federated Learning for 6G: Applications, Challenges, and Opportunities

Traditional machine learning is centralized in the cloud (data centers). Recently, the security concern and the availability of abundant data and computation resources in wireless networks are pushing the deployment of learning algorithms towards the network edge. This has led to the emergence of a fast growing area, called federated learning (FL), which integrates two originally decoupled areas: wireless communication and machine learning. In this paper, we provide a comprehensive study on the applications of FL for sixth generation (6G) wireless networks. First, we discuss the key requirements in applying FL for wireless communications. Then, we focus on the motivating application of FL for wireless communications. We identify the main problems, challenges, and provide a comprehensive treatment of implementing FL techniques for wireless communications.

preprint2021arXiv

Federated Learning: A Signal Processing Perspective

The dramatic success of deep learning is largely due to the availability of data. Data samples are often acquired on edge devices, such as smart phones, vehicles and sensors, and in some cases cannot be shared due to privacy considerations. Federated learning is an emerging machine learning paradigm for training models across multiple edge devices holding local datasets, without explicitly exchanging the data. Learning in a federated manner differs from conventional centralized machine learning, and poses several core unique challenges and requirements, which are closely related to classical problems studied in the areas of signal processing and communications. Consequently, dedicated schemes derived from these areas are expected to play an important role in the success of federated learning and the transition of deep learning from the domain of centralized servers to mobile edge devices. In this article, we provide a unified systematic framework for federated learning in a manner that encapsulates and highlights the main challenges that are natural to treat using signal processing tools. We present a formulation for the federated learning paradigm from a signal processing perspective, and survey a set of candidate approaches for tackling its unique challenges. We further provide guidelines for the design and adaptation of signal processing and communication methods to facilitate federated learning at large scale.

preprint2021arXiv

Learning Mixtures of Low-Rank Models

We study the problem of learning mixtures of low-rank models, i.e. reconstructing multiple low-rank matrices from unlabelled linear measurements of each. This problem enriches two widely studied settings -- low-rank matrix sensing and mixed linear regression -- by bringing latent variables (i.e. unknown labels) and structural priors (i.e. low-rank structures) into consideration. To cope with the non-convexity issues arising from unlabelled heterogeneous data and low-complexity structure, we develop a three-stage meta-algorithm that is guaranteed to recover the unknown matrices with near-optimal sample and computational complexities under Gaussian designs. In addition, the proposed algorithm is provably stable against random noise. We complement the theoretical studies with empirical evidence that confirms the efficacy of our algorithm.

preprint2021arXiv

Learning to Decode Protograph LDPC Codes

The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with the codelength, thus they can only support short to moderate codelengths. From the point view of practicality, we propose a high-performance neural min-sum (MS) decoding method that makes full use of the lifting structure of protograph low-density parity-check (LDPC) codes. By this means, the size of the parameter array of each layer in the neural decoder only equals the number of edge-types for arbitrary codelengths. In particular, for protograph LDPC codes, the proposed neural MS decoder is constructed in a special way such that identical parameters are shared by a bundle of edges derived from the same edge-type. To reduce the complexity and overcome the vanishing gradient problem in training the proposed neural MS decoder, an iteration-by-iteration (i.e., layer-by-layer in neural networks) greedy training method is proposed. With this, the proposed neural MS decoder tends to be optimized with faster convergence, which is aligned with the early termination mechanism widely used in practice. To further enhance the generalization ability of the proposed neural MS decoder, a codelength/rate compatible training method is proposed, which randomly selects samples from a set of codes lifted from the same base code. As a theoretical performance evaluation tool, a trajectory-based extrinsic information transfer (T-EXIT) chart is developed for various decoders. Both T-EXIT and simulation results show that the optimized MS decoding can provide faster convergence and up to 1dB gain compared with the plain MS decoding and its variants with only slightly increased complexity. In addition, it can even outperform the sum-product algorithm for some short codes.

preprint2021arXiv

Nonconvex Low-Rank Tensor Completion from Noisy Data

We study a noisy tensor completion problem of broad practical interest, namely, the reconstruction of a low-rank tensor from highly incomplete and randomly corrupted observations of its entries. While a variety of prior work has been dedicated to this problem, prior algorithms either are computationally too expensive for large-scale applications, or come with sub-optimal statistical guarantees. Focusing on "incoherent" and well-conditioned tensors of a constant CP rank, we propose a two-stage nonconvex algorithm -- (vanilla) gradient descent following a rough initialization -- that achieves the best of both worlds. Specifically, the proposed nonconvex algorithm faithfully completes the tensor and retrieves all individual tensor factors within nearly linear time, while at the same time enjoying near-optimal statistical guarantees (i.e. minimal sample complexity and optimal estimation accuracy). The estimation errors are evenly spread out across all entries, thus achieving optimal $\ell_{\infty}$ statistical accuracy. We have also discussed how to extend our approach to accommodate asymmetric tensors. The insight conveyed through our analysis of nonconvex optimization might have implications for other tensor estimation problems.

preprint2021arXiv

On the Application of BAC-NOMA to 6G umMTC

This letter studies the application of backscatter communications (BackCom) assisted non-orthogonal multiple access (BAC-NOMA) to the envisioned sixth-generation (6G) ultra-massive machine type communications (umMTC). In particular, the proposed BAC-NOMA transmission scheme can realize simultaneous energy and spectrum cooperation between uplink and downlink users, which is important to support massive connectivity and stringent energy constraints in umMTC. Furthermore, a resource allocation problem for maximizing the uplink throughput and suppressing the interference between downlink and uplink transmission is formulated as an optimization problem and the corresponding optimal resource allocation policy is obtained. Computer simulations are provided to demonstrate the superior performance of BAC-NOMA.

preprint2021arXiv

Optimization of User Selection and Bandwidth Allocation for Federated Learning in VLC/RF Systems

Limited radio frequency (RF) resources restrict the number of users that can participate in federated learning (FL) thus affecting FL convergence speed and performance. In this paper, we first introduce visible light communication (VLC) as a supplement to RF in FL and build a hybrid VLC/RF communication system, in which each indoor user can use both VLC and RF to transmit its FL model parameters. Then, the problem of user selection and bandwidth allocation is studied for FL implemented over a hybrid VLC/RF system aiming to optimize the FL performance. The problem is first separated into two subproblems. The first subproblem is a user selection problem with a given bandwidth allocation, which is solved by a traversal algorithm. The second subproblem is a bandwidth allocation problem with a given user selection, which is solved by a numerical method. The final user selection and bandwidth allocation are obtained by iteratively solving these two subproblems. Simulation results show that the proposed FL algorithm that efficiently uses VLC and RF for FL model transmission can improve the prediction accuracy by up to 10% compared with a conventional FL system using only RF.

preprint2021arXiv

Reconfigurable Intelligent Surfaces in 6G: Reflective, Transmissive, or Both?

Reconfigurable intelligent surfaces (RISs) have attracted wide interest from industry and academia since they can shape the wireless environment into a desirable form with a low cost. In practice, RISs have three types of implementations: 1) reflective, where signals can be reflected to the users on the same side of the base station (BS), 2) transmissive, where signals can penetrate the RIS to serve the users on the opposite side of the BS, and 3) hybrid, where the RISs have a dual function of reflection and transmission. However, existing works focus on the reflective type RISs, and the other two types of RISs are not well investigated. In this letter, a downlink multi-user RIS-assisted communication network is considered, where the RIS can be one of these types. We derive the system sum-rate, and discuss which type can yield the best performance under a specific user distribution. Numerical results verify our analysis.

preprint2021arXiv

Simultaneously Transmitting and Reflecting (STAR)-RISs: A Coupled Phase-Shift Model

A simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided communication system is investigated, where an access point sends information to two users located on each side of the STAR-RIS. Different from current works assuming that the phase-shift coefficients for transmission and reflection can be independently adjusted, which is non-trivial to realize for purely passive STAR-RISs, a coupled transmission and reflection phase-shift model is considered. Based on this model, a power consumption minimization problem is formulated for both non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). In particular, the amplitude and phase-shift coefficients for transmission and reflection are jointly optimized, subject to the rate constraints of the users. To solve this non-convex problem, an efficient element-wise alternating optimization algorithm is developed to find a high-quality suboptimal solution, whose complexity scales only linearly with the number of STAR elements. Finally, numerical results are provided for both NOMA and OMA to validate the effectiveness of the proposed algorithm by comparing its performance with that of STAR-RISs using the independent phase-shift model and conventional reflecting/transmitting-only RISs.

preprint2021arXiv

Spatial Equalization Before Reception: Reconfigurable Intelligent Surfaces for Multi-path Mitigation

Reconfigurable intelligent surfaces (RISs), which enable tunable anomalous reflection, have appeared as a promising method to enhance wireless systems. In this paper, we propose to use an RIS as a spatial equalizer to address the well-known multi-path fading phenomenon. By introducing some controllable paths artificially against the multi-path fading through the RIS, we can perform equalization during the transmission process instead of at the receiver, and thus all the users can share the same equalizer. Unlike the beamforming application of the RIS, which aims to maximize the received energy at receivers, the objective of the equalization application is to reduce the inter-symbol interference (ISI), which makes phase shifts at the RIS different. To this end, we formulate the phase shift optimization problem and propose an iterative algorithm to solve it. Simulation results show that the multi-path fading effect can be eliminated effectively compared to benchmark schemes.

preprint2021arXiv

STAR-RISs: A Correlated T&R Phase-Shift Model and Practical Phase-Shift Configuration Strategies

A correlated transmission and reflection (T&R) phase-shift model is proposed for passive lossless simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs). A STAR-RIS-aided two-user downlink communication system is investigated for both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA). To evaluate the impact of the correlated T&R phase-shift model on the communication performance, three phase-shift configuration strategies are developed, namely the primary-secondary phase-shift configuration (PS-PSC), the diversity preserving phase-shift configuration (DP-PSC), and the T/R-group phase-shift configuration (TR-PSC) strategies. Furthermore, we derive the outage probabilities for the three proposed phase-shift configuration strategies as well as for those of the random phase-shift configuration and the independent phase-shift model, which constitute performance lower and upper bounds, respectively. Then, the diversity order of each strategy is investigated based on the obtained analytical results. It is shown that the proposed DP-PSC strategy achieves full diversity order simultaneously for users located on both sides of the STAR-RIS. Moreover, power scaling laws are derived for the three proposed strategies and for the random phase-shift configuration. Numerical simulations reveal a performance gain if the users on both sides of the STAR-RIS are served by NOMA instead of OMA. Moreover, it is shown that the proposed DP-PSC strategy yields the same diversity order as achieved by STAR-RISs under the independent phase-shift model and a comparable power scaling law with only 4 dB reduction in received power.

preprint2021arXiv

STAR: Simultaneous Transmission And Reflection for 360° Coverage by Intelligent Surfaces

A novel simultaneously transmitting and reflecting (STAR) system design relying on reconfigurable intelligent surfaces (RISs) is conceived. First, an existing prototype is reviewed and the potential benefits of STAR-RISs are discussed. Then, the key differences between conventional reflecting-only RISs and STAR-RISs are identified from the perspectives of hardware design, physics principles, and communication system design. Furthermore, the basic signal model of STAR-RISs is introduced, and three practical protocols are proposed for their operation, namely energy splitting, mode switching, and time switching. Based on the proposed protocols, a range of promising application scenarios are put forward for integrating STAR-RISs into next-generation wireless networks. By considering the downlink of a typical RIS-aided multiple-input single-output (MISO) system, numerical case studies are provided for revealing the superiority of STAR-RISs over other baselines, when employing the proposed protocols. Finally, several open research problems are discussed.

preprint2021arXiv

Statistical CSI Based Hybrid mmWave MIMO-NOMA with Max-Min Fairness

Non-orthogonal multiple access (NOMA) and millimeter wave (mmWave) are two key enabling technologies for the fifth-generation (5G) mobile networks and beyond. In this paper, we consider mmWave NOMA systems with max-min fairness constraints. On the one hand, existing beamforming designs aiming at maximizing the spectrum efficiency (SE) are unsuitable for the NOMA systems with fairness in this paper. On the other hand, previous work on about mmWave NOMA mostly depends on full knowledge of channel state information (CSI) which is extremely difficult to obtain accurately in mmWave communication systems. To address this problem, we propose a heuristic hybrid beamforming design based on the statistical CSI (SCSI) user grouping strategy. An analog beamforming scheme is first proposed to integrate the whole cluster users to mitigate the inter-cluster interference in the first stage. Then two digital beamforming designs are proposed to further suppress the interference based on SCSI. One is the widely used zero forcing (ZF) approach and the other is derived from the signal-to leakage-plus-noise ratio (SLNR) metric extended from orthogonal multiple access (OMA) systems. The effective gains fed back from the users are used for the power allocation. We introduce the quadratic transform (QT) method and bisection approach to reformulate this complex problem so as to rend it solvable. Simulation results show that our proposed algorithms outperform the previous algorithms in term of user fairness.

preprint2021arXiv

User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization

Federated learning (FL), as a type of collaborative machine learning framework, is capable of preserving private data from mobile terminals (MTs) while training the data into useful models. Nevertheless, from a viewpoint of information theory, it is still possible for a curious server to infer private information from the shared models uploaded by MTs. To address this problem, we first make use of the concept of local differential privacy (LDP), and propose a user-level differential privacy (UDP) algorithm by adding artificial noise to the shared models before uploading them to servers. According to our analysis, the UDP framework can realize $(ε_{i}, δ_{i})$-LDP for the $i$-th MT with adjustable privacy protection levels by varying the variances of the artificial noise processes. We then derive a theoretical convergence upper-bound for the UDP algorithm. It reveals that there exists an optimal number of communication rounds to achieve the best learning performance. More importantly, we propose a communication rounds discounting (CRD) method. Compared with the heuristic search method, the proposed CRD method can achieve a much better trade-off between the computational complexity of searching and the convergence performance. Extensive experiments indicate that our UDP algorithm using the proposed CRD method can effectively improve both the training efficiency and model quality for the given privacy protection levels.

H. Vincent Poor

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

147 published item(s)

Arithmetic Complexity of Solutions of the Dirichlet Problem

Confusions and Erasures of Error-Bounded Block Decoders with Finite Blocklength

Frontiers of Generative AI for Network Optimization: Theories, Limits, and Visions

Large Language Models over Networks: Collaborative Intelligence under Resource Constraints

Optimizing Server Placement for Vertical Federated Learning in Dynamic Edge/Fog Networks

Beam-Squint-Aided Hierarchical Sensing for Integrated Sensing and Communications with Uniform Planar Arrays

Time-Modulated Intelligent Reflecting Surfaces for Integrated Sensing, Communication and Security: A Generative AI Design Framework

A Tutorial on Extremely Large-Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications

Acceleration Estimation of Signal Propagation Path Length Changes for Wireless Sensing

Active RIS vs. Passive RIS: Which Will Prevail in 6G?

Asymptotic Learning Requirements for Stealth Attacks on Linearized State Estimation

Impact of Channel Models on Performance Characterization of RIS-Assisted Wireless Systems

6G for Vehicle-to-Everything (V2X) Communications: Enabling Technologies, Challenges, and Opportunities

A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence

A Joint Learning and Communications Framework for Federated Learning over Wireless Networks

Achievable Information-Energy Region in the Finite Block-Length Regime with Finite Constellations

Active RISs: Signal Modeling, Asymptotic Analysis, and Beamforming Design

An Indirect Rate-Distortion Characterization for Semantic Sources: General Model and the Case of Gaussian Observation

An Information-Theoretic View of Mixed-Delay Traffic in 5G and 6G

Approximation-based Threshold Optimization from Single Antenna to Massive SIMO Authentication

Beamforming Design for the Performance Optimization of Intelligent Reflecting Surface Assisted Multicast MIMO Networks

Block Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications

Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties

Channel Estimation and Multipath Diversity Reception for RIS-Empowered Broadband Wireless Systems Based on Cyclic-Prefixed Single-Carrier Transmission

Cognitive Radio-Inspired Rate-Splitting Multiple Access for Semi-Grant-Free Transmissions

Compressive Sensing-Based Recovery of Molecular Mixtures with Cross-Reactive Receptor Arrays

Context-Aware Security for 6G Wireless The Role of Physical Layer Security

Contextual Model Aggregation for Fast and Robust Federated Learning in Edge Computing

Decentralized Stochastic Optimization with Inherent Privacy Protection

Delay-Phase Precoding for Wideband THz Massive MIMO

Designing IRS-Aided MIMO Systems for Secrecy Enhancement

Distributed Stochastic Gradient Descent: Nonconvexity, Nonsmoothness, and Convergence to Local Minima

Energy-Efficient Resource Allocation for Aggregated RF/VLC Systems

Federated Stochastic Gradient Descent Begets Self-Induced Momentum

Flexible LED Index Modulation for MIMO Optical Wireless Communications

How Should IRSs Scale to Harden Multi-Antenna Channels?

Intelligent Omni-Surfaces: Reflection-Refraction Circuit Model, Full-Dimensional Beamforming, and System Implementation

Interference Cancellation GAN Framework for Dynamic Channels

Joint Beam Management and Power Allocation in THz-NOMA Networks

Joint Coding of URLLC and eMBB in Wyner&#39;s Soft-Handoff Network in the Finite Blocklength Regime

Learning Mixtures of Linear Dynamical Systems

Meta-material Sensor Based Internet of Things: Design, Optimization, and Implementation

Meta-Reinforcement Learning for Reliable Communication in THz/VLC Wireless VR Networks

Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps

Near-Field Hierarchical Beam Management for RIS-Enabled Millimeter Wave Multi-Antenna Systems

Olfaction-inspired MCs: Molecule Mixture Shift Keying and Cross-Reactive Receptor Arrays

On Differential Privacy for Federated Learning in Wireless Systems with Multiple Base Stations

Performance Analysis of Joint Active User Detection and Channel Estimation for Massive Connectivity

Performance Analysis of Multiple-Antenna Ambient Backscatter Systems at Finite Blocklengths

Performance Optimization for Semantic Communications: An Attention-based Reinforcement Learning Approach

Phase Shift Design in RIS Empowered Wireless Networks: From Optimization to AI-Based Methods

Proximal Policy Optimization-based Transmit Beamforming and Phase-shift Design in an IRS-aided ISAC System for the THz Band

Random Orthogonalization for Federated Learning in Massive MIMO Systems

Rate-Splitting Multiple Access for Downlink MIMO: A Generalized Power Iteration Approach

Reasoning on the Air: An Implicit Semantic Communication Architecture

Security-Reliability Trade-Off Analysis for SWIPT- and AF-Based IoT Networks with Friendly Jammers

Semi-Data-Aided Channel Estimation for MIMO Systems via Reinforcement Learning

Sensor Deployment and Link Analysis in Satellite IoT Systems for Wildfire Detection

Toward Experience-Driven Traffic Management and Orchestration in Digital-Twin-Enabled 6G Networks

Towards Industry 5.0: Intelligent Reflecting Surface (IRS) in Smart Manufacturing

Towards Ubiquitous Sensing and Localization With Reconfigurable Intelligent Surfaces

Wireless for Machine Learning

A Novel Wireless Communication Paradigm for Intelligent Reflecting Surface Based Symbiotic Radio Systems

A Tutorial on Ultra-Reliable and Low-Latency Communications in 6G: Integrating Domain Knowledge into Deep Learning

Artificial Intelligence Driven UAV-NOMA-MEC in Next Generation Wireless Networks

Covert Model Poisoning Against Federated Learning: Algorithm Design and Optimization

Downlink and Uplink Intelligent Reflecting Surface Aided Networks: NOMA and OMA

Federated Learning for 6G: Applications, Challenges, and Opportunities

Federated Learning: A Signal Processing Perspective

Learning Mixtures of Low-Rank Models

Learning to Decode Protograph LDPC Codes

Nonconvex Low-Rank Tensor Completion from Noisy Data

Joint Coding of URLLC and eMBB in Wyner's Soft-Handoff Network in the Finite Blocklength Regime