Information Velocity of Cascaded Gaussian Channels With Feedback

Elad Domanovitz, Anatoly Khina*, Tal Philosof, Yuval Kochman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a line network of nodes, connected by additive white noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an explicit positive lower bound on the velocity, for any packet size. Furthermore, we consider streaming, that is, transmission of data packets generated at a given average arrival rate. We show that a positive velocity exists as long as the arrival rate is below the individual Gaussian channel capacity, and provide an explicit lower bound. Our analysis involves applying pulse-amplitude modulation to the data (successively in the streaming case), and using linear mean-squared error estimation at the network nodes. For general white noise, we derive exponential error-probability bounds. For single-packet transmission over channels with (sub-)Gaussian noise, we show a doubly-exponential behavior, which reduces to the celebrated Schalkwijk-Kailath scheme when considering a single node. Viewing the constellation as an 'analog source', we also provide bounds on the exponential decay of the mean-squared error of source transmission over the network.

Original languageEnglish
Pages (from-to)554-569
Number of pages16
JournalIEEE Journal on Selected Areas in Information Theory
Volume5
DOIs
StatePublished - 2024

Keywords

  • Gaussian channels
  • Information velocity
  • combined source-channel coding
  • low-latency communication
  • relay networks

Fingerprint

Dive into the research topics of 'Information Velocity of Cascaded Gaussian Channels With Feedback'. Together they form a unique fingerprint.

Cite this