Search

In this paper, we present a practical method to construct dirty paper coding (DPC) schemes using sum codes. Unlike the commonly used approach to DPC where the coding scheme involves concatenation of a channel code and a quantization code, the proposed method embodies a unified approach that emulates the binning method used in the proof of the DPC result. Auxiliary bits are used to create the desired number of code vectors in each bin. Sum codes are obtained when information sequences augmented with auxiliary bits are encoded using linear block codes. Sum-code-based DPC schemes can be implemented using any linear block code, and entail a relatively small increase in decoder complexity when compared to standard communication schemes. They can also lead to significant reduction in transmit power in comparison to standard schemes. [ABSTRACT FROM AUTHOR]

This paper investigates different precoding strategies for rate splitting multiple access (RSMA) in the downlink of multi-cell visible light communication (VLC) networks. Since classical Shannon capacity formula does not hold for VLC, we first provide a lower bound on the channel capacity for RSMA in such interfering networks. Then, we formulate a spectral efficiency maximization problem to jointly find the optimal rate-splitting and transmit precoding. Beside that, since cell-edge users suffer from additional inter-cell interference, we propose to design the precoders of different RSMA signals utilizing coordinated beamforming (CB). Subsequently, aiming to improve the performance of the CB design for RSMA, while maintain a reduced complexity, we introduce two enhanced precoding strategies for RSMA. To the best of the authors’ knowledge such a contribution has not been considered before in the open literature. It is shown in the paper that the formulated optimization problem is non-convex and a sub-optimal, yet, a low complexity solution can be obtained efficiently using semi-definite relaxation combined with successive convex approximation. Through analytical results, we illustrate the flexibility and superiority of the proposed precoding strategies for RSMA over conventional coordinated space division multiple access and non-orthogonal multiple access for different scenarios and network loads. [ABSTRACT FROM AUTHOR]

This paper studies the capacity of the two-user intensity-modulation/direct-detection (IM/DD) interference channel (IC), which is relevant in the context of multi-user optical wireless communications. Despite some known single-letter capacity characterizations for general discrete-memoryless ICs, a computable capacity expression for the IM/DD IC is missing. In this paper, we provide tight and easily computable inner and outer bounds for a general two-user IM/DD IC under peak and average optical intensity constraints. The bounds enable characterizing the asymptotic sum-rate capacity in the strong and weak interference regimes, as well as the generalized degrees of freedom (GDoF) in the symmetric case. Using the obtained bounds, the GDoF of the IM/DD IC is shown to have a ‘W’ shape similar to the Gaussian IC with power constraints. The obtained bounds are also evaluated numerically in different interference regimes to show their tightness, and used to study the performance of on-chip and indoor OWC systems. [ABSTRACT FROM AUTHOR]

This paper considers the uplink performance of a multi-user massive multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) system with mobile users. Mobility brings two major problems to a MIMO-OFDM system: inter carrier interference (ICI) and channel aging. In practice, it is common to allot multiple contiguous subcarriers to a user as well as schedule multiple users on each subcarrier. Motivated by this, we consider a general subcarrier allocation scheme and derive expressions for the ICI power, uplink signal to interference plus noise ratio and the achievable uplink sum-rate, taking into account the ICI and the multi-user interference due to channel aging. We show that the system incurs a near-constant ICI power that depends linearly on the ratio of the number of users per subcarrier to the number of subcarriers per user, nearly independently of how the UEs distribute their power across the subcarriers. Further, we exploit the coherence bandwidth of the channel to reduce the length of the pilot sequences required for uplink channel estimation. We consider both zero-forcing and maximal-ratio combining at the receiver and compare the respective sum-rate performances. In either case, the subcarrier allocation scheme considered in this paper leads to significantly higher sum-rates compared to previous work, owing to the near-constant ICI property as well as the reduced pilot overhead. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of joint beam selection and link activation across a set of communication pairs to effectively control the interference between communication pairs via inactivating part communication pairs in ultra-dense device-to-device (D2D) mmWave communication networks. The resulting optimization problem is formulated as an integer programming problem that is nonconvex and NP-hard. Consequently, the global optimal solution, even the local optimal solution, cannot be generally obtained. To overcome this challenge, this paper resorts to design a deep learning architecture based on graph neural network to finish the joint beam selection and link activation, with taking the network topology information into account. Meanwhile, we present an unsupervised Lagrangian dual learning framework to train the parameters of the GBLinks model. Numerical results show that the proposed GBLinks model can converge to a stable point with the number of iterations increases, in terms of the weighted sum rate. Furthermore, the GBLinks model can reach near-optimal solutions through comparing with the exhaustive scheme in small-scale ultra-dense D2D mmWave communication networks and outperforms GreedyNoSched and the SCA-based method. It also shows that the GBLinks model can generalize to varying network densities and network coverage regions of ultra-dense D2D mmWave communication networks. [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]

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]

Indoor optical wireless communication (IOWC) is a key technology complementing radio communication in 6G. Typically, the downlink of IOWC is implemented using visible light and uplink is implemented using infrared. Though the downlink of IOWC has been studied well, the uplink of multiple-access IOWC requires further research. In this paper, power allocation strategies in the uplink of IOWC with multiple non-cooperative users is studied. Optimizing power allocation in IOWC that maximize sum-rate with power constraints becomes a non-convex problem. First, this paper proposes an alternating maximization algorithm to compute near optimal power allocation policies for small number of users. Next, a phenomenon of invariance is observed when the number of users in the system is large. Under invariance, the optimal power allocation policy of a user becomes independent of other users, thereby facilitating fast and decentralized computation of power allocation strategies. From simulations, it was observed that the invariance can occur even with five to ten users. For the first time, a rigorous analysis of the invariance phenomenon is provided. An algorithm to compute the optimal power allocation at invariance is proposed; this algorithm is proven to achieve the global maxima in sum-rate without the channel knowledge of other users. [ABSTRACT FROM AUTHOR]

