Search

An online shaping technique for high performance communication over Gaussian channels with Inter-Symbol Interference (ISI) and receiver Analog to Digital Converter (ADC) noise is presented. The technique uses online transmitter precoding over Pulse Amplitude Modulation (PAM) constellation, designed to shape the symbols distribution so that peak power constraint at the channel output is satisfied. An iterative decoder shares information between a modified M-BCJR module, which computes online the trellis transition probabilities of the shaped distribution, and turbo decoder. The result is a reduction in the required Effective Number Of Bits (ENOB) of the receiver ADC. We show that the transmitter precoding performs channel equalization without using any filter. At the limit of very high Signal to Noise Ratio (SNR) a complete channel inversion is possible so that the receiver signal spectrum becomes almost flat. Theoretical bounds are analytically derived which enable to assess the possible gain using the proposed method. For data rates of 200 Gbps and 400 Gbps over printed circuit board, simulations show that the shaping scheme enables reduction in the ENOB requirement as high as 1.43 bit and 1.78 bit, respectively, compared to uniform 4-PAM transmission with turbo equalization at the receiver side. [ABSTRACT FROM AUTHOR]

Orthogonal frequency-division multiplexing (OFDM) has been selected as a baseline waveform for long-term evolution (LTE) and fifth-generation new radio (5G NR). Fast-convolution (FC)-based frequency-domain signal processing has been recently considered as an effective tool for transmitter and receiver side subband filtering of OFDM-based waveforms. However, for the original continuous FC-based model, the filtering can, in general, be configured in time-direction only with the granularity of half subframe, corresponding to 7, 14, or 28 symbols with 15kHz, 30kHz, or 60kHz subcarrier spacing, respectively. In this paper, we present a symbol-synchronous FC-processing scheme flexibly allowing filter re-configuration with the time resolution equal to one OFDM symbol while supporting tight carrier-wise filtering for 5G NR in mixed-numerology scenarios with adjustable subcarrier spacings, center frequencies, and subband bandwidths, as well as providing co-existence with LTE. Proposed approach segments each stream of time-domain OFDM symbols into overlapping processing blocks of fixed size. Symbol synchronous processing is achieved by dynamically adjusting the overlap between the processing blocks while aligning the payload part of the processing blocks with the boundaries of the OFDM symbols. The proposed scheme is demonstrated to support the envisioned use cases of 5G NR and provide a flexible starting point for sixth generation (6G) development. [ABSTRACT FROM AUTHOR]

In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and sends back the CSI to the transmitter over a resolution-limited error-free feedback channel. With this partial CSI, the transmitter is supposed to select the optimum transmission rate, such that it maximizes the overall goodput of the communication system. This problem has been studied for the asymptotic blocklength regime, however, no solution has so far been presented for finite blocklength. Here, we study this problem in two cases: with and without constraint on reliability. We first formulate the optimization problems and analytically solve them. Iterative algorithms that successfully exploit the system parameters for both cases are presented. It is shown that although the achievable maximum goodput decreases with shorter blocklengths and higher reliability requirements, significant improvement can be achieved even with coarsely quantized feedback schemes. [ABSTRACT FROM AUTHOR]

This paper presents a novel antenna configuration to measure directions of multiple signal sources at the receiver in a THz mobile network via a single channel measurement. Directional communication is an intrinsic attribute of THz wireless networks and the knowledge of direction should be harvested continuously to maintain link quality. Direction discovery can potentially impose an immense burden on the network that limits its communication capacity exceedingly. To utterly mitigate direction discovery overhead, we propose a novel technique called spectrum shaping capable of measuring direction, power, and relative distance of propagation paths via a single measurement. We demonstrate that the proposed technique is also able to measure the transmitter antenna orientation. We evaluate the performance of the proposed design in several scenarios and show that the introduced technique performs similar to a large array of antennas while attaining a much simpler hardware architecture. Results show that the spectrum shaping with only two antennas placed 0.5 mm, 5 mm, and 1 cm apart performs direction of arrival estimation similar to a much more complex uniform linear array equipped with 7, 60, and 120 antennas, respectively. [ABSTRACT FROM AUTHOR]

This article presents two novel digital predistortion (DPD) based architectures that jointly mitigate the inphase/quadrature (IQ) modulator impairments and the power amplifier (PA) nonlinear distortion in wireless transmitters. The proposed architectures are multibit cartesian and complex delta-sigma modulator-based joint DPDs, called CDSM-JDPD and CXDSM-JDPD, respectively, which enable using low-cost digital-to-analog converters (DACs) while offering versatile linearization capabilities to combat the coexisting distortions of the PA and the IQ modulator. The proposed approach alleviates the need for reverse modeling and implementation of extra hardware to separately deal with frequency-dependent IQ impairments. Moreover, the CXDSM-JDPD enhances the linearization performance and relaxes the high oversampling ratio (OSR) requirement by quantizing the signal more efficiently. Furthermore, the presented concepts inherently support the use of low-resolution DACs, which offers a tremendous advantage in designing and implementing low-cost and energy-efficient radio transmitters. Extensive set of hardware-in-the-loop RF verification measurements with a commercial PA are provided, including two timely 5G New Radio (NR) scenarios at NR bands n3 and n78, while covering channel bandwidths up to 100 MHz and varying the OSR and the DAC bit resolution. The obtained results demonstrate the excellent linearization capabilities of the proposed solutions and their superiority compared to other DSM-based DPD approaches. [ABSTRACT FROM AUTHOR]

Optical communications systems’ performance is limited by physical layer nonlinearities inherent in some of their transmitter components. In order to overcome some of these limitations, several approaches utilizing artificial neural networks to digitally pre-distort the transmitted signal have been proposed in the last few years, alongside other more classical models. However, their performance was strongly dependent on the specific training sequence used. This work improves the performance of neural network-based direct learning approach for digital pre-distortion applications. The proposed method, which is based on the curriculum learning approach, aims to construct a training paradigm of gradually increasing complexity based on the statistical properties of the input signal, in order to achieve better convergence of the network. We prove that the proposed method defines a proper curriculum regardless of the training data distribution, considering the proposed wide-sense curriculum conditions and the case of binary weighting functions. A comparative analysis examines a pre-distorter for a coherent optical transmitter modelled by a Long Short-Term Memory neural network. An improvement of 4.8dB in terms of normalized mean-square error is demonstrated for the case of a 3-bits linear quantizer, compared to the conventional training scheme. [ABSTRACT FROM AUTHOR]

