Publication
Computation over multiple-access channels
Publications associées (40)
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu
Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...
2019Compute–Forward Multiple Access (CFMA): Practical Implementations
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore
We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...
2019Demonstration of Kramers-Kronig Detection of Four 20-Gbaud 16-QAM Channels after 50-km Transmission Using Kerr Combs to Perform Shared Phase Estimation
Tobias Kippenberg, Maxim Karpov, Martin Hubert Peter Pfeiffer, Arne Kordts, Fatemeh Alishahi, Ahmad Fallahpour
We experimentally demonstrate KK detection of four 20-Gbaud 16-QAM channels after 50-km transmission using two soliton Kerr combs at transmitter and receiver. The frequency comb coherence enables a shared phase noise estimation among multiple channels. (C) ...
IEEE2019On the Duality between Multiple-Access Codes and Computation Codes
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu
For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess s ...
2017Polarization and Channel Ordering: Characterizations and Topological Structures
Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...
EPFL2017A Time-Division Multiplexing Signaling Scheme for Low-Power Multi-Drop Memory Links
Yusuf Leblebici, Gain Kim, Kiarash Gharibdoust, Chen Cao
A time-division multiplexing (TDM) digital channel coding scheme for wireline multi-drop interfaces has been proposed. Shaping the TX spectrum to avoid channel frequency notches, the proposed digital TDM signaling reduces inter-symbol interference (ISI) an ...
2017Compute-forward multiple access (CFMA) with nested LDPC codes
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore
Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...
2017CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory
While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding ...
EPFL2016Methods and systems for skew tolerance in and advanced detectors for vector signaling codes for chip-to-chip communication
Mohammad Amin Shokrollahi, Anant Pratap Singh
Advanced detectors for vector signaling codes are disclosed which utilize multi-input comparators, generalized on-level slicing, reference generation based on maximum swing, and reference generation based on recent values. Vector signaling codes communicat ...
2016Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel
Jonathan Mark Scarlett, Albert Guillén i Fàbregas
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's comb ...
Ieee-Inst Electrical Electronics Engineers Inc2015