Source-Channel Matching for Sources with Memory
Christos Kourtellaris, Charalambos D. Charalambous, Photios A. Stavrou
TL;DR
This paper investigates optimal symbol-by-symbol coding for sources with memory matched to channels with memory, demonstrating achievability and matching conditions for specific source-channel pairs under distortion constraints.
Contribution
It establishes conditions under which symbol-by-symbol codes with memory are optimal for sources with memory and shows matching for the Binary Symmetric Markov source over certain channels.
Findings
Achievability of symbol-by-symbol codes with memory without anticipation.
Matching conditions for BSMS(p) over first-order symmetric channels.
Optimal coding strategies under average and excess distortion constraints.
Abstract
In this paper we analyze the probabilistic matching of sources with memory to channels with memory so that symbol-by-symbol code with memory without anticipation are optimal, with respect to an average distortion and excess distortion probability. We show achievability of such a symbolby- symbol code with memory without anticipation, and we show matching for the Binary Symmetric Markov source (BSMS(p)) over a first-order symmetric channel with a cost constraint.
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
TopicsDNA and Biological Computing · Algorithms and Data Compression · Wireless Communication Security Techniques