Rate splitting (RS) systems can better deal with imperfect channel state information at the transmitter (CSIT) than conventional approaches. However, this requires an appropriate power allocation that often has a high computational complexity, which might be inadequate for practical and large systems. To this end, adaptive power allocation techniques can provide good performance with low computational cost. This work presents novel robust and adaptive power allocation technique for RS-based multiuser multiple-input multiple-output (MU-MIMO) systems. In particular, we develop a robust adaptive power allocation based on stochastic gradient learning and the minimization of the mean-square error between the transmitted symbols of the RS system and the received signal. The proposed robust power allocation strategy incorporates knowledge of the variance of the channel errors to deal with imperfect CSIT and adjust power levels in the presence of uncertainty. An analysis of the convexity and stability of the proposed power allocation algorithms is provided, together with a study of their computational complexity and theoretical bounds relating the power allocation strategies. Numerical results show that the sum-rate of an RS system with adaptive power allocation outperforms RS and conventional MU-MIMO systems under imperfect CSIT. [ABSTRACT FROM AUTHOR]

Computation over multiple access channels (CoMAC) has been proposed to solve the problem of spectrum scarcity in wireless networks, which combines communication and computation efficiently using the superposition property of wireless channels. In this paper, we consider a multi-cluster CoMAC network, whose performance is affected by the inter-cluster interference and the non-uniform fading. To minimize the sum mean squared error of signals aggregated at different fusion centers (FCs), we propose a transceiver design for multi-cluster CoMAC. Specifically, we adopt a uniform-forcing transmitter design to formulate the receiver design as a quadratic sum-of-ratios problem with nonconvex quadratic constraints. Then, we propose a branch-and-bound algorithm to find its optimal solution with a given error tolerance. To solve the problem in a decentralized way, we develop a distributed algorithm based on the primal decomposition theory. Each subproblem is solved by using the successive convex approximation method. Further combining Lagrange duality, we derive the optimal solution structure of each subproblem, based on which we can find the solution with lower complexity. Simulation results demonstrate the effectiveness of the proposed distributed transceiver design. [ABSTRACT FROM AUTHOR]

Owing to the factors such as controllable mobility, ready-to-use technology, low cost, easy implementation, and so on, unmanned aerial vehicle (UAV) possesses tremendous potential to be one of the primary candidates for next-generation (6G) wireless networks. This paper presents a UAV-assisted multiuser communication network where a multiple antenna UAV base station (BS) serves multiple single antenna ground users (GUs). UAV-BS uses a laser source-based charging mechanism to fulfill its power requirement and applies simultaneous wireless information and power transfer (SWIPT) in the downlink in order to provide desired power to energy-constrained GUs. Also, a clustering-based hybrid multiple access technique is used that combines both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) signaling to transmit the information to all GUs, simultaneously. Due to the involved analytical complexity corresponding to the multiple antennas and users, we use a hybrid beamforming method for efficient communication. Next, we analyze the performance of the proposed framework in terms of user outage probabilities, their respective throughput, and average power harvested considering non-linear energy harvesting and derive expressions of these performance metrics. Moreover, we formulate an optimization problem where the throughput of one GU is maximized by optimally choosing the power allocation parameter while ensuring the desired target throughput at other GU in each cluster. We also illustrate how crucial is the optimal selection of the target rates to maximize the network performance. Simulation results are provided to validate the accuracy of derived expressions and to highlight the dominance of hybrid beamforming and hybrid NOMA compared to conventional methods on the performance of the considered network. [ABSTRACT FROM AUTHOR]

In this paper, the design of a multiple-input multiple-output (MIMO) optical wireless communication (OWC) link based on vertical cavity surface emitting laser (VCSEL) arrays is systematically carried out with the aim to support data rates in excess of 1 Tb/s for the backhaul of sixth generation (6G) indoor wireless networks. The proposed design combines direct current optical orthogonal frequency division multiplexing (DCO-OFDM) and a spatial multiplexing MIMO architecture. For such an ultra-high-speed line-of-sight (LOS) OWC link with low divergence laser beams, maintaining alignment is of high importance. In this paper, two types of misalignment error between the transmitter and receiver are distinguished, namely, radial displacement error and orientation angle error, and they are thoroughly modeled in a unified analytical framework assuming Gaussian laser beams, resulting in a generalized misalignment model (GMM). The derived GMM is then extended to MIMO arrays and the performance of the MIMO-OFDM OWC system is analyzed in terms of the aggregate data rate. Novel insights are provided into the system performance based on computer simulations by studying various influential factors such as beam waist, array configuration and different misalignment errors, which can be used as guidelines for designing short range Tb/s MIMO OWC systems. [ABSTRACT FROM AUTHOR]

In this paper an analytical model is introduced to describe the impulse response of the diffusive channel between a pointwise transmitter and a given fully-absorbing (FA) receiver in a molecular communication (MC) system. The presence of neighbouring FA nanomachines in the environment is taken into account by describing them as sources of negative molecules. The channel impulse responses of all the receivers are linked in a system of integral equations. The solution of the system with two receivers is obtained analytically. For a higher number of receivers the system of integral equations is solved numerically. It is also shown that the channel impulse response shape is distorted by the presence of the neighbouring FA interferers. For instance, there is a time shift of the peak in the number of absorbed molecules compared to the case without interference, as predicted by the proposed model. The analytical derivations are validated by means of particle based simulations. [ABSTRACT FROM AUTHOR]

Space modulation techniques (SMTs) are multiple-input multiple-output (MIMO) transmitter system implementations that have shown to achieve favorable properties compared to existing MIMO technologies. This includes properties such as lower power consumption, cost, and enhanced error performance. As modern wireless standards have come to demand also more reliability and less latency, in recent work analyzing the reliability of SMTs, it was shown that existing SMT implementations do not effectively perform under degraded system conditions. Essentially, under certain failure conditions, parts of SMT systems become unusable although still effectively operational. As a result, affecting the best achievable spectral efficiency, and thus system data rate of the system. In this work, novel SMT implementations are presented and referred to as hybrid SMTs (HSMTs). HSMTs are designed to degrade in a manner that keeps use of operational hardware and maintains a higher spectral efficiency for longer duration. Four different HSMTs are presented namely; hybrid space shift keying (HSSK), hybrid spatial modulation (HSM), hybrid quadrature space shift keying (HQSSK), and hybrid quadrature spatial modulation (HQSM). Additionally, a reliability analysis framework for HSMTs is presented using two different analytical tools and all introduced models are comparatively studied. [ABSTRACT FROM AUTHOR]

More often than not, transmitters (Txs) in wireless networks operate using directional radiation patterns where the main radiation lobe creates a three-dimensional conic-shaped volume. In this context, any receiver (Rx) placed inside it can establish a strong communication link. Since the Rx location is not always known, it is desirable to investigate its random position effect to describe the link performance in a reliable manner. As in most cases, Rxs lie far away from the apex where the Tx is placed, we investigate the random location problem inside a truncated conic shape where the cone arises as a limiting case. To this end, we deduce a set of statistical metrics, including the random distance from the apex to a random point position. As an application, we focus on the outage performance of an unmanned aerial vehicle (UAV) communications scenario susceptible to Nakagami- $m$ fading and derive novel closed-form expressions for the composite model. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing interest in exploring the application of single-photon avalanche diode (SPAD) in optical wireless communication (OWC). As a photon counting detector, SPAD can provide much higher sensitivity compared to the other commonly used photodetectors. However, SPAD-based receivers suffer from significant dead-time-induced non-linear distortion and signal dependent noise. In this work, we propose a novel SPAD-based OWC system in which the non-linear distortion caused by dead time can be successfully eliminated by the pre-distortion of the signal at the transmitter. In addition, another system with joint pre-distortion and noise normalization functionality is proposed. Thanks to the additional noise normalization process, for the transformed signal at the receiver, the originally signal dependent noise becomes signal independent so that the conventional signal detection techniques designed for AWGN channels can be employed to decode the signal. Our numerical results demonstrate the superiority of the proposed SPAD-based systems compared to the existing systems in terms of BER performance and achievable data rate. [ABSTRACT FROM AUTHOR]

This paper studies the precoder design problem of achieving max-min fairness (MMF) amongst users in multigateway multibeam satellite communication systems with feeder link interference. We propose a beamforming strategy based on a newly introduced transmission scheme known as rate-splitting multiple access (RSMA). RSMA relies on multi-antenna rate-splitting at the transmitter and successive interference cancellation (SIC) at the receivers, such that the intended message for a user is split into a common part and a private part and the interference is partially decoded and partially treated as noise. In this paper, we formulate the MMF problem subject to per-antenna power constraints at the satellite for the system with imperfect channel state information at the transmitter (CSIT). We also consider the case of two-stage precoding which is assisted by on- board processing (OBP) at the satellite. Numerical results obtained through simulations for RSMA and the conventional linear precoding method are compared. When RSMA is used, MMF rate gain is promised and this gain increases when OBP is used. RSMA is proven to be promising for multigateway multibeam satellite systems whereby there are various practical challenges such as feeder link interference, CSIT uncertainty, per-antenna power constraints, uneven user distribution per beam and frame-based processing. [ABSTRACT FROM AUTHOR]

High resolution analog to digital converters (ADCs) are conventionally used at the receiver terminals to store an accurate digital representation of the received signal, thereby allowing for reliable decoding of transmitted messages. However, in a wide range of applications, such as communication over millimeter wave and massive multiple-input multiple-output (MIMO) systems, the use of high resolution ADCs is not feasible due to power budget limitations. In the conventional fully digital receiver design, where each receiver antenna is connected to a distinct ADC, reducing the ADC resolution leads to performance loss in terms of achievable rates. One proposed method to mitigate the rate-loss is to use analog linear combiners leading to design of hybrid receivers. Here, the hybrid framework is augmented by the addition of delay elements to allow for temporal analog processing. Two new classes of receivers consisting of delay elements, analog linear combiners, and one-bit ADCs are proposed. The fundamental limits of communication in single and multi-user (uplink and downlink) MIMO systems employing the proposed receivers are investigated. In the high signal to noise ratio regime, it is shown that the proposed receivers achieve the maximum achievable rates among all receivers with the same number of one-bit ADCs. [ABSTRACT FROM AUTHOR]

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

The reconfigurable intelligent surface (RIS), which consists of many low-cost reflecting elements, can enhance the reception of the desired signal and suppress the interference. Considering the above advantages, this paper investigates the RIS-assisted wireless communication in the presence of an interferer, where a receiver receives the desired signal and interference from a transmitter and an interferer, respectively, and the RIS is deployed to assist this system. First, an interference-limited channel capacity maximization problem is formulated, and a numerical algorithm based on the fraction programming and optimality conditions is proposed to obtain the optimal solution. Then, this paper shows the upper boundary of the maximal capacity with interference and discusses what kind of channel conditions can achieve the upper boundary and the corresponding optimal phase shifts. Next, this paper analyzes the asymptotic behaviors of the maximal capacity in the scenarios that some or all of the number of reflecting elements, antennas at the transmitter, and interferer go to infinity. Finally, this paper generalizes the above results to the multiple interferers scenario. [ABSTRACT FROM AUTHOR]

This work is focused on the system-level performance of a broadcast network. Since all transmitters in a broadcast network transmit identical signals, received signals from multiple transmitters can be combined to improve system performance. We develop a stochastic geometry-based analytical framework to derive the coverage of a typical receiver. We show that there may exist an optimal connectivity radius that maximizes the rate coverage. Our analysis includes the fact that users may have their individual content/advertisement preferences. We assume that there are multiple classes of users with each user class preferring a particular type of content/advertisements and the users will pay the network only when they can see content aligned with their interest. The operator may choose to transmit multiple contents simultaneously to cater to more users’ interests to increase its revenue. We present revenue models to study the impact of the number of contents on the operator revenue. We consider two scenarios for users’ distribution- one where users’ interest depends on their geographical location and the other where it doesn’t. With the help of numerical results and analysis, we show the impact of various parameters including content granularity, connectivity radius, and rate threshold and present important design insights. [ABSTRACT FROM AUTHOR]

Rate-Splitting Multiple Access (RSMA) has recently appeared as a powerful and robust multiple access and interference management strategy for downlink Multi-user (MU) multi-antenna communications. In this work, we study the precoder design problem for RSMA scheme in downlink MU systems with both perfect and imperfect Channel State Information at the Transmitter (CSIT) and assess the role and benefits of transmitting multiple common streams. Unlike existing works which have considered single-antenna receivers (Multiple-Input Single-Output–MISO), we propose and extend the RSMA framework for multi-antenna receivers (Multiple-Input Multiple-Output–MIMO) and formulate the precoder optimization problem with the aim of maximizing the Weighted Ergodic Sum-Rate (WESR). Precoder optimization is solved using Sample Average Approximation (SAA) together with the proposed vectorization and Weighted Minimum Mean Square Error (WMMSE) based approach. Achievable sum-Degree of Freedom (DoF) of RSMA is derived for the proposed framework as an increasing function of the number of transmitted common and private streams, which is further validated by the Ergodic Sum Rate (ESR) performance using Monte Carlo simulations. Conventional MU–MIMO based on linear precoders and Non-Orthogonal Multiple Access (NOMA) schemes are considered as baselines. Numerical results show that with imperfect CSIT, the sum-DoF and ESR performance of RSMA is superior to those of the two baselines, and is increasing with the number of transmitted common streams. Moreover, by better managing the interference, RSMA not only has significant ESR gains over baseline schemes but is more robust to CSIT inaccuracies, network loads and user deployments. [ABSTRACT FROM AUTHOR]

This paper investigates the downlink (DL) transmit design for massive multiple-input multiple-output (MIMO) low-earth-orbit (LEO) satellite communication systems, where only the slow-varying statistical channel state information is exploited at the transmitter. The channel model for the DL massive MIMO LEO satellite system is established, in which both the satellite and the user terminals (UTs) are equipped with uniform planar arrays. Observing the rank-one property of the channel matrices, we show that the single-stream precoding for each UT is the optimal choice that maximizes the ergodic sum rate. This favorable result simplifies the complicated design of transmit covariance matrices into that of precoding vectors without any loss of optimality. Then, an efficient algorithm is devised to compute the precoding vectors. Furthermore, we formulate an approximate transmit design based on the upper bound on the ergodic sum rate, for which the optimality of single-stream precoding still holds. We show that, in this case, the design of precoding vectors can be simplified into that of scalar variables, for which an effective algorithm is developed. In addition, a low-complexity learning framework is proposed for optimizing the scalar variables. Simulation results demonstrate that the proposed approaches can achieve significant performance gains over the existing schemes. [ABSTRACT FROM AUTHOR]

The performance of Simultaneous Wireless Information and Power Transfer (SWIPT) is mainly constrained by the received Radio-Frequency (RF) signal strength. To tackle this problem, we introduce an Intelligent Reflecting Surface (IRS) to compensate the propagation loss and boost the transmission efficiency. This paper proposes a novel IRS-aided SWIPT system where a multi-carrier multi-antenna Access Point (AP) transmits information and power simultaneously, with the assist of an IRS, to a single-antenna User Equipment (UE) employing practical receiving schemes. Considering harvester nonlinearity, we characterize the achievable Rate-Energy (R-E) region through a joint optimization of waveform, active and passive beamforming based on the Channel State Information at the Transmitter (CSIT). This problem is solved by the Block Coordinate Descent (BCD) method, where we obtain the active precoder in closed form, the passive beamforming by the Successive Convex Approximation (SCA) approach, and the waveform amplitude by the Geometric Programming (GP) technique. To facilitate practical implementation, we also propose a low-complexity design based on closed-form adaptive waveform schemes. Simulation results demonstrate the proposed algorithms bring considerable R-E gains with robustness to CSIT inaccuracy and finite IRS states, and emphasize the importance of modeling harvester nonlinearity in the IRS-aided SWIPT design. [ABSTRACT FROM AUTHOR]

Rate splitting (RS) and wireless edge caching are essential means for meeting the quality of service requirements of future wireless networks. In this work, we focus on the cross-layer co-design of wireless edge caching schemes with sophisticated physical layer techniques, which facilitate non-orthogonal multiple access and interference mitigation. A flexible caching-aided RS (CRS) technique is proposed that operates in various modes that specify the cache placement at the receivers. We consider two caching policies: the intelligent coded caching (CC), as well as the well-known most popular content (MPC) policy. Both caching policies are integrated within the design parameters of RS in order to serve multiple cache-enabled receivers. The proposed technique is investigated from a system level perspective by taking into account spatial randomness. We consider a single cell network consisting of center and edge receivers and provide a comprehensive analytical framework for the evaluation of the proposed technique in terms of achieved rates. Specifically, we derive the rate achieved at each receiver under minimum rate constraints while incorporating the cache placement characteristics. Numerical results are presented which highlight the flexibility of the proposed technique and show how caching can be exploited in order to further boost the performance of RS. [ABSTRACT FROM AUTHOR]

This paper proposes a novel imperfect transmitter (TX) model, namely the membrane fusion (MF)-based TX, that adopts MF between a vesicle and the TX membrane to release molecules encapsulated within the vesicle. For the MF-based TX, the molecule release probability and the fraction of molecules released from the TX membrane are derived. Incorporating molecular degradation and a fully-absorbing receiver (RX), the channel impulse response (CIR) is derived for two scenarios: 1) Both TX and RX are static, and 2) both TX and RX are diffusion-based mobile. Moreover, a sequence of bits transmitted from the TX to the RX is considered. The average bit error rate (BER) is obtained for both scenarios, wherein the probability mass function (PMF) of the number of molecules absorbed in the mobile scenario is derived. Furthermore, a simulation framework is proposed for the MF-based TX, based on which the derived analytical expressions are validated. Simulation results show that a low MF probability or low vesicle mobility slows the release of molecules and reduces the molecule hitting probability at the RX. Simulation results also indicate the difference between the MF-based TX and an ideal point TX in terms of the inter-symbol interference (ISI). [ABSTRACT FROM AUTHOR]

Blind Interference Alignment (BIA) schemes create and exploit channel coherence patterns without the knowledge of channel realizations at transmitters, while beamforming schemes rely primarily on channel knowledge available to the transmitters without regard to channel coherence patterns. In order to explore the compatibility of these disparate ideas and the possibility of synergistic gains, this work studies the Degrees of Freedom (DoF) of the 2-user ${(M_{1}\times N_{1})(M_{2}\times N_{2})}$ Multiple-Input Multiple-Output (MIMO) Interference Channel (IC) where Transmitter 1 is equipped with reconfigurable antennas and has no channel knowledge, while Transmitter 2 has partial channel knowledge but no reconfigurable antennas. Taking a fundamental dimensional analysis perspective, the main question is to identify which antenna configurations allow synergistic DoF gains. The main results of this work are two-fold. The first result identifies antenna configurations where both reconfigurable antennas and partial channel knowledge are individually beneficial, as those where $M_{1}< N_{1}< \min (M_{2},N_{2})$. The second result shows that synergistic gains exist in each of these settings, over the best known solutions that rely on either reconfigurable antennas or partial channel knowledge alone. Coding schemes that jointly exploit partial channel knowledge and reconfigurable antennas emerge as a byproduct of the analysis. [ABSTRACT FROM AUTHOR]

Heterogenous networks are mainly limited by interference. Nowadays, the advances in reconfigurable antennas allow us to implement blind interference alignment (BIA) schemes, which avoid the need for channel state information at the transmitter (CSIT) while providing an increasing multiplexing gain, i.e., the achievable DoF, as the number of users increases. In this work, we propose a downlink transmission scheme based on BIA for managing the inter-tier interference in $K$ -tier networks, referred to as tier BIA (tBIA). The tBIA scheme can be implemented considering that each tier employs any BIA scheme for managing the intracell and intercell interference. In this sense, considering proper BIA schemes applied to each tier, tBIA fully cancels all the sources of interference. After that, the DoF outer-bound for $K$ -tier networks without CSIT is derived. It is shown that tBIA reaches this outer-bound. Furthermore, it is demonstrated that fully managing the inter-tier interference provides larger DoF in the whole network than turning off any tier with the aim of improving the achievable DoF in the remaining tiers. Simulation results show that the proposed tBIA scheme provides greater DoF and improves the user rates in comparison with other schemes without CSIT in multi-tier networks. [ABSTRACT FROM AUTHOR]

