Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Asymptotic Reverse Waterfilling Algorithm of NRDF for Certain Classes of Vector Gauss-Markov Processes

View through CrossRef
<div>In this paper, we revisit the asymptotic reverse-waterfilling characterization of the nonanticipative rate distortion</div><div>function (NRDF) derived for a time-invariant multidimensional Gauss-Markov processes with mean-squared error (MSE) distortion in [1]. We show that for certain classes of time-invariant multidimensional Gauss-Markov processes, the specific characterization behaves as a reverse-waterfilling algorithm obtained in matrix form ensuring that the numerical approach of [1, Algorithm 1] is optimal. In addition, we give an equivalent characterization that utilizes the eigenvalues of the involved matrices reminiscent of the well-known reverse-waterfilling algorithm in information theory. For the latter, we also propose a novel numerical approach to solve the algorithm optimally. The efficacy of our proposed iterative scheme compared to similar existing schemes is demonstrated via experiments. Finally, we use our new results to derive an analytical solution of the asymptotic NRDF for a correlated time-invariant two-dimensional Gauss-Markov process.</div>
Institute of Electrical and Electronics Engineers (IEEE)
Title: Asymptotic Reverse Waterfilling Algorithm of NRDF for Certain Classes of Vector Gauss-Markov Processes
Description:
<div>In this paper, we revisit the asymptotic reverse-waterfilling characterization of the nonanticipative rate distortion</div><div>function (NRDF) derived for a time-invariant multidimensional Gauss-Markov processes with mean-squared error (MSE) distortion in [1].
We show that for certain classes of time-invariant multidimensional Gauss-Markov processes, the specific characterization behaves as a reverse-waterfilling algorithm obtained in matrix form ensuring that the numerical approach of [1, Algorithm 1] is optimal.
In addition, we give an equivalent characterization that utilizes the eigenvalues of the involved matrices reminiscent of the well-known reverse-waterfilling algorithm in information theory.
For the latter, we also propose a novel numerical approach to solve the algorithm optimally.
The efficacy of our proposed iterative scheme compared to similar existing schemes is demonstrated via experiments.
Finally, we use our new results to derive an analytical solution of the asymptotic NRDF for a correlated time-invariant two-dimensional Gauss-Markov process.
</div>.

Related Results

A novel sequential RDF to compute partially observable Markov processes with MSE distortion
A novel sequential RDF to compute partially observable Markov processes with MSE distortion
<div>We develop a new sequential rate distortion function</div><div>to compute lower bounds on the average length of all causal prefix free codes for partially ob...
Carl Friedrich Gauss
Carl Friedrich Gauss
At an early age, Gauss showed unusual ability in mathematics. In fact, some say that he was only three when he corrected his father's calculations of the pay due men working under ...
Study on Structure Parameters of Reverse Circulation Drill Bit Secondary Injector Device Based on Injector Coefficient
Study on Structure Parameters of Reverse Circulation Drill Bit Secondary Injector Device Based on Injector Coefficient
Abstract The hollow-through DTH hammer reverse circulation continuous coring drilling technology has been successfully applied to well drilling. During its applicati...
Optimising tool wear and workpiece condition monitoring via cyber-physical systems for smart manufacturing
Optimising tool wear and workpiece condition monitoring via cyber-physical systems for smart manufacturing
Smart manufacturing has been developed since the introduction of Industry 4.0. It consists of resource sharing and networking, predictive engineering, and material and data analyti...
An Entropy Rate Theorem for a Hidden Inhomogeneous Markov Chain
An Entropy Rate Theorem for a Hidden Inhomogeneous Markov Chain
Objective: The main object of our study is to extend some entropy rate theorems to a Hidden Inhomogeneous Markov Chain (HIMC) and establish an entropy rate theo...
Improved grey‐Markov chain algorithm for forecasting
Improved grey‐Markov chain algorithm for forecasting
PurposeThe purpose of this paper is to present a method to accurately forecast the tendency of the gross amount of energy sources consumption of the country and construct a new kin...
Asymptotic Scaling of Optimal Cost and Asymptotic Optimality of Base-Stock Policy in Several Multidimensional Inventory Systems
Asymptotic Scaling of Optimal Cost and Asymptotic Optimality of Base-Stock Policy in Several Multidimensional Inventory Systems
Asymptotic Optimality of Simple Heuristic Policies for Multidimensional Inventory Systems Stochastic inventory systems with multidimensional state spaces, such as lost-sales syste...
Improved Artificial Bee Colony Algorithm Based on Harris Hawks Optimization
Improved Artificial Bee Colony Algorithm Based on Harris Hawks Optimization
<p>Artificial bee colony algorithm, as a kind of bio-like intelligent algorithm, used by various optimization problems because of its few parameters and simple structure. How...

Back to Top