Email alerting service here right-hand corner of the article or click Receive free email alerts when new articles cite this article-sign up in the box at the top This paper introduces a new class of models of digital communications channels. Physically, these models take account of the digital nature of the input. Mathematically , they are iterated function systems. As a consequence of making e...

In this study, we explore the roles of learning and evolution in a non-cooperative autonomous system through a spatial IPD (Iterated Prisoner’s Dilemma) game. First, we propose a new agent model playing the IPD game; the game has a gene of the coded parameters of reinforcement learning. The agents evolve and learn during the course of the game. Second, we report an empirical study. In our simul...

Iterated Function Systems (IFS) raster compression techniques achieve their results by identifying self-similarities in the source image. However, not all source images contain exploitable self-similarity. We describe a compression technique that combines a Karhunen-Loeve basis set (for non self-similar aspects of an image) with a block based IFS.

We characterize those subsets S of the positive integers with the property that, whenever a point x in a dynamical system enters a compact set K along S, K contains a recurrent point. We do the same for uniform recurrence. Let X denote a (compact) metric space and f : X → X a continuous map. We will use the term (compact) dynamical system to refer to such a pair (X, f) . As usual, we write f fo...

Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation of these shapes requires interpolation of these transformations. Polar decomposition is used to avoid singular intermediate transformations and to better simulate articulated motion. Unlike some other representations, s...

We consider iterated function systems on the interval with random perturbation. Let Yε be uniformly distributed in [1 − ε, 1 + ε] and let fi ∈ C be contractions with fixpoints ai. We consider the iterated function system {Yεfi + ai(1− Yε)}i=1, were each of the maps are chosen with probability pi. It is shown that the invariant density is in L and the L-norm does not grow faster than 1/ √ ε, as ...

In earlier work [5], aimed at developing an approach to signal processing that can be applied as well to nonlinear systems as linear ones, we produced mathematical models of digital communications channels that took the form of iterated function systems (IFS). For finite-dimensional systems these models have observability properties indicating they could be used for signal processing applicatio...