Covert wireless communications aim to hide the existence of transmission behavior from watchful adversaries to enhance security. In this paper, we propose a spectrum mask based covert communication strategy in Internet of Things (IoT) networks, where the overt channels are leveraged to enhance the covertness. Specifically, the legitimate IoT transmitter superimposes its own message on the overt channel to avoid being detected by the warden. We assume that proper Gaussian signaling (PGS) is adopted at the overt channel, and improper Gaussian signaling (IGS) is adopted at the legitimate transmitter to improve the covert transmission performance. To maximize the covert rate of the legitimate IoT system, a joint transmit power and IGS factor optimization problem is formulated under the constraints of covertness requirement. The metric of minimum error detection probability, that represents the worst-case for the legitimate transmitter, is utilized to measure the covertness. By exploiting the piece-wise monotonic properties of the objective function and the constraints, we derive the optimal transmit power and IGS factor pairs in both the IGS and PGS schemes. Finally, extensive numerical results are presented to demonstrate that the IGS scheme can improve the covert rate compared to the PGS scheme under a given covertness constraint. [ABSTRACT FROM AUTHOR]

We propose new transmission schemes and receiver algorithms for unsourced multiple access (UMA) in MIMO and massive MIMO channels. Each active transmitter’s information bits are first channel encoded. The coded bits are divided into sub-blocks and each sub-block is modulated and transmitted. For both MIMO and massive MIMO channels, the conventional nonlinear modulation can be employed where each sub-block of coded bits is mapped to a transmitted signal vector. For the massive MIMO channel, we propose a new hybrid modulation scheme to reduce the receiver complexity, where the first sub-block is nonlinearly modulated, and the subsequent sub-blocks are linearly modulated and spread by the first sub-block signal. We also propose sparsity-exploiting blind receiver algorithms. Specifically, for the MIMO case, we exploit the codeword sparsity inherent in the UMA system, and a channel clustering technique, to estimate the channel and the transmitted signal of each transmitter. For the massive MIMO, in addition to the codeword sparsity, we further exploit the channel sparsity and user sparsity in estimating the channel and transmitted signal of each transmitter. The proposed receiver algorithms for both MIMO and massive MIMO channels output either hard or soft estimates of the coded bits, and therefore single-user channel decoding of the information bits can be performed for each transmitter. Extensive simulation results are provided to demonstrate the performances of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Molecular communication often involves coexisting links where certain links may have priority over others. In this work, we consider a system in three-dimensional (3-D) space with two coexisting communication links, each between a point transmitter and a spherical fully-absorbing receiver (FAR), where one link (termed primary) has priority over the second link (termed secondary). The system implements the underlay cognitive-communication strategy for the co-existence of both links, which use the same type of molecules for information transfer. The mutual influence of FARs existing in the same communication medium results in competition for capturing the information-carrying molecules. In this work, first, we derive an approximate hitting probability equation for a diffusion-limited molecular communication system with two spherical FARs of different sizes, considering the effect of molecular degradation. The derived equation is then used for the performance analysis of primary and secondary links in a cognitive molecular communication scenario. We show that the simple transmit control strategy at the secondary transmitter can improve the overall system’s performance. We study the influence of molecular degradation and decision threshold on the system performance. We also show that the parameters of the system need to be carefully set to improve the performance. [ABSTRACT FROM AUTHOR]

In adversarial scenarios, it is crucial to timely monitor what tactical messages that opponent transmitters are sending to intended receiver(s), and disrupt the transmissions immediately if in need. The issue becomes more challenging in face of an intelligent transmitter. To address the above-stated issue, a full-duplex (FD) technique is utilized to enable simultaneous jamming and eavesdropping (SJE) at a friendly jammer node. In particular, the “Two Birds with One Stone” strategy is utilized at the jammer node to realize effective rate degradation and information eavesdropping. A confrontation game between an intelligence-empowered FD jammer and its opponent is investigated. Specifically, to capture their adversarial relationship in an environment with incomplete information, a power-domain Bayesian-Stackelberg game is proposed. The existence of a Stackelberg equilibrium (SE) power solution is proved. The semi-closed-form solutions of SE are derived, which are proved to be asymptotically optimal (have a gap of less than 1% with the exact utility), and improves the jammer node 10% utility compared with the Nash equilibrium. Additionally, the SJE strategy outperforms the half-duplex (HD) and other benchmark schemes. [ABSTRACT FROM AUTHOR]

Recent information-theoretic studies have resulted in several interference management (IM) techniques that promise significant capacity improvements over interference avoidance techniques. However, in practice, the stable throughput region is a more relevant metric compared to the capacity region. In this work, we focus on the stable throughput region of a two-pair intermittent interference network with distributed transmitters and propose a queue-based transmission protocol in different regimes to handle the data between queues. In this context, we translate physical-layer IM protocols to accommodate stochastic message arrivals. To evaluate our proposed techniques, we compare the stable throughput region to the capacity region and show, through simulations, that the stable throughput region matches the capacity region when the latter is known. We show that in order to achieve the optimal stable throughput region, new ingredients are needed when compared to prior results. We quantify the trade-off between encoding/decoding complexity of the proposed scheme (in terms of number of required algebraic operations), and the achievable rates. Finally, we study the lifetime of messages (i.e. the duration from arrival to successful delivery) versus the total communication time, and we observe that the average lifetime scales as the square root of the total communication time. [ABSTRACT FROM AUTHOR]

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security threats. In this work, we study the impact of having intermittent feedback links on the capacity region of the canonical two-user erasure broadcast channels. In our model, at any time instant, each receiver broadcasts its CSI, and at any other node, this information either becomes available with unit delay or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that the CSI from both receivers are erased at the transmitter. In particular, if at any time, the CSI from at least one of the two receivers is available at the other two nodes, then the outer-bounds match the capacity with global delayed CSI. We also provide capacity-achieving transmission strategies under certain scenarios, and we establish a connection between this problem and Blind Index Coding with feedback. [ABSTRACT FROM AUTHOR]

We analyze the symbol error probability (SEP) of $M$ -ary pulse amplitude modulation ($M$ -PAM) receivers equipped with optimal low-resolution quantizers. We first show that the optimum detector can be reduced to a simple decision rule. Using this simplification, an exact SEP expression for quantized $M$ -PAM receivers is obtained when Nakagami- $m$ fading channel is considered. The derived expression enables the optimization of the quantizer and/or constellation under the minimum SEP criterion. Our analysis of optimal quantization for equidistant $M$ -PAM receiver reveals the existence of error floor which decays at a double exponential rate with increasing quantization bits, $b$. Moreover, by also allowing the transmitter to optimize the constellation based on the statistics of the fading channel, we prove that the error floor can be eliminated but at a lower decay exponent than the unquantized case. Characterization of this decay exponent is provided in this paper. We also expose the outage performance limitations of SEP-optimal uniform quantizers. To be more precise, its decay exponent does not improve with $b$. Lastly, we demonstrate that the decay exponent of a quantized receiver can be complemented by receive antenna diversity techniques. [ABSTRACT FROM AUTHOR]

With emerging wireless technologies like 6G, many new applications like autonomous systems evolve which have strict demands on the reliability and latency of data communications. In the scenario of the commonly investigated independent slow fading links, the zero-outage capacity (ZOC) is zero and retransmissions are therefore inevitable. In this work, we show that a positive ZOC can be achieved under the same setting of slow fading with constant transmit power and without perfect channel state information at the transmitter, if the joint distribution of the channel gains follows certain structures. This allows reliable reception without any outages, thus not requiring retransmissions. Based on a systematic copula approach, we show that there exists a set of dependency structures for which positive ZOCs can be achieved for both maximum ratio combining (MRC) and selection combining (SC). We characterize the maximum ZOC within a finite number of bits. The results are evaluated explicitly for the special cases of Rayleigh fading and Nakagami- $m$ fading in order to quantify the ZOCs for common fading models. [ABSTRACT FROM AUTHOR]

Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. In this work, we study the performance of RSMA under the important setup of imperfect Channel State Information at the Transmitter (CSIT) originating from user mobility and latency/delay (between CSI acquisition and data transmission) in the network. We derive a lower bound on the ergodic sum-rate of RSMA for an arbitrary number of transmit antennas, number of users, user speed and transmit power. Then, we study the power allocation between common and private streams and obtain a closed-form solution for optimal power allocation that maximizes the obtained lower bound. The proposed power allocation greatly reduces precoder design complexity for RSMA. By Link-Level Simulations (LLS), we demonstrate that RSMA with the proposed power allocation is robust to the degrading effects of user mobility and has significantly higher performance compared to conventional multi-user (massive) Multiple-Input Multiple-Output (MIMO) strategies. The work has important practical significance as results demonstrate that, in contrast to conventional multi-user (massive) MIMO whose performance collapse under mobility, RSMA can maintain reliable multi-user connectivity in mobile deployments. [ABSTRACT FROM AUTHOR]

The problem of coding for informed receivers (IR) is considered, where a transmitter multicasts a bunch of messages to its associated receivers, each of which already has a subset of messages as side information. Which receiver has what side information is unknown to the transmitter. A family of polar codes for IR was proposed for binary-input channels in (Huang and Shieh, 2018), which was shown to provide excellent side information gain regardless of side information configuration and content. A trial extension of this scheme to high-order modulations, however, was unsatisfactory. In this paper, two families of systematic polar coded modulations for IR are proposed. In the first family, by building a connection between the message bits and modulated symbols under systematic polar codes, we leverage the bit assignments and labeling techniques such that receiver side information can be directly translated to a minimum distance gain. In the second family, a permutation operation is added before modulation such that the message bits can be properly reordered to further advance and balance the gains among different side information configurations. Simulations show that the proposed schemes provide large and balanced side information gains and significantly outperform the system directly adapted from (Huang and Shieh, 2018) onto high-order modulations. [ABSTRACT FROM AUTHOR]

It has been a challenging task to derive the complementary cumulative distribution function (CCDF) of aggregate interference as closed-form in Poisson point process (PPP). In this paper, we consider wireless communication networks where transmitters are all distributed according to homogeneous PPP and study the CCDF of the interference. Mainly, we derive generalized bounds on the CCDF of aggregate interference from whole homogeneous PPP based on discretization of interference, which considerably enhance tightness compared to the previous bounds. These bounds can be used to the analysis requiring the distribution for aggregate interference, such as deployment and activation of BSs, massive MIMO, and millimeter wave communication networks. As examples of utilizing the derived bounds, we derive tractable coverage probabilities of uplink non-orthogonal multiple access (NOMA) users and downlink users in cellular networks under line-of-sight(LoS)/non-line-of-signt (NLOS) channels, respectively. In NOMA, we derive the closed-form bounds on coverage probability when successive interference cancellation is adopted for NOMA signal demodulation. Using the proposed bounds, we also obtain the bounds on coverage probability of a cellular system with LoS/NLOS channels. The tightness of bounds in this work is shown via numerical comparison. Moreover, we mathematically prove the convergence of bounds to exact CCDF. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the use of intelligent reflecting surfaces (IRSs) to relax the line-of-sight requirement of free space optical (FSO) systems. Considering a Gaussian laser beam, we first design a phase-shift distribution across the IRS that enables the reflection of the incident beam in any desired direction, i.e., realizing the generalized law of reflection. Moreover, for the designed phase-shift profile, we show that there exists an equivalent mirror-assisted FSO system that generates a reflected electric field on a mirror that is identical to that on the IRS in the original system. However, the location of the laser source and the properties of the emitted Gaussian laser beam are different in the original and the equivalent systems. This equivalence allows us to study the mirror-assisted system, employing the image method from geometric optics, instead of directly analyzing the original IRS-assisted system. Based on this analysis, we model the geometric and misalignment losses (GML) and characterize the impact of the physical parameters of the IRS, such as its size, position, and orientation, on the end-to-end FSO channel. Moreover, we develop a statistical model for the GML which accounts for the random movements of IRS, transmitter (Tx), and receiver (Rx) due to building sway. Furthermore, we analyze the outage probability of an IRS-assisted FSO link based on the derived channel model. Our simulation results validate the accuracy of the developed channel model and offer various insights for system design. For instance, both our simulations and theoretical analysis reveal that even if the variances of the fluctuations of the Tx, IRS, and Rx positions caused by building sway are identical, their impact on the end-to-end channel is not necessarily the same and depends on the relative positioning of these three nodes. [ABSTRACT FROM AUTHOR]

