Allerton 2015 Paper Abstract

Close

Paper ThD2.1

Lim, Sung Hoon (EPFL), Feng, Chen (University of British Columbia), Nazer, Bobak (Boston University), Gastpar, Michael (EPFL)

A Joint Typicality Approach to Compute-Forward

Scheduled for presentation during the Invited Session "Recent Developments in Information Theory, Statistics and Probability II" (ThD2), Thursday, October 1, 2015, 15:30−15:50, Solarium

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on November 19, 2019

Keywords Information Theory

Abstract

A general framework for analyzing linear codes with joint typicality encoders and decoders is presented. Using this approach, we provide a new perspective on the compute-forward framework. In particular, an achievable rate region for computing the weighted sum of nested linear codewords over a discrete memoryless multiple access channel (MAC) is established. When specialized to the Gaussian MAC, we recover the lattice-based compute-forward rate region by Nazer and Gastpar, providing a unified treatment over both discrete memoryless and Gaussian networks. By further utilizing simultaneous joint typicality decoders, we provide a joint decoding rate region for computing two linear combinations of nested linear codewords from K-senders. Our result provides some insight on one of the main open problems in the compute-forward framework, the joint decoding rate region of compute-forward.

 

 

All Content © PaperCept, Inc..


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-11-19  13:04:09 PST  Terms of use