37 research outputs found

    Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies

    Get PDF
    The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy

    Link-Layer Rate of Multiple Access Technologies with Short-Packet Communications for uRLLC

    Get PDF
    Mission-critical applications such as autonomous vehicles, tactile Internet, and factory automation require seamless connectivity with stringent requirements of latency and reliability. These futuristic applications are supported with the service class of ultra reliable and low-latency communications (uRLLC). In this thesis, the performance of core enablers of the uRLLC, non-orthogonal multiple access (NOMA), and NOMA-random access (NOMA-RA) in conjunction with the short-packet communications regime is investigated. More specifically, the achievable effective capacity (EC) of two-user and multi-user NOMA and conditional throughput of the NOMA-RA with short-packet communications are derived. A closed-form expressions for the EC of two-user NOMA network in finite blocklength regime (short-packet communication) is derived, while considering transmissions over Rayleigh fading channels and adopting a practical path-loss model. While considering the multi-user NOMA network, the total EC of two-user NOMA subsets is derived, which shows that the NOMA set with users having distinct channel conditions achieve maximum aggregate EC. The comparison of link-layer rate of NOMA and orthogonal multiple access (OMA) shows that OMA with short-packet communications outperformed the NOMA at low SNR (20dB). However, at high SNR region (from 20dB to 40dB), the two-user NOMA performs much better than OMA. To further investigate the impact of the channel conditions on the link-layer rate of NOMA and OMA, the simulation results with generalized fading model, i.e., Nakagami-m are also presented. The NOMA-RA with short-packet communications is also regarded as the core enabler of uRLLC. How the NOMA-RA with short-packet communications access the link-layer resources is investigated in detail. The conditional throughput of NOMA-RA is derived and compared with the conventional multiple access scheme. It is clear that NOMA-RA with optimal access probability region (from 0.05 to 0.1) shows maximum performance. Finally, the thesis is concluded with future work, and impact of this research on the industrial practice are also highlighted
    corecore