Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. A New Coding Paradigm for the Primitive Relay Channel
 
conference paper

A New Coding Paradigm for the Primitive Relay Channel

Mondelli, Marco  
•
Hassani, S. Hamed  
•
Urbanke, Rudiger  
January 1, 2018
2018 IEEE International Symposium on Information Theory (Isit)
IEEE International Symposium on Information Theory (ISIT)

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding.

In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and-forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/ISIT.2018.8437479
Web of Science ID

WOS:000448139300071

Author(s)
Mondelli, Marco  
Hassani, S. Hamed  
Urbanke, Rudiger  
Date Issued

2018-01-01

Publisher

IEEE

Publisher place

New York

Published in
2018 IEEE International Symposium on Information Theory (Isit)
ISBN of the book

978-1-5386-4781-3

Series title/Series vol.

IEEE International Symposium on Information Theory

Start page

351

End page

355

Subjects

Computer Science, Information Systems

•

Engineering, Electrical & Electronic

•

Computer Science

•

Engineering

•

polar codes

•

capacity

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
IINFCOM  
Event nameEvent placeEvent date
IEEE International Symposium on Information Theory (ISIT)

Vail, CO

Jun 17-22, 2018

Available on Infoscience
December 13, 2018
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/152359
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés