Information Velocity of Cascaded Gaussian Channels With Feedback

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. Furth...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in information theory Jg. 5; S. 554 - 569
Hauptverfasser: Domanovitz, Elad, Khina, Anatoly, Philosof, Tal, Kochman, Yuval
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Channel capacity
Channel estimation
Channels
combined source–channel coding
Error analysis
Error probability
Feedback
Gaussian channels
Gaussian processes
Information processing
Information velocity
Low latency communication
Lower bounds
Nodes
Noise measurement
Packet transmission
Pulse amplitude modulation
Random noise
relay networks
Relays
Source coding
Transmitters
Velocity
White noise
ISSN:2641-8770, 2641-8770
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2641-8770
2641-8770
DOI:10.1109/JSAIT.2024.3416310