2020
DOI: 10.1109/tvt.2020.2986788
|View full text |Cite
|
Sign up to set email alerts
|

A Novelty in Blahut-Arimoto Type Algorithms: Optimal Control Over Noisy Communication Channels

Abstract: A probability-theoretic problem under information constraints for the concept of optimal control over a noisymemoryless channel is considered. For our Observer-Controller block, i.e., the lossy joint-source-channel-coding (JSCC) scheme, after providing the relative mathematical expressions, we propose a 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 min. This problem is an N P−hard an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 39 publications
0
6
0
Order By: Relevance
“…13 For more details and about the rotations of the probabilities relating to each other see e.g. [2] − where an Alternating optimisation method was proposed.…”
Section: Appendix F Proof Of Propositionmentioning
confidence: 99%
See 2 more Smart Citations
“…13 For more details and about the rotations of the probabilities relating to each other see e.g. [2] − where an Alternating optimisation method was proposed.…”
Section: Appendix F Proof Of Propositionmentioning
confidence: 99%
“…Two terms control and information are interchangeable [1], [2], [3], [4], [5]. The information-theoretic bounds achieved through simultaneous resource use have a lot of priorities compared with the recent random access strategies.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Some of the most successful data-driven techniques will be highlighted as follows citing both classical and fresh papers that actually apply them: Iterative Feedback Tuning (IFT) (Hjalmarsson, 2002;Jung et al, 2020), Modelfree Adaptive Control (Hou & Wang, 2013;Yu et al, 2020), Simultaneous Perturbation Stochastic Approximation (Spall & Cristion, 1998;Zamanipour, 2020), Correlation-based Tuning (Karimi et al, 2004;Sato, 2020), Frequency Domain Tuning (Kammer et al, 2000;da Silva Moreira et al, 2018), Iterative Regression Tuning (Halmevaara & Hyötyniemi, 2006), and adaptive online IFT (McDaid et al, 2012). While these data-driven techniques actually carry out the iterative experiment-based update of controller parameters, non-iterative techniques are also popular as Model-Free Control (MFC) (Fliess & Join, 2009, Virtual Reference Feedback Tuning (Campi et al, 2002;Formentin et al, 2019); Active Disturbance Rejection Control (Gao, 2006;Roman et al, 2020), data-driven predictive control (Kadali et al, 2003;Lucchini et al, 2020), unfalsified control (Safonov & Tsao, 1997;Jiang et al, 2016) and Data-Driven Inversion Based Control (Novara et al, 2015;Galluppi et al, 2019).…”
Section: Introductionmentioning
confidence: 99%
“…This kind of optimisation problem can be solved by the alternating direction method of multipliers: See e.g [27],[28],[29]…”
mentioning
confidence: 99%