This paper proposes a novel scalable reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. In most previous works on reinforcement learning for network optimization, the network topology is assumed to be fixed, and a different agent is trained for each transmission node—this limits scalability and generalizability. Further, routing and spectrum access are typically treated as separate tasks. Moreover, the optimization objective is usually a cumulative metric along the route, e.g., number of hops or delay. In this paper, we account for the physical-layer signal-to-interference-plus-noise ratio (SINR) in a wireless network and further show that bottleneck objective such as the minimum SINR along the route can also be optimized effectively using reinforcement learning. Specifically, we propose a scalable approach in which a single agent is associated with each flow and makes routing and spectrum access decisions as it moves along the frontier nodes. The agent is trained according to the physical-layer characteristics of the environment using a novel rewarding scheme based on the Monte Carlo estimation of the future bottleneck SINR. It learns to avoid interference by intelligently making joint routing and spectrum allocation decisions based on the geographical location information of the neighbouring nodes. [ABSTRACT FROM AUTHOR]

The cell-free massive multiple-input multiple-output (CFmMIMO) aims to provide uniform quality of service (QoS) for all users, and can be used in small-area scenarios such as indoor industrial networks. This paper studies the CFmMIMO system for indoor industrial scenarios. Firstly, an access point (AP) grouping based hierarchical network topology is proposed. Based on this, we propose an effective AP selection method. To reduce pilot contamination, a pilot assignment scheme based on inspection robot (IR) location is proposed. Considering the high reliability requirement of industrial data transmission, the power control and backhaul combining are jointly optimized to maximize the minimum signal to interference plus noise ratio (SINR). The scalability of the proposed CFmMIMO system is analyzed, and a scalable power control method is proposed. The simulations demonstrate the effectiveness of the AP selection method, pilot assignment scheme, and the joint optimization algorithm for power control and backhaul combining. Moreover, the impact of network scale and network load on system performance is evaluated and analyzed in the simulations. [ABSTRACT FROM AUTHOR]

With the full development of intelligent mobile communications, wireless mixed reality (MR) provides a more visually immersive experience and stronger interaction with environments than virtual reality (VR) and augmented reality (AR). However, the asymmetric characteristic of wireless MR traffic creates a huge challenge to current mobile networks. Dynamic time division duplex (D-TDD) is considered as a promising technology to improve wireless MR users’ quality of experience (QoE) due to its potentials and advantages in delivering asymmetric traffic. Therefore, in this paper, we propose a QoE-driven distributed multidimensional resource allocation (MRA) supplemented by inter-cell interference (ICI) mitigation scheme for wireless MR in multi-cell D-TDD systems. First, to improve QoE of MR users, we formulate the joint optimization of subframe configuration, channel assignment and computation offloading as a mixed-integer nonlinear programming problem. A novel fully-decentralized multi-agent deep Q-network (DQN) algorithm is developed to solve the problem. Then, to mitigate ICI, a water filling based power control algorithm is investigated to minimize the total power of each small base station and its associated MR users. Simulation results demonstrate that our proposed scheme improves QoE of MR users in a realizable way as compared to existing schemes. [ABSTRACT FROM AUTHOR]

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per antenna power constraints and interference power constraint. An analytical solution to this problem is not known and existing numerical solutions suffer from slow convergence rate and/or high per-iteration complexity. Deriving computationally efficient solutions to the secrecy capacity problem is challenging since the secrecy rate is expressed as a difference of convex functions (DC) of the transmit covariance matrix, for which its convexity is only known for some special cases. In this paper we propose two low-complexity methods to compute the secrecy capacity along with a convex reformulation for degraded channels. In the first method we capitalize on the accelerated DC algorithm which requires solving a sequence of convex subproblems, for which we propose an efficient iterative algorithm where each iteration admits a closed-form solution. In the second method, we rely on the concave-convex equivalent reformulation of the secrecy capacity problem which allows us to derive the so-called partial best response algorithm to obtain an optimal solution. Notably, each iteration of the second method can also be done in closed form. The simulation results demonstrate a faster convergence rate of our methods compared to other known solutions. We carry out extensive numerical experiments to evaluate the impact of various parameters on the achieved secrecy capacity. [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]

This paper presents a part of our ground-breaking work on evaluation of buildings in terms of wireless friendliness at the building-design stage. The main goal is to devise building design practices that provide for a good performance of wireless networks deployed in buildings. In this paper, the interference gain (IG) and power gain (PG) are defined as two figures of merit (FoM) of the wireless performance of buildings. The FoMs bridge the gap between building design and wireless communications industries. An approach to derive exact closed-form equations for these FoMs is proposed for the first time. The derived analytic expressions facilitate straightforward and more computationally efficient numerical evaluation of the proposed FoMs as compared to Monte Carlo simulations for well-known indoor propagation models. It is shown that the derived closed-form expression can be readily employed to evaluate the impact of building properties, such as the sizes and the aspect ratios (ARs) of rooms, on the wireless performance. The proposed approach sheds light to architects on evaluation and design of wireless-friendly building layouts. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RISs) have emerged as a promising technology for millimeter wave (mmWave) networks. In this paper, we utilize tools from stochastic geometry to study the performance of a RIS-assisted mmWave cellular network. Specifically, the locations of the base stations (BSs) and the midpoints of the blockage are modeled as two independent Poisson point processes (PPPs), where the blockages are modeled by a Boolean model and a fraction of the blockages are coated with RISs. The particular characteristics of mmWave communications, i.e., directional beamforming and different path loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS) propagation, are incorporated into our analysis. We derive analytical expressions for the success probability and the area spectral efficiency. The success probability under the special case where the blockage parameter is sufficiently small is also derived. Numerical results demonstrate that better coverage performance and higher energy efficiency can be achieved by a large-scale deployment of RISs. In addition, the tradeoff between the BS and RIS densities is investigated and the results show that the RISs can indeed enable the traditional networks to improve the success probability, especially for the cell-edge region, with limited power consumption. [ABSTRACT FROM AUTHOR]

Reactive jammers, which start attacking upon sensing legitimate transmissions, are serious threats to wireless communications. Conventional anti-jamming methods such as frequency hopping-based anti-jamming schemes are not effective against reactive jammers, especially the agile ones that jam immediately after sensing transmissions. Deceiving-based anti-jamming methods have a great potential in harnessing reactive jammers and securing communication channels for legitimate users. However, in deceiving-based anti-jamming methods, reaching the optimal power and channel allocation is complicated due to the unavailability of the jammers’ channel information. In this paper, we propose deceiving-based anti-jamming schemes against reactive jammers employing reinforcement learning. Moreover, we consider both cases where a reactive jammer can jam a channel or all the channels utilized by legitimate users. In the latter case, we model the interaction between users and the jammer as a non-cooperative Stackelberg game and prove equilibrium. In addition, we study different scenarios where the interacting environment is static or dynamic in terms of channel gains. Simulation results show that in static environments, the proposed methods achieve the optimal values of the total received power and Signal-to-interference-plus-noise ratio with an accuracy of 95%. Moreover, in dynamic environments, the proposed methods provide high performance in terms of the considered evaluation metrics. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the resource allocation of mobile edge computing (MEC) in cognitive capacity harvesting networks (CCHNs) when non-orthogonal multiple-access (NOMA) technique is adopted. Different from traditional studies for NOMA-MEC networks, we aim at minimizing the total cost of CCHN while satisfying the quality-of-service (QoS) of secondary users (SUs). We adopt the mechanism of time division multiple access (TDMA) when several NOMA groups use the same spectrum, and consider both the waiting delay and transmission delay during data offloading with the optimization of transmission order of NOMA groups. We formulate the considered problem as a mixed integer non-linear programming (MINLP). We show that the transmit power and the allocated computing resource for each SU can be derived when the transmission time and transmission order of the NOMA groups are given. Based on this, the considered problem can be decomposed into a transmission time and order optimization subproblem, a cellular resource block (CRB) selection subproblem and a cognitive radio (CR) router selection subproblem. To solve the transmission time and order optimization subproblem, we first simplify the delay constraint via theoretic analysis, and then propose a binary segmentation (B-Seg) algorithm and a transmission order adjustment (TOA) algorithm to find the optimal transmission time and transmission order of NOMA groups, respectively. To solve the CRB selection subproblem and the CR router selection subproblem, a bigger requirement first (BRF) algorithm and a game-based iteration (GBI) algorithm are respectively proposed. Simulation results show that the proposed algorithms can significantly improve the system performance. [ABSTRACT FROM AUTHOR]

In this paper, the role of feedback in two-way full-duplex Gaussian channel (TW-FD-GC) is revisited. First, we propose a practical coding scheme for the TW-FD-GC, which is based on the noisy type of the well-known Schalkwijk-Kailath (SK) feedback scheme. We show that though this scheme cannot achieve the capacity of the TW-FD-GC, the codeword length that achieves desired decoding error probability is extremely short. Then, we further prove that the proposed scheme is secure by itself, i.e., the achievable rate region of the proposed scheme is also an achievable secrecy rate region of the two-way full-duplex Gaussian wiretap channel (TW-FD-GWTC). In addition, for the TW-FD-GWTC, numerical result shows that the secrecy sum rate of our proposed scheme can be as large as those achieved by existing schemes in the literature for some cases. Next, we extend the proposed scheme to the TW-FD-GC with Gaussian state interference non-causally known by the corresponding transmitter. We show that the interference can be perfectly canceled by this extended scheme. Finally, we prove that this extended scheme is also secure by itself, and numerical result shows that this extended scheme may perform better than the existing ones in the literature. [ABSTRACT FROM AUTHOR]

Satellite-aerial communication (SAC) is the most necessary and reliable way to bridge the aerial terminals with their remote command and control center when terrestrial relay infrastructure is unavailable. However, as an inescapable obstacle, adjacent space interference from neighboring satellites unavoidably leads to the loss of the performance of SACs. To uncover the impacts of space interference, in this paper, a SAC system including a satellite (S), an aerial platform (D), and a space interference (I) is considered. Specifically, S operates in a circular orbit and I, which is randomly distributed in the neighboring space around S, produces a jamming signal to interfere with the information delivery between S and D. Considering the randomness of S and I and employing geometric probability theory, an approximate and asymptotic outage probabilities of the considered SAC system are studied. Moreover, the multi-interference scenario is investigated accordingly. Finally, numerical results are presented to validate our proposed analysis and some insightful conclusions are achieved to reveal the effects of spatially random space interference on SAC. [ABSTRACT FROM AUTHOR]

Symbol-level precoding (SLP), which converts the harmful multi-user interference (MUI) into beneficial signals, can significantly improve symbol-error-rate (SER) performance in multi-user communication systems. While enjoying symbolic gain, however, the complicated non-linear symbol-by-symbol precoder design suffers high computational complexity exponential with the number of users, which is unaffordable in realistic systems. In this paper, we propose a novel low-complexity grouped SLP (G-SLP) approach and develop efficient design algorithms for typical max-min fairness and power minimization problems. In particular, after dividing all users into several groups, the precoders for each group are separately designed on a symbol-by-symbol basis by only utilizing the symbol information of the users in that group, in which the intra-group MUI is exploited using the concept of constructive interference (CI) and the inter-group MUI is also effectively suppressed. In order to further reduce the computational complexity, we utilize the Lagrangian dual, Karush-Kuhn-Tucker (KKT) conditions and the majorization-minimization (MM) method to transform the resulting problems into more tractable forms, and develop efficient algorithms for obtaining closed-form solutions to them. Extensive simulation results illustrate that the proposed G-SLP strategy and design algorithms dramatically reduce the computational complexity without causing significant performance loss compared with the traditional SLP schemes. [ABSTRACT FROM AUTHOR]

In mmWave networks, a large or nearby object can obstruct multiple communication links, which results in spatial correlation in the blocking probability between a user and two or more base stations (BSs). This paper characterizes this blocking correlation and derives its impact on the signal-to-interference-plus-noise ratio (SINR) of a mmWave cellular network. We first present an exact analysis of a 1D network and highlight the impact of blocking correlation in the derived expressions. Gaining insights from the 1D analysis, we develop an analytical framework for a 2D network where we characterize the sum interference at the user by considering the correlation between the blocking of serving and interfering links. Using this, we derive the SINR coverage probability. Via simulations, we demonstrate that including blockage correlation in the analysis is required for accurate characterization of the system performance, in particular when the blocking objects tend to be large. [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]

In this paper, we consider an intelligent reflecting surface (IRS)-assisted cognitive radio system and maximize the secondary user (SU) rate by jointly optimizing the transmit power of secondary transmitter (ST) and the IRS’s reflect beamforming, subject to the constraints of the minimum required signal-to-interference-plus-noise ratio at the primary receiver, the ST’s maximum transmit power, and the unit modulus of the IRS reflect beamforming vector. This joint optimization problem can be solved suboptimally by the non-convex optimization techniques, which however usually require complicated mathematical transformations and are computationally intensive. To address this challenge, we propose an algorithm based on the deep deterministic policy gradient (DDPG) method. To achieve a higher learning efficiency and a lower reward variance, we propose another algorithm based on the soft actor-critic (SAC) method. In these proposed algorithms, a reward impact adjustment approach is proposed to improve their learning efficiency and stability. Simulation results show that the two proposed algorithms can achieve comparable SU rate performance with much shorter running time, as compared to the existing non-convex optimization-based benchmark algorithm, and that the proposed SAC-based algorithm learns faster and achieves a higher average reward with lower variance, as compared to the proposed DDPG-based algorithm. [ABSTRACT FROM AUTHOR]

The fifth-generation (5G) and beyond standards are being challenged by the diverse requirements of modern use cases. Multicarrier modulation techniques are one of the key components of the physical layer (PHY) design, which has immense potential to improve efficiency and reliability. In current state-of-the-art wireless technologies (i.e., NR and IEEE 802.11ax) orthogonal frequency division multiplexing (OFDM) is used which has many disadvantages such as peak-to-average power ratio (PAPR), out-of-band emission (OOBE), and sensitivity to carrier frequency offset (CFO). To overcome these drawbacks several alternate multicarrier modulation techniques are being considered, such as discrete Fourier transform-spread-OFDM (DFT-s-OFDM), generalized frequency division multiplexing (GFDM), and orthogonal time-frequency space (OTFS). In this paper, we develop the physical layer abstraction (PLA) of these candidate multicarrier techniques to evaluate their performance under various use cases and scenarios. The PLA is a commonly used technique to avoid time-consuming PHY simulations in system-level simulators. To improve the accuracy of PLA in different fading conditions, we derive a fitting parameter as a function of the received signal-to-interference-plus-noise ratio (SINR) variance. The validation results show that performance can be accurately estimated through the proposed multicarrier PLA. Moreover, PLA techniques are at least thousands of times faster compared to PHY simulations. [ABSTRACT FROM AUTHOR]

Caching popular contents at edge networks (such as small-cell base stations) has been proposed to deal with the ever-growing mobile traffic. At the meantime, recommendation system is able to shape user demands for further prompting caching gain. In this paper, we study a multi-antenna multi-cell edge network employing transmit beamforming with caching-aware recommendation and user association. We first establish a framework for the joint problem of beamforming, user association, content caching and recommendation to minimize the content transmission delay of mobile users, by specifying a set of necessary conditions for all four component functions of the network. The resulting optimization problem corresponds to a non-convex, multi-timescale, and mixed-integer programming problem, which is hard to handle. To deal with the difficulty in solving the joint optimization problem by the direct formulation, we equivalently decompose it into three sub-problems. Then, we develop a computationally-efficient iterative algorithm to obtain the sub-optimal solution, where the three subproblems are tackled iteratively. Simulation results are conducted to demonstrate that the proposed algorithm can obtain lower transmission delay than baseline schemes. [ABSTRACT FROM AUTHOR]

This paper investigates the first resource management problem for vehicular-to-infrastructure (V2I) networks under the in-band full-duplex (IBFD) backhauling scheme with guaranteed ultra-reliable and low-latency (URLLC) service. The considered networks suffers from interference caused by three node transmission in IBFD scheme and the mobility of vehicular user equipments (VUEs). The resource allocation problem is formulated to jointly optimize VUE association, resource block assignment (RA) and power allocation (PA), while satisfying the reliability and latency constraints at the same time. The formulated problem is a mixed integer non-linear problem with non-convex objective function and constraints. Finding globally optimal solution for this type of problem is still an open problem. To develop tractable solutions, the original problem is firstly simplified using derived equivalent expression for the objective function. The proposed method then decomposed it into RA and PA sub-problems. In each iteration, the PA sub-problem is solved for a set of given PA solution; while the solution for PA sub-problem is searched under determined RA results. The RA and PA sub-problems are solved iteratively until the converging condition is achieved. Theoretical analysis proves that the proposed method achieves Nash-stable equilibrium and local optimality for RA and PA sub-problems respectively. Simulation results verify the effectiveness of the derived performance analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art algorithms in the literatures. [ABSTRACT FROM AUTHOR]

Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen significantly speeds up communication efficiency by transmitting multicast messages simultaneously useful to multiple users. Most prior works on coded caching are based on the assumption that each user may request all content in the library. However, in many applications the users are interested only in a limited set of content that depends on their location. For example, assisted self-driving vehicles may access super High-Definition maps of the area through which they are travelling. Motivated by these considerations, this paper formulates the coded caching problem for location-based content with edge cache nodes. The considered problem includes a content server with access to ${\mathsf N}$ location-based files (e.g., High-Definition maps), ${\mathsf K}$ edge cache nodes located at different regions, and ${\mathsf K}$ users (i.e., vehicles) each of which is in the serving region of one cache node and can retrieve the cached content of this cache node with negligible cost. Depending on the location, each user only requests a file from a location-dependent subset of the library. The objective is to minimize the worst-case load (i.e., the worst-case number of broadcasted bits from the content server among all possible demands). For this novel coded caching problem, we propose a highly non-trivial converse bound under uncoded cache placement (i.e., each cache node directly copies some library bits in its cache), which shows that a simple achievable scheme is optimal under uncoded cache placement. In addition, this achievable scheme is also proved to be generally order optimal within a factor of 3. Finally, we extend the coded caching problem for location-based content to the multiaccess coded caching topology originally proposed by Hachem et al., where each user is connected to ${\mathsf L}$ nearest cache nodes. When ${\mathsf L}\geq 2$ , we characterize the exact optimality on the worst-case load. [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]

In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$ -user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider both active and passive IRSs. While both types of IRS can attenuate the amplitude and change the phase of a reflected electromagnetic wave, active IRSs are also capable of amplifying the wave. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of an active IRS and prove that the maximum value of $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. The analysis framework developed for active IRSs forms the basis for our analysis of passive IRS-assisted systems. In particular, we present probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large. [ABSTRACT FROM AUTHOR]

This paper considers the finite-order filter design problem for the source and multiple full-duplex (FD) relays in a cooperative communication system under frequency-selective fading channels. The goal is to optimize the source and relay filters such that the end-to-end signal-to-interference-plus-noise ratio (SINR) of minimum mean-squared error decision-feedback equalizer (MMSE-DFE) can be maximized. The resultant design problem is very difficult since we need to deal with self interference (SI), inter-relay interference (IRI), and inter-symbol interference (ISI) at the same time. Novel designs are then proposed to overcome the difficulty in this work. Transforming the signals into the frequency domain and using some optimization techniques, we first theoretically derive the power spectrum of the source filter and the spectrums of the relay filters. Then, the finite-order design is developed to approach the derived spectrums. Based on the weighted least-square (WLS) criterion, the Steiglitz-McBride method is exploited to obtain the filter coefficients in finite lengths. Numerical results demonstrated that complete removal of SI may not be a good strategy; preserving a certain amount of SI at each relay instead provides better SINR performance. [ABSTRACT FROM AUTHOR]

The increasing demand for access to data has led to dramatic increases in data storage densities, and as densities increase, new sources of error appear. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. A recent innovation improves the performance of MD spatially-coupled codes that are based on circulants by carefully relocating some circulants to minimize the number of short cycles. However, cycles become more detrimental when they combine together to form more advanced objects, e.g., absorbing sets, including low-weight codewords. In this paper, we show how MD relocations can be exploited to minimize the number of detrimental objects in the graph of an MD code. Moreover, we demonstrate the savings in the number of relocation arrangements earned by focusing on objects rather than their constituent cycles. Our technique is applicable to a wide variety of one-dimensional (OD) codes. Simulation results demonstrate significant lifetime gains achieved by the proposed MD codes on an industry-recommended model for Flash systems, and signal-to-noise ratio gains on an industry-recommended model for magnetic recording systems, both with respect to OD codes with similar parameters. The second order analysis of MD relocations relies on conditions and options for an object, called a pattern, to form a bigger cycle after MD relocations, which are discussed in this paper. [ABSTRACT FROM AUTHOR]

This paper analyzes the integration of Non-Orthogonal Multiple Access (NOMA) in a Fog Radio Access Network (FRAN) architecture with limited fronthaul capacity. More precisely, it proposes methods for optimizing the resource allocation for the downlink of a NOMA-based FRAN with multiple resource blocks (RB). The resource allocation problem is formulated as a mixed-integer optimization problem, which determines the user-to-RB assignment, the power allocated to each RB, and the power split levels of the NOMA users served by each RB. The optimization problem maximizes a network-wide rate-based utility function subject to fronthaul-capacity constraints. The paper proposes a feasible decoupled solution for such a non-convex optimization problem using a three-step hybrid centralized/distributed approach, which in part relies on the edge-devices computation capabilities. The paper proposes and compares two distinct methods for solving the assignment problem, namely a Hungarian-based method, and a Multiple Choice Knapsack-based method. The power allocation to RBs and the NOMA power split optimization are solved using the alternating direction method of multipliers (ADMM). Simulations results illustrate the advantages of the proposed methods compared to different baseline schemes, including the conventional Orthogonal Multiple Access (OMA), for different utility functions and different network environments. [ABSTRACT FROM AUTHOR]

Despite the great promises that the resistive random access memory (ReRAM) has shown as the next generation of non-volatile memory technology, its crossbar array structure leads to a severe sneak path interference to the signal read back from the memory cell. In this paper, we first propose a novel belief propagation (BP) based detector for the sneak path interference in ReRAM. Based on the conditions for a sneak path to occur and the dependence of the states of the memory cells that are involved in the sneak path, a Tanner graph for the ReRAM channel is constructed, inside which specific messages are updated iteratively to get a better estimation of the sneak path affected cells. We further combine the graph of the designed BP detector with that of the BP decoder of the polar codes to form a joint detector and decoder. Tailored for the joint detector and decoder over the ReRAM channel, effective polar codes are constructed using the genetic algorithm. Simulation results show that the BP detector can effectively detect the cells affected by the sneak path, and the proposed polar codes and the joint detector and decoder can significantly improve the error rate performance of ReRAM. [ABSTRACT FROM AUTHOR]

In the present paper a closed-form framework is derived for the analysis and optimization of the coverage probability (Pcov) and of the area spectral efficiency (ASE) in long-range (LoRa) networks. The proposed framework exploits stochastic geometry tools to associate the Pcov and the ASE to the end device (ED) transmit power and to the ED density. The analysis reveals the trends of the Pcov and of the ASE curves, with respect to both of the two parameters, while the robustness of the framework holds even at the asymptotic cases. Building upon the derived framework, the analysis demonstrates that no joint global optimum exists that jointly maximizes the Pcov over both parameters, suggesting that the optimization of the Pcov must be performed separately, for the two key network parameters considered. As opposed to that, the analysis demonstrates that a set of global optima exists that jointly maximize the ASE over both parameters, and these global maxima are subsequently derived in closed form. Thus, the derived framework fully characterizes the performance of LoRa networks, while defining in closed form the optimal points of operation that can be proven of significant value, for the transceiver and network design, of practical LoRa networks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new framework for covert communication in hybrid active/passive networks, which explores the inherent uncertainty of the backscatter transmissions to achieve active and passive communication reciprocity in security. Under this framework, we first model the aggregate interference from the sporadic backscatter transmissions and derive the covert outage probability and the transmission success probability to capture the covertness and reliability. Then, we formulate a transmit power optimization problem to maximize the covert throughput subject to certain covertness and reliability requirements and derive a closed-form approximation of the maximum covert throughput. Particularly, we investigate the worst-case scenario of covert communication in which warden always uses the optimal detection thresholds. Finally, numerical results demonstrate that covert communication with the help of uninformed backscatters that are not coordinated with Alice in the hybrid network is feasible. Results also provide design guidelines for the optimal choice of interference parameters, which is capable of striking a balance between covertness and reliability. [ABSTRACT FROM AUTHOR]

This paper considers a reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) downlink communication system where hybrid analog-digital beamforming is employed at the base station (BS). We formulate a power minimization problem by jointly optimizing hybrid beamforming at the BS and the response matrix at the RIS, under the signal-to-interference-plus-noise ratio (SINR) constraints at all users. The problem is highly challenging to solve due to the non-convex SINR constraints as well as the unit-modulus phase shift constraints for both the RIS reflection coefficients and the analog beamformer. A two-layer penalty-based algorithm is proposed to decouple variables in SINR constraints, and manifold optimization is adopted to handle the non-convex unit-modulus constraints. We also propose a low-complexity sequential optimization method, which optimizes the RIS reflection coefficients, the analog beamformer, and the digital beamformer sequentially without iteration. Furthermore, the relationship between the power minimization problem and the max-min fairness (MMF) problem is discussed. Simulation results show that the proposed penalty-based algorithm outperforms the state-of-the-art semidefinite relaxation (SDR)-based algorithm. Results also demonstrate that the RIS plays an important role in the power reduction. [ABSTRACT FROM AUTHOR]

Providing truly ubiquitous connectivity requires development of low Earth orbit (LEO) satellite Internet, whose theoretical study is lagging behind network-specific simulations. In this paper, we derive analytical expressions for the downlink coverage probability and average data rate of a massive inclined LEO constellation in terms of total interference power’s Laplace transform in the presence of fading and shadowing, ergo presenting a stochastic geometry-based analysis. We assume the desired link to experience Nakagami- $m$ fading, which serves to represent different fading scenarios by varying integer $m$ , while the interfering channels can follow any fading model without an effect on analytical tractability. To take into account the inherent non-uniform distribution of satellites across different latitudes, we model the LEO network as a nonhomogeneous Poisson point process with its intensity being a function of satellites’ actual distribution in terms of constellation size, the altitude of the constellation, and the inclination of orbital planes. From the numerical results, we observe optimum points for both the constellation altitude and the number of orthogonal frequency channels; interestingly, the optimum user’s latitude is greater than the inclination angle due to the presence of fewer interfering satellites. Overall, the presented study facilitates general stochastic evaluation and planning of satellite Internet constellations without specific orbital simulations or tracking data on satellites’ exact positions in space. [ABSTRACT FROM AUTHOR]

In frequency division duplex (FDD) massive multi-input multi-output (MIMO), the two-stage beamforming (TSB) using channel covariance matrices significantly reduces the downlink training length (DTL) and channel feedback. Nevertheless, most of the TSB methods focus on the one-ring channel. In this paper, we consider the multiple scatterer clusters (MSC) channel in massive MIMO systems and propose a TSB method based on cluster group. To reduce the channel state information (CSI) feedback, for each cluster we use a cluster-group-based eigen-prebeamformer to sparsify the effective channel matrix. The DTL is also reduced by a graph-based downlink training design. We further develop a multi-user beamformer to mitigate the inter-user interference. To further reduce the DTL, two other methods are also proposed based on the vertex and edge deletion. Simulation results confirm the efficiency of the proposed schemes in improving the effective spectral efficiency. [ABSTRACT FROM AUTHOR]

The energy efficiency (EE) of femtocells is always limited by the surrounding radio environments in heterogeneous networks (HetNets), such as walls and obstacles. In this paper, we propose to deploy reconfigurable intelligent surfaces (RISs) to improve the EE of femtocells. However, perfect channel state information is more difficult to obtain due to the passive characteristics of RISs and non-cooperative relationship between different tiers. Besides, the low-cost transceivers and reflecting units suffer nontrivial hardware impairments (HWIs) due to the hardware limitations of practical systems. To this end, we investigate a realistic robust beamforming design based on max-min fairness for an RIS-aided HetNet under channel uncertainties and residual HWIs. The joint optimization of transmit beamforming vectors of femto base stations (FBSs) and the phase-shift matrices of RISs is formulated as a non-convex problem to maximize the minimum EE of the femtocell subject to the constraints of the maximum transmit power of FBSs, the quality of service of users, and unit modulus phase-shift constraints of RISs. We develop an iterative block coordinate descent-based algorithm which exploits the semi-definite relaxation, the S-procedure, and the singular value decomposition method. Simulation results reveal that the proposed algorithm outperforms existing algorithms in terms of fairness, EE, and outage probability. [ABSTRACT FROM AUTHOR]

Resistive random-access memory is one of the most promising candidates for the next generation of non-volatile memory technology. However, its crossbar array structure causes severe “sneak-path” interference, which also leads to strong inter-cell correlation. Recent works have mainly focused on sub-optimal data detection schemes by ignoring inter-cell correlation and assuming sneak-path interference is independent between different array cells. In this paper, we propose a near-optimal data detection scheme that can approach the performance bound of the optimal detection scheme. Our detection scheme leverages a joint data and sneak-path interference recovery and can use all inter-cell correlations. The proposed scheme is suitable for data detection of large memory arrays with only linear operation complexity. [ABSTRACT FROM AUTHOR]

