Source-Channel Matching for Sources with Memory
Information Theory
2014-03-26 v2 math.IT
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.
Keywords
Cite
@article{arxiv.1310.3085,
title = {Source-Channel Matching for Sources with Memory},
author = {Christos Kourtellaris and Charalambos D. Charalambous and Photios A. Stavrou},
journal= {arXiv preprint arXiv:1310.3085},
year = {2014}
}
Comments
6 pages. arXiv admin note: substantial text overlap with arXiv:1304.6528