Nonanticipative transmission for sources and channels with memory

In this paper we analyze nonanticipative (delayless) transmission of source symbols with memory over channels with memory (with and without feedback). We employ duality of {source, channel} pairs with respect to {distortion function, transmission cost} pairs to show achievability of nonanticipative transmission in terms of excess distortion probability. We apply the method to the Binary Markov source with Hamming distortion function and the Binary Unit Memory channel with transmission cost, with the joint-design operating optimally and in real-time, with and without feedback encoding and decoding.