English
Related papers

Related papers: A Rate-Compatible Sphere-Packing Analysis of Feedb…

200 papers

There is considerable interest in the networking community in explicit congestion control as it may allow the design of a fair, stable, low loss, low delay, and high utilization network. The Rate Control Protocol (RCP) is an example of such…

Networking and Internet Architecture · Computer Science 2019-06-17 Abuthahir Abuthahir , Gaurav Raina , Thomas Voice

In this paper, we study in-order packet delivery in instantly decodable network coded systems for wireless broadcast networks. We are interested in applications, in which the successful delivery of a packet depends on the correct reception…

Networking and Internet Architecture · Computer Science 2014-09-24 Mohammad S. Karim , Parastoo Sadeghi , Neda Aboutorab , Sameh Sorour

We consider communication over the block noncoherent AWGN channel with low-precision Analog-to-Digital Converters (ADCs) at the receiver. For standard uniform Phase Shift Keying (PSK) modulation, we investigate the performance of a receiver…

Information Theory · Computer Science 2009-05-28 Jaspreet Singh , Upamanyu Madhow

Hybrid-ARQ protocols have become common in many packet transmission systems due to their incorporation in various standards. Hybrid-ARQ combines the normal automatic repeat request (ARQ) method with error correction codes to increase…

Information Theory · Computer Science 2015-05-27 Mayur Agrawal , Zachary Chance , David J. Love , Venkataramanan Balakrishnan

Future networks are expected to support various ultra-reliable low-latency communications via wireless links. To avoid the loss of packets and keep the low latency, sliding network coding (SNC) is an emerging technology by generating…

Information Theory · Computer Science 2022-04-26 Fangzhou Wu , Zhiyuan Tan , Huiying Zhu , Pengpeng Dong

In this paper, a comprehensive study of packet-based instantly decodable network coding (IDNC) for single-hop wireless broadcast is presented. The optimal IDNC solution in terms of throughput is proposed and its packet decoding delay…

Information Theory · Computer Science 2013-09-04 Mingchao Yu , Parastoo Sadeghi , Neda Aboutorab

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…

Information Theory · Computer Science 2018-02-21 Michael Heindlmaier , Shirin Saeedi Bidokhti

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…

Information Theory · Computer Science 2016-11-17 Che Lin , Vasanthan Raghavan , Venu Veeravalli

The design of communication signal sets is fundamentally a sphere packing problem. It aims to identify a set of M points in an N -dimensional space, with the objective of maximizing the separability of points that represent different…

Signal Processing · Electrical Eng. & Systems 2024-08-06 Shuaishuai Guo , Kaiqian Qu

The problem of coding for networks experiencing worst-case symbol errors is considered. We argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network…

Information Theory · Computer Science 2015-10-13 Qiwen Wang , Sidharth Jaggi

Molecular communication requires low-complexity symbol detection algorithms to deal with the many sources of uncertainty that are inherent in these channels. This paper proposes two variants of a high-performance asynchronous peak detection…

Information Theory · Computer Science 2017-02-27 Adam Noel , Andrew W. Eckford

This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

We consider wireless transmission of images in the presence of channel output feedback. From a Shannon theoretic perspective feedback does not improve the asymptotic end-to-end performance, and separate source coding followed by…

Information Theory · Computer Science 2020-04-13 David Burth Kurka , Deniz Gündüz

Streaming codes (SCs) are packet-level codes that recover erased packets within a strict decoding-delay deadline. Streaming codes for various packet erasure channel models such as sliding-window (SW) channel models that admit random or…

Information Theory · Computer Science 2024-05-13 Shobhit Bhatnagar , P. Vijay Kumar

A key issue in physical-layer network coding (PNC) is how to deal with the asynchrony between signals transmitted by multiple transmitters. That is, symbols transmitted by different transmitters could arrive at the receiver with symbol…

Information Theory · Computer Science 2015-03-19 Lu Lu , Soung Chang Liew

This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding union (RCU) bound. In the transmitter, the equally likely…

Information Theory · Computer Science 2021-11-18 Linfang Wang , Dan Song , Felipe Areces , Richard D. Wesel

In theory coordinated multi-point transmission (CoMP) promises vast gains in spectral efficiency. But industrial field trials show rather disappointing throughput gains, whereby the major limiting factor is proper sharing of channel state…

Information Theory · Computer Science 2016-11-18 Jan Schreck , Gerhard Wunder , Peter Jung

Posterior matching uses variable-length encoding of the message controlled by noiseless feedback of the received symbols to achieve high rates for short average blocklengths. Traditionally, the feedback of a received symbol occurs before…

Information Theory · Computer Science 2024-04-16 Amaael Antonini , Rita Gimelshein , Richard D. Wesel

Ultra-reliable short-packet communication is a major challenge in future wireless networks with critical applications. To achieve ultra-reliable communications beyond 99.999%, this paper envisions a new interaction-based communication…

Information Theory · Computer Science 2022-12-27 Yulin Shao , Emre Ozfatura , Alberto Perotti , Branislav Popovic , Deniz Gunduz