Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kosut, Oliver, Effros, Michelle, Langberg, Michael
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2401.15495
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910309988433920
author Kosut, Oliver
Effros, Michelle
Langberg, Michael
author_facet Kosut, Oliver
Effros, Michelle
Langberg, Michael
contents Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our study addresses high-dimensional relay codes and presents bounds that outperform prior known bounds using 2-dimensional schemes. A novelty of our analysis ties the optimization problem at hand to the solution of a certain differential equation which, in turn, leads to a low energy-per-bit achievable scheme.
format Preprint
id arxiv_https___arxiv_org_abs_2401_15495
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying
Kosut, Oliver
Effros, Michelle
Langberg, Michael
Information Theory
Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our study addresses high-dimensional relay codes and presents bounds that outperform prior known bounds using 2-dimensional schemes. A novelty of our analysis ties the optimization problem at hand to the solution of a certain differential equation which, in turn, leads to a low energy-per-bit achievable scheme.
title Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying
topic Information Theory
url https://arxiv.org/abs/2401.15495