charalambos D. charalambous

Dr. charalambos D. charalambous

University of Cyprus, Nicosia, Lefkosía, Cyprus
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 July 2018 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
PSPhotios Stavrou
Photios Stavrou
JØJan Østergaard
Jan Østergaard
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
We deal with zero-delay source coding of a vector-valued Gauss-Markov source subject to a mean-squared error (MSE) fidelity criterion \FS{characterized by the operational zero-delay vector-valued Gaussian rate distortion function (RDF). We address this problem by considering the nonanticipative RDF (NRDF) which is a lower bound to the causal and zero-delay RDF. We recall the realization that corresponds to the optimal “test-channel“ of the Gaussian NRDF, when considering a vector Gauss-Markov source subject to a MSE distortion in the finite time horizon. Then, we introduce sufficient conditions to show existence of solution for this problem in the infinite time horizon (or asymptotic regime). For the asymptotic regime, we use the asymptotic characterization of the Gaussian NRDF to provide a new equivalent realization scheme with feedback which is characterized by a resource allocation (reverse-waterfilling) problem across the dimension of the vector source. We leverage the new realization to derive a predictive coding scheme via lattice quantization with subtractive dither and joint memoryless entropy coding. This coding scheme offers an upper bound to the zero-delay vector-valued Gaussian RDF. When we use scalar quantization, then for r active dimensions of the vector Gauss-Markov source the gap between the obtained lower and upper bounds is less that or equal to 0.254r + 1 bits/sample. However, we further show that it is possible when we use vector quantization, and assume infinite dimensional Gauss-Markov sources to make the previous gap to be negligible, i.e., Gaussian NRDF approximates the zero-delay Gaussian RDF. We also extend our results to vector-valued Gauss-Markov sources of any order under mild conditions}. Our theoretical framework is demonstrated with illustrative numerical experiments.

31 August 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
PSPhotios Stavrou
Photios Stavrou
Directed information or its variants are utilized extensively in the characterization of the capacity of channels with memory and feedback, nonanticipative lossy data compression, and their generalizations to networks. In this paper, we derive several functional and topological properties of directed information, defined on general abstract alphabets (complete separable metric spaces), using the topology of weak convergence of probability measures. These include the convexity of the set of consistent distributions, which uniquely define causally conditioned distributions, convexity, and concavity of directed information with respect to the sets of consistent distributions, weak compactness of such sets of distributions, their joint distributions, and their marginals. Furthermore, we show lower semicontinuity of directed information, and under certain conditions, we also establish continuity. Finally, we derive variational equalities for directed information, including sequential versions. These may be viewed as the analog of the variational equalities of mutual information (utilized in Blahut-Arimoto algorithms). In summary, we extend the basic functional and topological properties of mutual information to directed information. These properties are discussed throughout this paper, in the context of extremum problems of directed information.

6 July 2016 in Mathematics of Control, Signals, and Systems
Verified
Journal Article
Closed access
PDF file
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous

2 June 2016 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
NANasir U. Ahmed
Nasir U. Ahmed
Decentralized optimization of distributed stochastic dynamical systems with two or more controls of the decision makers (DMs) has been an active area of research for over half a century. Although, such decentralized optimization problems are often formulated utilizing static team and person-by-person (PbP) optimality criteria, the corresponding static team theory results have not been extended to dynamical systems. In this first part of the two-part paper, we derive team and PbP optimality conditions for distributed stochastic differential systems, when the controls of the DMs generate actions based on different information structures. The necessary conditions are given by a Hamiltonian System described by coupled backward and forward stochastic differential equations (SDEs) and a conditional Hamiltonian, conditioned on the information structures available to the controls of the DMs. The sufficient conditions state that PbP optimality implies team optimality, if the Hamiltonian is convex in the state and/or actions spaces of the controls of the DMs. We show existence of relaxed team optimal strategies, when the information structures are not affected by the controls of the DMs. Throughout the paper we discuss similarities to analogous optimality conditions of centralized decision or control of stochastic systems, and we note a connections to mean field stochastic optimal control problems.

20 October 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SLSergey Loyka
Sergey Loyka
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
Optimal signaling over the Gaussian multiple-input multiple-output wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In combination with the rank-1 solution, this provides the complete characterization of the optimal covariance for the case of two transmit antennas. The cases of weak eavesdropper and high SNR are considered. It is shown that the optimal covariance does not converge to a scaled identity in the high-SNR regime. Necessary optimality conditions and a tight upper bound on the rank of an optimal covariance matrix are established for the general case, along with a lower bound to the secrecy capacity, which is tight in a number of scenarios.

28 November 2017 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
PSPhotios Stavrou
Photios Stavrou
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
charalambos D. charalambouscharalambos D. charalambous
charalambos D. charalambous
We derive the finite-time horizon nonanticipative rate distortion function (NRDF) of time-varying scalar Gauss–Markov sources under an average mean squared-error (MSE) distortion fidelity. Further, we show that a conditionally Gaussian reproduction process realizes the optimal reproduction distribution, and this is determined from the solution of a dynamic reverse-waterfilling optimization problem. We provide an iterative algorithm that approximates the solution of the dynamic reverse-waterfilling problem. From the above results, we also obtain, as a special case, the NRDF under a per-letter or pointwise MSE distortion fidelity, and we draw connections to the classical RDF of Gaussian processes. Our results are corroborated with illustrative examples.