For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor ρ approaches 1 from below with either t...

In this paper we discuss the application of Tomlinson-Harashima-type precoding to point-to-multipoint transmission scenarios. These include the CDMA downlink from a central transmitter (base station) to distributed, decentralized receivers (mobile terminals), as well as transmission from a satellite to multiple receiving earth stations. At the expense of only a very moderate increase in signal ...

For a packet erasure broadcast channel with two receivers, a new coding algorithm is proposed that makes use of feedback to achieve asymptotically optimal queue size at the sender and decoding delay at the receivers, without compromising on throughput. Our coding module is compatible with the drop-when-seen queuing algorithm proposed in earlier work [1]. Hence, it guarantees that the physical q...

Receiver-driven layered multicast has been designed to support scalable multimedia applications and very recently used to support bulk file transfers. Layered multicast congestion control assumes that all the receivers behind a bottleneck are equally able to subscribe to a particular number of cumulative layers. This paper explores the requirement placed on heterogeneous receivers behind a bott...

Random linear network coding (RLNC) is asymptotically throughput optimal in the wireless broadcast of a block of packets from a sender to a set of receivers, but suffers from heavy computational load and packet decoding delay. To mitigate this problem while maintaining good throughput, we partition the packet block into disjoint generations after broadcasting the packets uncoded once and collec...

For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor ρ approaches 1 from below with either t...

Analog joint source-channel coding (JSCC) is a communication strategy that does not follow the separation principle of conventional digital systems but has been shown to approach the optimal distortion-cost tradeoff over additive white Gaussian noise channels. In this work, we investigate the feasibility of analog JSCC over multiple-input multiple-output (MIMO) fading channels. Since, due to co...

Introduction: Blind adaptive linear receivers for DS-CDMA have been proposed in recent years to supress multiple acess interference (MAI) [1–4]. Blind solutions for flat channels based on the minimum variance (MV) and the constant modulus (CM) criterion have been reported in [1] and [2]. Recently, constrained minimum variance (CMV) and constrained constant modulus (CCM) adaptive linear receiver...

Layered coding is often proposed as a solution for ratebased congestion control of video transmission in heterogeneous environments. The problem addressed more specifically here is the design of a responsive mechanism for rate allocation in each layer, that would guarantee the best bandwidth usage for all the receivers. One key features, in contrast with existing solutions, are an optimization ...

A new and efficient class of nonlinear receivers is introduced for digital communication systems. These “iterated-decision” receivers use optimized multipass algorithms to successively cancel interference from a block of received data and generate symbol decisions whose reliability increases monotonically with each iteration. Two variants of such receivers are discussed: the iterated-decision e...