Next Article in Journal
Robustification of a One-Dimensional Generic Sigmoidal Chaotic Map with Application of True Random Bit Generation
Next Article in Special Issue
Application of Permutation Entropy and Permutation Min-Entropy in Multiple Emotional States Analysis of RRI Time Series
Previous Article in Journal
Investigating the Configurations in Cross-Shareholding: A Joint Copula-Entropy Approach
Previous Article in Special Issue
Characterizing Complex Dynamics in the Classical and Semi-Classical Duffing Oscillator Using Ordinal Patterns Analysis
Open AccessArticle

Complexity of Simple, Switched and Skipped Chaotic Maps in Finite Precision

1
Facultad de Ingeniería, Universidad Nacional de Mar del Plata (UNMdP), Mar del Plata B7608FDQ, Argentina
2
Instituto de Investigaciones Científicas y Tecnológicas en Electrónica (ICyTE), Universidad Nacional de Mar del Plata (UNMdP), Mar del Plata B7608FDQ, Argentina
3
Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Rivadavia 1917, Buenos Aires, Argentina
4
Departamento de Informática en Salud, Hospital Italiano de Buenos Aires, Ciudad Autónoma de Buenos Aires C1199ABB, Argentina
5
Instituto de Física, Universidade Federal de Alagoas (UFAL), Maceió 57072-900, Brazil
6
Facultad de Ingeniería y Ciencias Aplicadas, Universidad de Los Andes, Monseñor Álvaro del Portillo 12455, Santiago, Chile
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(2), 135; https://doi.org/10.3390/e20020135
Received: 29 December 2017 / Revised: 15 February 2018 / Accepted: 16 February 2018 / Published: 20 February 2018
(This article belongs to the Special Issue Permutation Entropy & Its Interdisciplinary Applications)
In this paper we investigate the degradation of the statistic properties of chaotic maps as consequence of their implementation in a digital media such as Digital Signal Processors (DSP), Field Programmable Gate Arrays (FPGA) or Application-Specific Integrated Circuits (ASIC). In these systems, binary floating- and fixed-point are the numerical representations available. Fixed-point representation is preferred over floating-point when speed, low power and/or small circuit area are necessary. Then, in this paper we compare the degradation of fixed-point binary precision version of chaotic maps with the one obtained by using floating point 754-IEEE standard, to evaluate the feasibility of their FPGA implementation. The specific period that every fixed-point precision produces was investigated in previous reports. Statistical characteristics are also relevant, it has been recently shown that it is convenient to describe the statistical characteristic using both, causal and non-causal quantifiers. In this paper we complement the period analysis by characterizing the behavior of these maps from an statistical point of view using cuantifiers from information theory. Here, rather than reproducing an exact replica of the real system, the aim is to meet certain conditions related to the statistics of systems. View Full-Text
Keywords: chaos; finite precision; hardware implementaion; switching maps chaos; finite precision; hardware implementaion; switching maps
Show Figures

Figure 1

MDPI and ACS Style

Antonelli, M.; De Micco, L.; Larrondo, H.; Rosso, O.A. Complexity of Simple, Switched and Skipped Chaotic Maps in Finite Precision. Entropy 2018, 20, 135.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop