FPGA Implementations for Chaotic Maps Using Fixed-Point and Floating-Point Representations

Author(s):  
Ricardo Francisco Martinez-Gonzalez ◽  
Ruben Vazquez-Medina ◽  
Jose Alejandro Diaz-Mendez ◽  
Juan Lopez-Hernandez

This work presents the implementation of various chaotic maps; among the maps there are one-dimensional and two-dimensional ones. In order to implement the maps, their mathematical descriptions are modified to be represented with more accuracy by different binary representations. The sequences from the same map are compared to determine until which iteration, different descriptions produce similar outputs. The similarity coefficient is established in five percent. Comparison delivers some interesting findings; first, the one-dimensional maps, in this work, have comparative number of similar iterations. Second, the bi-dimensional maps present the lowest and highest number of similar iterations. Based on the modified mathematical descriptions, the VHDL implementations are developed. They are simulated and their results are compared against the modified mathematical description ones; resulting that both groups of results are congruent.

1995 ◽  
Vol 05 (03) ◽  
pp. 751-777 ◽  
Author(s):  
A. BARUGOLA ◽  
J.C. CATHALA ◽  
C. MIRA

Properties of chaotic areas (i.e. invariant domains of points positively stable in the Poisson’s sense) of non-invertible maps of the plane are studied by using the method of critical curves (two-dimensional extension of the notion of critical points in the one-dimensional case). The classical situation is that of a chaotic area bounded by a finite number of critical curves segments. This paper considers another class of chaotic areas bounded by the union of critical curves segments and segments of the unstable manifold of a saddle fixed point, or that of saddle cycle (periodic point). Different configurations are examined, as their bifurcations when a map parameter varies.


Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.


2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.


2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.


Author(s):  
Bharti bharti ◽  
Debabrata Deb

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...


2013 ◽  
Vol 33 (2) ◽  
pp. 249-257 ◽  
Author(s):  
Alberto Colombo ◽  
Lívia A. Alvarenga ◽  
Myriane S. Scalco ◽  
Randal C. Ribeiro ◽  
Giselle F. Abreu

The increasing demand for water resources accentuates the need to reduce water waste through a more appropriate irrigation management. In the particular case of irrigated coffee planting, which in recent years presented growth with the predominance of drip irrigation, the improvement of drip irrigation management techniques is a necessity. The proper management of drip irrigation depends on the knowledge of the spatial pattern of soil moisture distribution inside the wetted strip formed under the irrigation lines. In this study, grids of 24 tensiometers were used to determine the water storage within the wetted strip formed under drippers, with a 3.78 L h-1 discharge, evenly spaced by 0.4 m, subjected to two different management criteria (fixed irrigation interval and 60 kPa tension). Estimates of storage based on a one-dimensional analysis, that only considers depth variations, were compared with two-dimensional estimates. The results indicate that for high-frequency irrigation the one-dimensional analysis is not appropriate. However, under less frequent irrigation, the two-dimensional analysis is dispensable, being the one-dimensional sufficient for calculating the water volume stored in the wetted strip.


1996 ◽  
Vol 06 (04) ◽  
pp. 725-735 ◽  
Author(s):  
ALEXANDER Yu. LOSKUTOV ◽  
VALERY M. TERESHKO ◽  
KONSTANTIN A. VASILIEV

We consider one-dimensional maps, the logistic map and an exponential map, in those sets of parameter values which correspond to their chaotic dynamics. It is proven that such dynamics may be stabilized by a certain cyclic parametric transformation operating strictly within the chaotic set. The stabilization is a result of the creation of stable periodic orbits in the initially chaotic maps. The period of these stable orbits is a multiple of the period of the cyclic transformation. It is shown that stabilized behavior cannot be destroyed by a weak noise smearing of the required parameter values. The regions where the behavior stabilization takes place are numerically estimated. Periods of the created stabile periodic orbits are calculated.


1997 ◽  
Vol 490 ◽  
Author(s):  
Misha Temkin ◽  
Ivan Chakarov

ABSTRACTA computationally efficient method for ion implantation simulation is presented. The method allows two-dimensional ion implantation profiles in arbitrary shaped structures to be calculated and is valid for both amorphous and crystalline materials. It uses an extension of the one-dimensional dual Pearson approximation into the second dimension.


1971 ◽  
Vol 12 (3) ◽  
pp. 365-377 ◽  
Author(s):  
Frank Harary

Ising [1] proposed the problem which now bears his name and solved it for the one-dimensional case only, leaving the higher dimensional cases as unsolved problems. The first solution to the two dimensional Ising problem was obtained by Onsager [6]. Onsager's method was subsequently explained more clearly by Kaufman [3]. More recently, Kac and Ward [2] discovered a simpler procedure involving determinants which is not logically complete.


Sign in / Sign up

Export Citation Format

Share Document