A Novelty in Blahut-Arimoto T ype Algorithms: Optimal Control over Noisy Commu nication Channels

Abstract

A probability-theoretic problem under information constraints for the concept of optimal control over a noisy-memoryless channel is considered. For our \textit{Observer-Controller} block, i.e., the lossy joint-source-channel-coding (JSCC) scheme, after providing the relative mathematical expressions, we propose a \textit{Blahut-Arimoto}-type algorithm $-$ which is, to the best of our knowledge, for the first time. The algorithm efficiently finds the probability-mass-functions (PMFs) required for .......................................