Cloud radio access networks (C-RAN) enable a network platform for beyond the fifth generation of communication networks (B5G), which incorporates the advances in cloud computing technologies to modern radio access networks. Recently, rate splitting multiple access (RSMA), relying on multi-antenna rate splitting (RS) at the transmitter and successive interference cancellation (SIC) at the receivers, has been shown to manage the interference in multi-antenna communication networks efficiently. This paper considers applying RSMA in C-RAN. We address the practical challenge of a transmitter that only knows the statistical channel state information (CSI) of the users. To this end, the paper investigates the problem of stochastic coordinated beamforming (SCB) optimization to maximize the ergodic sum-rate (ESR) in the network. Furthermore, we propose a scalable and robust RS scheme where the number of the common streams to be decoded at each user scales linearly with the number of users, and the common stream selection only depends on the statistical CSI. The setup leads to a challenging stochastic and non-convex optimization problem. A sample average approximation (SAA) and weighted minimum mean square error (WMMSE) based algorithm is adopted to tackle the intractable stochastic non-convex optimization and guarantee convergence to a stationary point asymptotically. The numerical simulations demonstrate the efficiency of the proposed RS strategy and show a gain up to 27% in the achievable ESR compared with state-of-the-art schemes, namely treating interference as noise (TIN) and non-orthogonal multiple access (NOMA) schemes. [ABSTRACT FROM AUTHOR]

The rapid growth of the so-called Internet of Things is expected to significantly expand and support the deployment of resource-limited devices. Therefore, intelligent scheduling protocols and technologies such as wireless power transfer, are important for the efficient implementation of these massive low-powered networks. This paper studies the performance of a wireless powered communication network, where multiple batteryless devices harvest radio-frequency from a dedicated transmitter in order to communicate with a common information receiver (IR). We investigate several novel selection schemes, corresponding to different channel state information requirements and implementation complexities. In particular, each scheme schedules the $k$ -th best device based on: a) the end-to-end (e2e) signal-to-noise ratio (SNR), b) the energy harvested at the devices, c) the uplink transmission to the IR, and d) the conventional/legacy max-min selection policy. We consider a non-linear energy harvesting (EH) model and derive analytical expressions for the outage probability of each selection scheme by using tools from high order statistics. Moreover, an asymptotic scenario in terms of the number of devices is considered and, by applying extreme value theory, the system’s performance is evaluated. We derive a complete analytical framework that provides useful insights for the design and realization of such networks. [ABSTRACT FROM AUTHOR]

We consider two-way multi-pair full-duplex (FD) massive multi-input-multi-output (mMIMO) relaying, where multiple FD user-pairs exchange information via a shared FD relay. We derive a closed-form spectral efficiency (SE) lower bound by considering i) dynamic analog-to-digital converter (ADC) and digital-to-analog converter (DAC) architecture at the relay, where each antenna is connected to a different resolution ADC/DAC; and ii) low cost radio frequency (RF) chains at the relay and users. The dynamic ADC/DAC architecture allows us to judiciously choose ADC/DAC resolution to achieve high SE with low power consumption. We unlike, the most existing mMIMO relaying works, consider a correlated Rician fading channel, which captures realistic line-of-sight (LoS) signal propagation and spatial correlation between closely-packed relay antennas. We maximize the derived SE lower bound by first proposing its valid surrogate function, and then by using minorization-maximization approach. We investigate the impact of ADC/DAC and RF impairments, and show that the proposed optimization allows reduction in ADC/DAC resolution without compromising the SE. [ABSTRACT FROM AUTHOR]

This paper investigates the security problem of a multi-eavesdrop multiple-input-single-output (MISO) wiretap channel, where an N-antenna transmitter communicates with a single-antenna legitimate user in the presence of multiple single-antenna smart eavesdroppers. To overcome the security risk of the traditional secure constructive interference-based (CI-based) scheme when facing the smart eavesdroppers, we propose a novel deception scheme (DS) via a random transmission strategy, where the eavesdroppers are expected to decode the deception symbols correctly but unable to distinguish the authenticity of the decoded symbol. Then, an efficient algorithm is proposed for the deception signal-to interference-plus-noise (SINR)-balancing problem when perfect channel state information (CSI) is assumed. Furthermore, we consider a practical scenario where only imperfect CSI is available, and explore two different methods for the deception optimization problem, i.e., convexification relaxation approach (CRA) and Lagrangian relaxation approach (LRA), respectively. For both CSI cases, a closed-form solution to the considered CI-based deception scheme is obtained. Simulation results validate the superiority of the proposed approach over traditional secure precoding schemes, and also demonstrate the significant computation efficiency improvements for the proposed algorithms. [ABSTRACT FROM AUTHOR]

We consider the problem of communicating over a relay-assisted multiple-input multiple-output (MIMO) channel with additive noise, in which physically separated relays forward quantized information to a central decoder where the transmitted message is to be decoded. We assume that channel state information is available in the transmitter and show that the design of a rational-forcing precoder—a precoder which is matched to the quantizers used in the relays—is beneficial for reducing the symbol error probability. It turns out that for such rational-forcing precoder based systems, there is natural tradeoff between the peak to average power ratio in the transmitter and the rate of communication between the relays and the central decoder. The precoder design problem is formulated mathematically, and several algorithms are developed for realizing this tradeoff. Optimality of the decoder communication rate is shown based on a result in distributed function computation. Numerical and simulation results show that a useful tradeoff can be obtained between the excess decoder communication rate and the peak-average power ratio in the transmitter. [ABSTRACT FROM AUTHOR]

In this paper, a novel reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) symbiotic radio (SR) system is proposed, in which an RIS, operating as a secondary transmitter (STx), sends messages to a multi-antenna secondary receiver (SRx) by using cognitive backscattering communication, and simultaneously, it enhances the primary transmission from a multi-antenna primary transmitter (PTx) to a multi-antenna primary receiver (PRx) by intelligently reconfiguring the wireless environment. We are interested in the joint design of active transmit beamformer at the PTx and passive reflecting beamformer at the STx to minimize the total transmit power at the PTx, subject to the signal-to-noise-ratio (SNR) constraint for the secondary transmission and the rate constraint for the primary transmission. Due to the non-convexity of the formulated problem, we decouple the original problem into a series of subproblems using the alternating optimization method and then iteratively solve them. The convergence performance and computational complexity of the proposed algorithm are analyzed. Furthermore, we develop a low-complexity algorithm to design the reflecting beamformer by solving a backscatter link enhancement problem through the semi-definite relaxation (SDR) technique. Then, theoretical analysis is performed to reveal the insights of the proposed system. Finally, simulation results are presented to validate the effectiveness of the proposed algorithms and the superiority of the proposed system. [ABSTRACT FROM AUTHOR]

Computation over multiple access channel (CoMAC) scheme provides a promising solution to future large-scale wireless networks by utilizing the superposition property of the wireless channel to compute a class of functions with a summation structure (e.g., mean, norm, etc.). However, its implementation usually requires all nodes’ channel state information (CSI) and its performance is limited by the channel condition of the worst node. In order to avoid massive CSI aggregation and improve the limited performance, we propose an automatic repeat request (ARQ)-aided CoMAC scheme in this paper. The transmitters and signaling procedures are designed to achieve the tradeoff between the achievable function rate and the transmission delay. The corresponding performance of the proposed ARQ-aided CoMAC scheme and the traditional ARQ-aided communication scheme are compared for both homogeneous networks and heterogeneous networks. By optimizing the ARQ level, we further maximize the achievable function rate of the proposed scheme. Asymptotic closed-form expressions are derived by resorting to the extreme value theory and point mass approximation. Monte Carlo simulations are given to illustrate and verify the performance of the proposed designs. [ABSTRACT FROM AUTHOR]

We consider two users A and B wanting to exchange their messages MA and MB via a relay in a wireless communication network. To this aim, we have two methods: direct forward (DF) and computation and forward (CAF). In the first method, after an orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA) phase, the receiver decodes the two messages. In the second method, after a NOMA phase, the receiver decodes only the (modulo) sum. In the latter case the capacity region (computation region) is not known. This paper compares the two methods. To such aim, we propose a unified coding framework and identify a lower bound of achievable computation rates. We consider three constellations for the symmetric two-user Gaussian channel with Eisenstein constellation showing highest performance. We also show that a minimum signal-to-noise ratio is required for our CAF method to outperform DF, and we obtain the numerical values of such minimum ratios for the three constellations. Finally, we show achievability of our bounds, which is proved to require affine codes for computation, which has not been proved before. Overall, our results are useful for communication system designers towards practical implementation of multiple access methods in integrated wireless systems. [ABSTRACT FROM AUTHOR]

In the near future, it is envisioned that cellular networks will have to cope with extensive internet of things (IoT) devices. Therefore, a required feature of cellular IoT will be the capability to serve simultaneously a large number of devices with heterogeneous demands and qualities of channel state information at the transmitter (CSIT). In this paper, we focus on an overloaded multiple-input single-output (MISO) broadcast channel (BC) with two groups of CSIT qualities, namely, one group of users (representative of high-end devices) for which the transmitter has partial knowledge of the CSI, the other group of users (representative of IoT devices) for which the transmitter only has knowledge of the statistical CSI (i.e., the distribution information of the user channels). We introduce rate-splitting multiple access (RSMA), a new multiple access based on multi-antenna rate-splitting (RS) technique for cellular IoT. Two strategies are proposed, namely, time partitioning–RSMA (TP–RSMA) and power partitioning–RSMA (PP–RSMA). The former independently serves the two groups of users over orthogonal time slots while the latter jointly serves the two groups of users within the same time slot in a non-orthogonal manner. We first show at high signal-to-noise ratio (SNR) that PP–RSMA achieves the optimal degrees-of-freedom (DoF) in an overloaded MISO BC with heterogeneous CSIT qualities. We then show at finite SNR that PP–RSMA achieves explicit sum rate gain over TP–RSMA and all baseline schemes by marrying the benefits of PP and RSMA. Furthermore, PP–RSMA is robust to CSIT inaccuracy and flexible to cope with quality of service (QoS) rate constraints of all users. The DoF and rate analysis helps us in drawing the conclusion that PP–RSMA is a powerful framework for cellular IoT with a large number of devices. [ABSTRACT FROM AUTHOR]

Covert communication conceals transmission of messages between Alice and Bob from an adversary, Willie, who tries to determine if a transmission took place or not. While covert communication in a basic, standard setting where all variables are known to Willie, results in the well-known square-root law, when a jammer is present and assists Alice by creating uncertainty in Willie’s decoder, a strictly positive transmission rate is possible. In this work, we analyze the case where the jammer is equipped with multiple antennas. Specifically, we analyze the effect of multiple antennas at the jammer on Alice’s transmission power and consequently on the transmission rate. We consider both the case where the channel knowledge of Willie is known as well as the case where it is unknown. We formulate several optimization problems for the transmission strategies of the jammer to maximize his assistance to Alice, in terms of maximizing Bob’s received SNR and consequently the covert rate. When the channel information is known to the jammer, we show that under an achievable covertness scheme, the optimal strategy of the jammer is to perform beamforming towards a single direction with all his available power. This direction though, is not trivial, since it reflects a tradeoff point between minimizing the interference at Bob and maximizing the interference at Willie. When the channel knowledge is unknown, we show that the optimal strategy of the jammer is either to transmit isotropically to all directions or to the null-space of Bob, where this choice depends on certain channel conditions. This is in contrast to current schemes in the literature. Furthermore, we extend the optimization problems to the case where Bob is also equipped with multiple antennas, and provide insightful results, shown to be asymptotically optimal, accompanied by simulations. [ABSTRACT FROM AUTHOR]

This article introduces multiuser multiple-input multiple-output (MU-MIMO) architectures based on non-linear precoding and stream combining techniques using rate-splitting (RS), where the transmitter often has only partial knowledge of the channel state information (CSI). In contrast to existing works, we consider deployments where the receivers may be equipped with multiple antennas. This allows us to employ linear combining techniques based on the Min-Max, the maximum ratio and the minimum mean-square error criteria along with Tomlinson-Harashima precoders (THP) for RS-based MU-MIMO systems to enhance the sum-rate performance. Moreover, we incorporate the Multi-Branch (MB) concept into the RS architecture to further improve the sum-rate performance. Closed-form expressions for the signal-to-interference-plus-noise ratio and the sum-rate at the receiver end are devised through statistical analysis. Simulation results show that the proposed RS-THP schemes achieve better performance than conventional linear and THP precoders. [ABSTRACT FROM AUTHOR]

Channel modeling is a challenging vital step towards the development of diffusion-based molecular communication networks (DMCNs). Analytical approaches for diffusion channel modeling are limited to simple and specific geometries and boundary conditions. Also, simulation- and experiment-driven methods are very time-consuming and computationally complex. In this paper, the channel model for DMCN employing the fundamental concentration Green’s function (CGF) is characterized. A general homogeneous boundary condition framework is considered that includes any linear reaction systems at the boundaries in the environment. To obtain the CGF for a general DMCN including multiple transmitters, receivers, and other objects with arbitrary geometries and boundary conditions, a semi-analytical method (SAM) is proposed. The CGF linear integral equation (CLIE) is analytically derived. By employing the numerical method of moments, the problem of CGF derivation from CLIE is transformed into an inverse matrix problem. Moreover, a sequential SAM is proposed that converts the inversion problem of a large matrix into multiple smaller matrices reducing the computational complexity. Particle-based simulator confirms the results obtained from the proposed SAM. The convergence and run time for the proposed method are examined. Further, the error probability of a simple diffusion-based molecular communication system is analyzed and examined using the proposed method. [ABSTRACT FROM AUTHOR]