Publications related to Delay and coding in multiple-user communications

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac

Energy proportionality and workload consolidation are important objectives towards increasing efficiency in large-scale datacenters. Our work focuses on achieving these goals in the presence of applications with microsecond-scale tail latency requirements. ...

2015

Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Michael Christoph Gastpar, Jingge Zhu

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme im ...

Institute of Electrical and Electronics Engineers2015

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Michael Christoph Gastpar, Jingge Zhu

Lattice codes are applied to the two-user Gaussian multiple access channel (MAC) combined with a modified compute-and-forward transmitting scheme. It is shown that non-corner points on the boundary of the capacity region can be achieved by decoding two int ...

IEEE2014

Orthogonal multicarrier modulations in satellite uplinks

Stefano Rosati

In this paper, we analyze Orthogonal Frequency-Division Multiple Access and Single-Carrier Frequency Division Multiple Access as alternative physical layer schemes for the up-link of a satellite network. Both orthogonal frequency-division multiple access a ...

Wiley-Blackwell2014

Switched Local Schedules for Diamond Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a Gaussian diamond network where a source communicates with the destination through

n

non-interfering half-duplex relays. We focus on half-duplex schedules that utilize only local channel state information, i.e., each relay has access to its ...

2014

Polar Codes for the Two-User Multiple-Access Channel

Emre Telatar, Eren Sasoglu

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Institute of Electrical and Electronics Engineers2013

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

Mine Alsan

In this paper we show that mismatched polar codes over symmetric B-DMCs symmetrized under the same permutation can achieve rates of at least I (W, V) bits whenever I (W, V) > 0, where W denotes the communication channel, V the mismatched channel used in th ...

Ieee2013

Exploiting Common Randomness: a Resource for Network Secrecy

Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

Ieee2013

Delay and coding in multiple-user communications

Graph Chatbot

Chat with Graph Search

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Orthogonal multicarrier modulations in satellite uplinks

Switched Local Schedules for Diamond Networks

Polar Codes for the Two-User Multiple-Access Channel

Rate allocation and optimized decoding in inter-session network coding

A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Rate allocation and optimized decoding in inter-session network coding

A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

Orthogonal multicarrier modulations in satellite uplinks

Polar Codes for the Two-User Multiple-Access Channel

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Switched Local Schedules for Diamond Networks

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Gaussian (dirty) multiple access channels: a compute-and-forward perspective