Delay analysis of block coding over a noisy channel with limited feedback

Abstract

This work analyzes the average delay performance of block coding schemes when the arrival stream is stochastic. From classical Shannon Theory, it is known that communication is feasible at all rates strictly below capacity of a channel. However, this reliable scheme of communication is realized with unbounded coding length and hence average delay. This work considers the delay analysis of general block coding schemes over a noisy channel in presence of retransmission requests. Modeling the communication system as a queuing system with bulk service, an expected delay analysis is provided. The expected delay bits experience is then optimized by an appropriate choice of forward error correction scheme.

Delay-Sensitive Communication Over Fading Channels: Queueing Behavior and Code Parameter Selection

“…We assume that feedback is instantaneously and faithfully received at the source. This idealized view is frequently found in the literature [1], [5], [8], [13], [17], [18], [19], [29], [30]. In contrast, any detailed analysis of feedback requires making strong assumptions about correlation between the forward and reverse links, the delay associated with receiving feedback, and mechanisms to cope with corrupted messages.…”

“…Still, such policies usually disregard coding issues by considering a power threshold for reliable transmission. Moreover, the emphasis is often on average delay, or average queue length under Little's law, and the optimization objective naturally leads to dynamic programming formulations [16], [1], [2], [17], [18]. On a different note, the recent advent of network coding and the complementary approach of channel coding over networks have been applied to short-block, delaysensitive communications [19], [20].…”

“…In many such articles, the emphasis is put on average delay and the optimization objective naturally leads to dynamic programming formulations [1], [2], [12], [13]. We stress that the wide applicability of Little's law can be leveraged to simplify the analysis of many systems where average delay is a prime consideration [14]. On a different note, the recent advent of network coding and the complementary approach of channel coding over networks have been applied to short-block, delaysensitive communications [15], [16].…”

On ARQ for packet erasure channels with bernoulli arrivals

“…Furthermore, in an online setting, the coding must also be adaptable to variability in the arrival of packets. Most of the literature [1], [2], [3], [4] has focused on packet communication over channels in single as well as multiuser settings, assuming that feedback on transmission is available at the sender without any delay. Moreover, such studies have emphasized "queue management" at the sender with the objective of reducing the average delay suffered by a packet in reaching the receiver.…”