Abstract
In this paper we consider a tensor-based approach to the analytical computation of higher-order expectations of quantized trajectories generated by Piecewise Affine Markov (PWAM) maps. We formally derive closed-form expressions for expectations of trajectories generated by three families of maps, referred to as (n, t)-tailed shifts, (n, t)-broken identities and (n, t, π)-mixing permutations. These families produce expectations with asymptotic exponential decay whose detailed profile is controlled by map design. In the (n, t)-tailed shift case expectations are alternating in sign, in the (n, t)-broken identity case they are constant in sign, and the (n, t, π)-mixing permutation case they follow a dumped periodic trend.
Original language | English (US) |
---|---|
Pages (from-to) | 2090-2100 |
Number of pages | 11 |
Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
Volume | E84-A |
Issue number | 9 |
State | Published - Jan 1 2001 |
Externally published | Yes |
Bibliographical note
Generated from Scopus record by KAUST IRTS on 2023-02-15ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Electrical and Electronic Engineering