Broadcast Approach for the Information Bottleneck Channel

Avi Steiner, Shlomo Shamai Shitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel, connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. This is compared to a decode-forward (non-oblivious) approach where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. In both settings it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate. Numerical results demonstrate the achievable broadcasting rate in the limit of continuous layering.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2019
ISBN (Electronic)9781538695494
DOIs
StatePublished - Nov 2019
Event2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2019 - Tel-Aviv, Israel
Duration: 4 Nov 20196 Nov 2019

Publication series

Name2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2019

Conference

Conference2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems, COMCAS 2019
Country/TerritoryIsrael
CityTel-Aviv
Period4/11/196/11/19

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • Electrical and Electronic Engineering
  • Instrumentation
  • Artificial Intelligence
  • Computer Networks and Communications

Cite this