Joint communication and radar sensing (JCAS) integrates the two functions into one system, sharing one transmitted signal. In this paper, we investigate JCAS waveform optimization in communication-centric systems, where a base station (BS) detects radar targets and communicates with mobile users simultaneously. Different from existing works, we study multi-metric optimizations for a practical low-cost system and establish their connections. To relax the requirement of full-duplex technology, we add a single receive antenna for sensing at the BS, which is synchronized with and spatially separated from the JCAS transmit array. We first optimize precoders for communications and radar, individually. Then, we formulate a JCAS waveform optimization problem that constrains either mutual information (MI) or Cramér-Rao bound (CRB) of radar and maximizes the relaxed signal-to-interference-plus-noise rate (SINR) of communications. Exploiting the geometric characteristic of the relaxed SINR, we provide a closed-form solution under certain conditions and propose a numerical iteration algorithm that works in all situations. We also disclose the connections between optimizations with constraining MI and CRB, using numerical results. Finally, simulation results are provided and validate the proposed optimization solutions. [ABSTRACT FROM AUTHOR]

Using tools from stochastic geometry, this paper develops a tractable framework to analyze the performance of a mobile user in a two-tier wireless network operating on sub-6GHz and terahertz (THz) transmission frequencies. Specifically, using an equivalence distance approach, we characterize the overall handoff (HO) probability in terms of the horizontal and vertical HO and mobility-aware coverage probability. In addition, we characterize novel coverage probability expressions for THz network in the presence of molecular absorption noise and highlight its significant impact on the users’ performance. Specifically, we derive a novel closed-form expression for the Laplace Transform of the cumulative molecular noise and interference observed by a mobile user in a hybrid RF-THz network. Furthermore, we provide a novel approximation to derive the conditional distance distributions of a typical user in a hybrid RF-THz network. Finally, using the overall HO probability and coverage probability expressions, the mobility-aware probability of coverage has been derived in a hybrid RF-THz network. Our mathematical results validate the correctness of the derived expressions using Monte-Carlo simulations. The results offer insights into the adverse impact of users’ mobility and molecular noise in THz transmissions on the probability of coverage of mobile users. Our results demonstrate that a small increase in the intensity of terahertz base-stations (TBSs) (about 5 times) can increase the HO probability much more compared to the case when the intensity of RF BSs (RBSs) is increased by 100 times. Furthermore, we note that high molecular absorption can be beneficial (in terms of minimizing interference and molecular noise) for specific deployment intensity of TBSs and the benefits can outweigh the drawbacks of signal degradation due to molecular absorption. [ABSTRACT FROM AUTHOR]

In this paper, uplink transmission of a cell-free massive multiple-input multiple-output (CF-mMIMO) system coexisting with device-to-device (D2D) communication links is investigated, under the assumption that access points (APs) are equipped with low resolution analog-to-digital converters (ADCs). Lower bounds of achievable rates for both D2D users (DUEs) and CF-mMIMO users (CFUEs) are derived in closed-form, with perfect and imperfect channel state information. Next, in order to reduce pilot contamination, greedy and graph coloring-based pilot allocation algorithms are proposed and analyzed for the considered scenario. Furthermore, to control interference and improve the performance, two power control strategies are designed and their complexity and convergence are also discussed. The first power control strategy aims at maximizing CFUEs’ sum spectral efficiency (SE) subject to quality of service constraints on DUEs, while the second one maximizes the weighted product of CFUEs’ and DUEs’ signal-to-interference-plus-noise-ratios (SINRs). Numerical results show that the proposed pilot and power allocations bring a considerable improvement to the network SE. Also, it is revealed that the activation of D2D links has a positive effect on the system throughput, i.e. the network offloading ensured by the D2D links overcomes the increased interference brought by D2D communications. [ABSTRACT FROM AUTHOR]

This paper investigates and analyzes the number of reflecting elements for guaranteed energy- and spectral-efficient intelligent reflecting surface (IRS)-assisted communication systems. As opposed to previous works where the energy efficiency (EE)/the spectral efficiency (SE) maximization or the EE-SE tradeoff was considered, our goal is to minimize the number of reflecting elements in the IRS-assisted system. Besides, both the EE and the SE constraints are considered in the number minimization problem, which has not been addressed in existing works. However, both the EE and the SE performance do not admit exact closed-form expressions due to the non-convexity incurred by joint beamforming and phase shift design. In order to make the optimization problem tractable, we resort to their performance bounds for problem reformulation. By decomposing the problem into two sub-problems, we are able to derive closed-form expressions for the minimum number of reflecting elements, and both the coherent phase shift (CPS)-oriented solution and the random phase shift (RPS)-oriented solution are proposed for comparison. In order to shed light on the practical design, the relationship between the derived number of reflecting elements is established for both schemes, and the upper bounds on both the EE and the SE thresholds and the placement of the IRS to achieve only one reflecting element are obtained. Simulation results confirm the validity of our analysis on the minimum number of reflecting elements and effectiveness of both schemes. [ABSTRACT FROM AUTHOR]

Limited access to available spectrum motivates new age radio frequency (RF) systems to co-exist and cooperate. In this paper, we consider a joint communication and radar system (labeled Comm-Radar), that is capable of receiving and decoding communication signals while simultaneously enabling radar functionalities. Traditionally, systems that leverage principles of spectrum convergence, deemed each functions to be detrimental to the others. This has led to successive interference cancellations strategies that effectively isolate each of the functionalities. Here, in the context of Comm-Radar processing structure, we show that ambient communication transmissions actually assist in radar estimation. The insight is that communications multipath reflects off radar targets (we denote these comm-target paths) in the environment, and can be processed at the receiver to extract extra information. In this work we characterize the fundamental performance limits of such a joint system.To demonstrate the radar performance gain achievable via the processing of extra comm-target paths, the closed-form Cramér-Rao Bound (CRB) for the estimation of direction, range and velocity of a target is derived, for both the general case, and practical radar and communication signalling schemes. Based on the CRB, joint outer bounds are obtained to characterize the trade off between estimation performance and communication rate. Finally, numerical results verify the advantages of utilizing the target reflections from the communication signal to bolster radar performance. [ABSTRACT FROM AUTHOR]

Minimizing the symbol error in the uplink of multi-user multiple input multiple output systems is important, because the symbol error affects the achieved signal-to-interference-plus-noise ratio (SINR) and thereby the spectral efficiency of the system. Despite the vast literature available on minimum mean squared error (MMSE) receivers, previously proposed receivers for block fading channels do not minimize the symbol error in time-varying Rayleigh fading channels. Specifically, we show that the true MMSE receiver structure does not only depend on the statistics of the CSI error, but also on the autocorrelation coefficient of the time-variant channel. It turns out that calculating the average SINR when using the proposed receiver is highly non-trivial. In this paper, we employ a random matrix theoretical approach, which allows us to derive a quasi-closed form for the average SINR, which allows to obtain analytical exact results that give valuable insights into how the SINR depends on the number of antennas, employed pilot and data power and the covariance of the time-varying channel. We benchmark the performance of the proposed receiver against recently proposed receivers and find that the proposed MMSE receiver achieves higher SINR than the previously proposed ones, and this benefit increases with increasing autoregressive coefficient. [ABSTRACT FROM AUTHOR]

In this paper, the end-to-end performance of a mixed radio frequency (RF)/free space optical (FSO) affected by co-channel interference (CCI), is studied. We consider that the RF link experiences $\eta -\mu $ fading and the FSO link is subjected to atmospheric turbulence, which is modeled by the $\alpha -\mu $ distribution. Also, the statistics of the FSO link is presented for the case of zero and non-zero boresight pointing errors. Furthermore, we assume intensity modulation with direct detection (IM/DD) and coherent demodulation. In particular, we present a closed-form expression for the probability density function of the FSO link, which is then used to obtain a closed-form and an asymptotic expression for the outage probability. In order to quantify the system performance, we utilize this asymptotic result to yield the system’s coding gain and diversity order. Moreover, we have presented analytical expressions for the average bit error rate (BER) and ergodic capacity for the system design. In order to gain more insights, high signal-to-noise ratio (SNR) approximations expressions for the BER and ergodic capacity, are also derived. Finally, the analytical results presented in the paper are validated through computer simulations. [ABSTRACT FROM AUTHOR]

Sharing of the frequency bands between radar and communication systems has attracted substantial attention, as it can avoid under-utilization of otherwise permanently allocated spectral resources, thus improving efficiency. Further, there is increasing demand for radar and communication systems that share the hardware platform as well as the frequency band, as this not only decongests the spectrum, but also benefits both sensing and signaling operations via the full cooperation between both functionalities. Nevertheless, the success of spectrum and hardware sharing between radar and communication systems critically depends on high-quality joint radar and communication designs. In the first part of this paper, we overview the research progress in the areas of radar-communication coexistence and dual-functional radar-communication (DFRC) systems, with particular emphasis on application scenarios and technical approaches. In the second part, we propose a novel transceiver architecture and frame structure for a DFRC base station (BS) operating in the millimeter wave (mmWave) band, using the hybrid analog-digital (HAD) beamforming technique. We assume that the BS is serving a multi-antenna user equipment (UE) over a mmWave channel, and at the same time it actively detects targets. The targets also play the role of scatterers for the communication signal. In that framework, we propose a novel scheme for joint target search and communication channel estimation, which relies on omni-directional pilot signals generated by the HAD structure. Given a fully-digital communication precoder and a desired radar transmit beampattern, we propose to design the analog and digital precoders under non-convex constant-modulus (CM) and power constraints, such that the BS can formulate narrow beams towards all the targets, while pre-equalizing the impact of the communication channel. Furthermore, we design a HAD receiver that can simultaneously process signals from the UE and echo waves from the targets. By tracking the angular variation of the targets, we show that it is possible to recover the target echoes and mitigate the resulting interference to the UE signals, even when the radar and communication signals share the same signal-to-noise ratio (SNR). The feasibility and efficiency of the proposed approaches in realizing DFRC are verified via numerical simulations. Finally, the paper concludes with an overview of the open problems in the research field of communication and radar spectrum sharing (CRSS). [ABSTRACT FROM AUTHOR]

Since the seminal paper by Marzetta from 2010, Massive MIMO has changed from being a theoretical concept with an infinite number of antennas to a practical technology. The key concepts are adopted into the 5G New Radio Standard and base stations (BSs) with $M=64$ fully digital transceivers have been commercially deployed in sub-6GHz bands. The fast progress was enabled by many solid research contributions of which the vast majority assume spatially uncorrelated channels and signal processing schemes developed for single-cell operation. These assumptions make the performance analysis and optimization of Massive MIMO tractable but have three major caveats: 1) practical channels are spatially correlated; 2) large performance gains can be obtained by multicell processing, without BS cooperation; 3) the interference caused by pilot contamination creates a finite capacity limit, as $M\to \infty $. There is a thin line of papers that avoided these caveats, but the results are easily missed. Hence, this tutorial article explains the importance of considering spatial channel correlation and using signal processing schemes designed for multicell networks. We present recent results on the fundamental limits of Massive MIMO, which are not determined by pilot contamination but the ability to acquire channel statistics. These results will guide the journey towards the next level of Massive MIMO, which we call “Massive MIMO 2.0”. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the sum rate performance of multi-user multiple-input-multiple-output (MU-MIMO) systems, with a finite constellation phase-shift keying (PSK) input alphabet. We analytically calculate and compare the achievable sum rate in three downlink transmission scenarios: 1) without precoding; 2) with zero forcing (ZF) precoding; and 3) with closed form constructive interference (CI) precoding technique. In light of this, new analytical expressions for the average sum rate are derived in the three cases, and Monte Carlo simulations are provided throughout to validate the analysis. Furthermore, based on the derived expressions, a power allocation scheme that can ensure fairness among the users is also proposed. The results in this work demonstrate that the CI strictly outperforms the other two schemes, and the performance gap between the considered schemes increases with the increase in MIMO size. In addition, the CI provides higher fairness and the power allocation algorithm proposed in this paper can achieve maximum fairness index. [ABSTRACT FROM AUTHOR]