6 research outputs found
A Systematic Approach to Incremental Redundancy over Erasure Channels
As sensing and instrumentation play an increasingly important role in systems
controlled over wired and wireless networks, the need to better understand
delay-sensitive communication becomes a prime issue. Along these lines, this
article studies the operation of data links that employ incremental redundancy
as a practical means to protect information from the effects of unreliable
channels. Specifically, this work extends a powerful methodology termed
sequential differential optimization to choose near-optimal block sizes for
hybrid ARQ over erasure channels. In doing so, an interesting connection
between random coding and well-known constants in number theory is established.
Furthermore, results show that the impact of the coding strategy adopted and
the propensity of the channel to erase symbols naturally decouple when
analyzing throughput. Overall, block size selection is motivated by normal
approximations on the probability of decoding success at every stage of the
incremental transmission process. This novel perspective, which rigorously
bridges hybrid ARQ and coding, offers a pragmatic means to select code rates
and blocklengths for incremental redundancy.Comment: 7 pages, 2 figures; A shorter version of this article will appear in
the proceedings of ISIT 201
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback
We present an upper bound on the error probability achievable using
variable-length stop feedback codes, for a fixed size of the information
payload and a given constraint on the maximum latency and the average service
time. Differently from the bound proposed in Polyanskiy et al. (2011), which
pertains to the scenario in which the stop signal is sent over a noiseless
feedback channel, our bound applies to the practically relevant setup in which
the feedback link is noisy. By numerically evaluating our bound, we illustrate
that, for fixed latency and reliability constraints, noise in the feedback link
can cause a significant increase in the minimum average service time, to the
extent that fixed-length codes without feedback may be preferable in some
scenarios.Comment: Submitted to a Transactions on Wireless Communication
Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies
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