Nonanticipative Rate Distortion Function for General Source-Channel Matching
Christos Kourtellaris, Charalambos D. Charalambous, Photios A. Stavrou
TL;DR
This paper introduces a nonanticipative rate distortion function for sources with memory, demonstrating its role in optimal source-channel matching and analyzing the performance of symbol-by-symbol codes without anticipation.
Contribution
It develops a nonanticipative RDF framework for sources with memory and proves the achievability of symbol-by-symbol codes without anticipation for optimal transmission.
Findings
Achievability of symbol-by-symbol codes without anticipation
Performance evaluation for Markov sources
Importance of nonanticipative RDF in source-channel matching
Abstract
In this paper we invoke a nonanticipative information Rate Distortion Function (RDF) for sources with memory, and we analyze its importance in probabilistic matching of the source to the channel so that transmission of a symbol-by-symbol code with memory without anticipation is optimal, with respect to an average distortion and excess distortion probability. We show achievability of the symbol-by-symbol code with memory without anticipation, and we evaluate the probabilistic performance of the code for a Markov source.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · DNA and Biological Computing · Error Correcting Code Techniques