The future connectivity landscape, and notably, the 5G wireless systems will feature Ultra-Reliable Low Latency Communication (URLLC). The coupling of high reliability and low latency requirements in URLLC use cases makes the wireless access design very challenging, in terms of both the protocol design and of the associated transmission techniques. This paper aims to provide a broad perspective on the fundamental tradeoffs in URLLC, as well as the principles used in building access protocols. Two specific technologies are considered in the context of URLLC: massive MIMO and multi-connectivity, also termed interface diversity . This paper also touches on the importance of the proper statistical methodology for designing and assessing extremely high-reliability levels.
One central question in multi-antenna system is the acquisition of instantaneous CSI. It is one of the most severe limitations to achieve URLLC when exploiting multiple antennas in a mobile environment constrained by channel coherence time as well as extreme latency requirements. The most critical acquisition occurs at the antenna array when the CSI is used for transmission mode (CSIT). In frequency division duplex (FDD) systems, CSIT acquisition requires a feedback loop from the terminals inducing a significant latency as the number of links to report is large. In a massive MIMO system below 6 GHz where the terminals have a small number of antennas, this concerns the BS in downlink transmission. In time division duplex (TDD) systems, latency can still be reduced by exploiting channel reciprocity @cite_1 , but remains critical. In a mmWave system, with potentially many antennas at the terminal, the issue concerns both side of the communication links.
@cite_1
2908955555 2015301486 2139569912 2635604129
A major obstacle for widespread deployment of frequency division duplex (FDD)-based Massive multiple-input multiple-output (MIMO) communications is the large signaling overhead for reporting full downlink (DL) channel state information (CSI) back to the basestation (BS), in order to enable closed-loop precoding. We completely remove this overhead by a deep-learning based channel extrapolation (or "prediction") approach and demonstrate that a neural network (NN) at the BS can infer the DL CSI centered around a frequency @math by solely observing uplink (UL) CSI on a different, yet adjacent frequency band around @math ; no more pilot reporting overhead is needed than with a genuine time division duplex (TDD)-based system. The rationale is that scatterers and the large-scale propagation environment are sufficiently similar to allow a NN to learn about the physical connections and constraints between two neighboring frequency bands, and thus provide a well-operating system even when classic extrapolation methods, like the Wiener filter (used as a baseline for comparison throughout) fails. We study its performance for various state-of-the-art Massive MIMO channel models, and, even more so, evaluate the scheme using actual Massive MIMO channel measurements, rendering it to be practically feasible at negligible loss in spectral efficiency when compared to a genuine TDD-based system. We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the CSIT uplink feedback, thus making the use of large antenna arrays at the base station potentially suitable also for frequency division duplexing (FDD) systems, for which uplink downlink channel reciprocity cannot be exploited. In the proposed scheme, the multiuser MIMO downlink precoder is obtained by concatenating a prebeamforming matrix, which depends only on the channel second-order statistics, with a classical multiuser precoder, based on the instantaneous knowledge of the resulting reduced dimensional “effective” channel matrix. We prove a simple condition under which JSDM incurs no loss of optimality with respect to the full CSIT case. For linear uniformly spaced arrays, we show that such condition is approached in the large number of antennas limit. For this case, we use Szego's asymptotic theory of Toeplitz matrices to show that a DFT-based prebeamforming matrix is near-optimal, requiring only coarse information about the users angles of arrival and angular spread. Finally, we extend these ideas to the case of a 2-D base station antenna array, with 3-D beamforming, including multiple beams in the elevation angle direction. We provide guidelines for the prebeamforming optimization and calculate the system spectral efficiency under proportional fairness and max-min fairness criteria, showing extremely attractive performance. Our numerical results are obtained via asymptotic random matrix theory, avoiding lengthy Monte Carlo simulations and providing accurate results for realistic (finite) number of antennas and users. In this work, we consider a multiple-input single-output system in which an access point (AP) performs a simultaneous wireless information and power transfer (SWIPT) to serve a user terminal (UT) that is not equipped with external power supply. To assess the efficacy of the SWIPT, we target a practically relevant scenario characterized by imperfect channel state information (CSI) at the transmitter, the presence of penalties associated to the CSI acquisition procedures, and non-zero power consumption for the operations performed by the UT, such as CSI estimation, uplink signaling and data decoding. We analyze three different cases for the CSI knowledge at the AP: no CSI, and imperfect CSI in case of time-division duplexing and frequency-division duplexing communications. Closed-form representations of the ergodic downlink rate and both the energy shortage and data outage probability are derived for the three cases. Additionally, analytic expressions for the ergodically optimal duration of power transfer and channel estimation feedback phases are provided. Our numerical findings verify the correctness of our derivations, and also show the importance and benefits of CSI knowledge at the AP in SWIPT systems, albeit imperfect and acquired at the expense of the time available for the information transfer. This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided.