Discrete Dynamics in Nature and Society

Discrete Dynamics in Nature and Society / 2013 / Article
Special Issue

Complex Discrete Dynamics and Its Structures in Bioinspired Systems

View this Special Issue

Research Article | Open Access

Volume 2013 |Article ID 250593 | https://doi.org/10.1155/2013/250593

I. Campos-Cantón, L. M. Torres-Treviño, E. Campos-Cantón, R. Femat, "Generation of a Reconfigurable Logical Cell Using Evolutionary Computation", Discrete Dynamics in Nature and Society, vol. 2013, Article ID 250593, 4 pages, 2013. https://doi.org/10.1155/2013/250593

Generation of a Reconfigurable Logical Cell Using Evolutionary Computation

Academic Editor: Gualberto Solís-Perales
Received26 Oct 2012
Revised12 Feb 2013
Accepted13 Feb 2013
Published21 Mar 2013


In nature, an interesting topic is about how a cell can be reconfigured in order to achieve a different task. Another interesting topic is about the learning process that seems to be a trial and error process. In this work, we present mechanisms about how to produce a reconfigurable logical cell based on the tent map. The reconfiguration is realized by modifying its internal parameters generating several logical functions in the same structure. The logical cell is built with three blocks: the initial condition generating function, the tent map, and the output function. Furthermore, we propose a reconfigurable structure based on a chaotic system and an evolutionary algorithm is used in order to tune the parameters of the cell via trial and error process.

1. Introduction

Adaptation in nature is a relevant research area that has many applications in artificial systems, which can be used for the benefit of society. Particularly in biology, a neuron can reconfigure itself to develop different tasks using the same structure; however, this procedure is a mystery. The processes of adaptation, learning, and coupling between them have been research pursuits therein, and the understanding of this processes can help to build artificial devices. The act of joining living tissue with electronics has long been imagined in the world of science fiction, but cybernetic organisms are now one step closer to reality, thanks to work emerging from researchers that have built tiny electronic meshes out of silicon nanowires and have used them as scaffolds to grow nerve, heart, and muscle tissue.

Chaotic dynamical systems are commonly used in communication systems, like the generation of pseudorandom signals, and encryption, among others. Chaotic systems are recognized by the richness of their dynamics; however, these systems could be very sensible to perturbations or a combination of an infinite number of instabilities. Chaotic systems of one dimension may generate a remarkable variety of behaviors if they are observed as a function of time due to different initial conditions or their parameters [1]. The use of one-dimensional mapping is feasible, as the logistic map for instance or the tent map, to generate logical functions [24].

Nowadays, the searching for alternative solutions in the hardware used in computational systems is a very important aspect in the area [5]; one of them is the development of reconfigurable hardware, where the chaotic circuits are candidates to perform these types of tasks [68]. As expected, the chaotic elements might generate different logical functions, with reconfiguration capabilities [9, 10]. Other alternatives consist of architectures that use programmable gates circuits (FPGA's), whose configuration is made by rewiring multiple static gates of single purpose; that is, a single logic gate has a fixed configuration. In this work, a tent map 1 is used to build a reconfigurable cell that generates different logical basic functions where an evolutionary algorithm is used to adjust its parameters [1113].

Evolutionary computation is a paradigm inspired by the natural selection theory proposed by Charles Darwin, where several evolutionary processes can be accounted for in computing including three of them in the developing of an evolutionary algorithm: the fitness assignation, the inclusion of diversity, and the selection of more fitted individuals that can reproduce and have offspring. In evolutionary computation the same process that occurs in nature is emulated, but in a simple way. Genetic algorithms, genetic programming, and estimation of distribution algorithms are examples of this kind of algorithms [11, 12]. In this work, an easy implementation of an estimation of distribution algorithm called Evonorm [13] is used for tuning the parameters of the reconfigurable logic cell. This counts as the actual way for tuning the parameters usually made by trial and error process. Using this algorithm generated all the sixteen logic functions considering two inputs.

Although previous paragraphs seem to be uncorrelated, the possibility of designing reconfigurable logic cells by electronic circuits allows one (i) to explain how a same structure of artificial systems (circuits) can be reconfigured to develop different tasks; (ii) to incorporate chaotic dynamics as the basis of reconfiguration at the artificial systems (circuits); (iii) to define alternative architectures, distinct from FPGA's, such that the reconfiguration goes beyond rewiring; and (iv) to exploit evolutionary computation towards the optimization of parameters in the reconfiguration process. The main contribution of this paper is on a reconfigurable logic cell. This reconfigurable logic cell can represent several logical functions, all in the same structure changing specific parameters. The setting of these parameters is made by an evolutionary algorithm. In Section 2, a reconfigurable logic cell is presented. In Section 3, the Evonorm evolutionary algorithm is described and used to set the parameters of reconfigurable logic cell proposed. In Section 4, the proposal architecture is used to generate different logical functions. Conclusion and future work are given in the last section.

2. Reconfigurable Dynamical Logic Cell

In our proposal, the reconfigurable logical cell is constituted by an architecture consisting of three blocks: (i) a generator of initial conditions, (ii) a tent map, and (iii) an output block. Each block obeys the following:(i)the initial condition of the reconfigurable logic cell is defined by the following equation: where is an ignition seed, , and with ;(ii)the tent map yields the first iteration using (1); that is, (iii)the output block is a function , , generating a bistable response as follows: where is a threshold reference signal to determine the output of the system, a logical zero, or a logical one.

Figure 1 illustrates a block diagram of a reconfigurable logic cell defined by (1), (2), and (4). Considering the inputs , the reconfigurable logic cell generates 16 logic functions. Without a loss of generality, we explain two functions and (OR & AND logic gates) of these 16 whose outputs satisfy the true Table 1.


0 0 0 0
0 1 1 0
1 0 1 0
1 1 1 1

2.1. Function (OR)

For the function , the reconfigurable logical cell is tuned by considering the following parameters , , , and . These parameters satisfy the response shown in Table 2, column .

0 0 0.1 0.2 0 0
0 1 0.1 0.7 1 0
1 0 0.1 0.7 1 0
1 1 0.1 0.8 1 1

The behavior of the reconfigurable logic cell is described in what follows. If the initial condition is and inputs ,  , then and the first iteration of the tent map 1 is . Thus, the output defined by 4 is . Repeating the exercise with ,  , we have , , and . Following this way, all the possible combinations are considered with two logic inputs to get the results illustrated in column of Table 2, so the logical cell under the parameters defined above can generate the behavior of a logical function OR.

2.2. Function (AND)

For this case, the same parameter values used above are considered, except the parameter is now tuned to 0.75. Note that only one parameter is reconfigured. The output of the logic gate is shown in Table 2, column . This means that only one parameter is changed for the reconfiguration of the logical cell generating from the logical function OR to the logical function AND.

Note that the selection of the parameter values can be adjusted by trial and error but this was an exhausted task; hence, the evolutionary algorithms arise as a convenient alternative. We propound the Evonorm evolutionary algorithm to be used for the selection of the parameter values and the algorithm explained in the next section.

3. Evolutionary Computation

An important question is about the existence of an efficient way to determine the values of the parameters of the reconfigurable logic cell. In this section, we show how parameters can be tuned in order that the logical functions will be generated. Particularly, we illustrate the case of 2 inputs generating 16 outputs. An evolutionary algorithm is used to this end. Essentially, an evolutionary algorithm is used for searching solutions [11, 12]. Here we exploit it to tune the parameters of the reconfigurable logic cell. The selected evolutionary algorithm is called Evonorm [13] and is based on four items as follows: (1)representation of individuals; (2)evaluation or fitness calculation of every individual; (3)selection of the best fitted individuals; (4)generation of new individuals.

Tracking the above four items, every potential solution is represented as an individual of a population where it is assigned an evaluation value depending on its performance to solve the problem of tuning the parameters. Specifically, In Evonorm, a marginal random variable is used for yielding a new population via an estimation of a normal distribution. The implementation of the algorithm requires two matrices and three vectors. One of the two matrices is named , which represents the population of solutions, where is the number of total individuals and is the number of parameters. The other matrix is denoted as , which stores selected individuals, where is the number of selected individuals, usually ten percent of the total population. The vector stores the evaluation value per individual. The vectors and are used for storing the mean and standard deviation, respectively, of the random variable used per parameter. The above definitions correspond to the first item of evolutionary algorithm Evonorm. The initial population is generated randomly using a uniform distribution function.

In what follows, the Evonorm evolutionary algorithm is highlighted for determining the initial conditions of the reconfigurable logic cells. Every individual of the population is evaluated as follows.

Step 1. Evaluation and extraction of the logical cell parameters. Extraction of the parameters: , , , , and .

Step 2. Calculation of , where is a vector that represents the expected output values corresponding to every input combination in the cell. For example, the function has the following outputs that correspond to the inputs , respectively. The maximum number of outputs is considered to perform the normalization; in this example, number four is used for the normalization of the evaluation.

Step 3. Determine the evaluation as . A maximization of this function is expected.

Step 4. Selection of the most fitted individuals. This procedure sorts the individuals of matrix using the evaluation vector as a criterion. Then a selection of individuals is made for generating a new population . In this procedure is stored the best fitted individual in vector .

Step 5. Calculate the mean and the standard deviation per parameter:

Step 6. Generate a new population considering a marginal random variable with normal distribution:

is a random variable that generates numbers with a normal distribution function considering a mean and a standard deviation , precalculated previously. The approximation of a standard random variable with a normal distribution is calculated using (7), where is a random variable with normal distribution:

Steps 16 are repeated several times in cycles called generations. This algorithm is capable of adjusting the parameters of the reconfigurable logical cell and generates all the logical functions for two inputs .

4. Tuning Parameter Values by Evonorm

Evonorm algorithm is used to generate a better parametric solution for all the logic functions considering two input variables, as shown in Table 3.

0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1

The parameter values for all the logic functions with two inputs were generated by an evolutionary algorithm (Table 4). For example, the boolean function is generated by considering the parameter values , , , , and according to Table 4. The initial condition is equal to with inputs , ; so these value are used in (1) to get in the first iteration , and the output is given by (4). Repeating this process, all the outputs are generated, as illustrated in Table 4.


2 0.25 0.25 0.85 0.111
2 0.3 0.3 0.9 0.45
2 0.7 0.15 0.5 0.111
2 0.3 0.2 0.8 0.4
2 0.15 0.7 0.5 0.111
2 0.2 0.4 0.5 0.4
2 0.45 0.45 0.25 0.111
2 0.45 0.45 0.1 0.111
2 0.25 0.25 0.75 0.111
2 0.5 −0.1 0.6 0.3
2 0.1 0.25 0.5 0.111
2 −0.1 0.4 0.6 0.3
2 0.25 0.1 0.5 0.111
2 0.4 −0.1 0.6 0.3
2 0.25 0.25 0.5 0.111
2 0.25 0.25 0.2 0.111

5. Conclusion

A development of a reconfigurable logic cell based on tent map is presented. The reconfiguration is made by tuning the parameter values: , , , , and . The Evonorm algorithm is a useful tool for tuning the parameter values of the reconfigurable logic cell and generating all the 16 boolean functions of two logical inputs (remaining fixed , Table 4). As a future work, a comparison between other evolutionary algorithms and the use of reconfigurable logic cells with three or more inputs is expected.


E. Campos-Cantón acknowledges CONACYT for the financial support through Project no. 181002.


  1. E. Campos-Cantón, R. Femat, and A. N. Pisarchik, “A family of multimodal dynamic maps,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 9, pp. 3457–3462, 2011. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  2. S. Sinha and W. Ditto, “Dynamics based computation,” Physical Review Letters, vol. 81, no. 10, pp. 2156–2159, 1998. View at: Publisher Site | Google Scholar
  3. S. Sinha and W. Ditto, “Computing with distributed chaos,” Physical Review E, vol. 60, no. 1, pp. 363–377, 1999. View at: Publisher Site | Google Scholar
  4. T. Munakata, S. Sinha, and W. L. Ditto, “Chaos computing: implementation of fundamental logical gates by chaotic elements,” IEEE Transactions on Circuits and Systems I, vol. 49, no. 11, pp. 1629–1633, 2002. View at: Publisher Site | Google Scholar | MathSciNet
  5. D. Kuo, “Chaos and its computing paradigm,” IEEE Potentials, vol. 24, no. 2, pp. 13–15, 2005. View at: Publisher Site | Google Scholar
  6. K. Murali, S. Sinha, W. L. Ditto, and A. R. Bulsara, “Reliable logic circuit elements that exploit nonlinearity in the presence of a noise floor,” Physical Review Letters, vol. 102, no. 10, Article ID 104101, 4 pages, 2009. View at: Publisher Site | Google Scholar
  7. W. L. Ditto, A. Miliotis, K. Murali, S. Sinha, and M. L. Spano, “Chaogates: morphing logic gates that exploit dynamical patterns,” Chaos, vol. 20, no. 3, Article ID 037107, 7 pages, 2010. View at: Publisher Site | Google Scholar | MathSciNet
  8. K. Murali, A. Miliotis, W. L. Ditto, and S. Sinha, “Logic from nonlinear dynamical evolution,” Physics Letters A, vol. 373, no. 15, pp. 1346–1351, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  9. I. Campos-Cantón, E. Campos-Cantón, J. A. Pecina-Sanchez, and H. C. Rosu, “A simple circuit with dynamic logic architecture of basic logic gates,” International Journal of Bifurcation and Chaos, vol. 20, no. 8, pp. 2547–2551, 2010. View at: Publisher Site | Google Scholar
  10. H. Peng, Y. Yang, L. Li, and H. Luo, “Harnessing piecewise-linear systems to construct dynamic logic architecture,” Chaos, vol. 18, no. 3, Article ID 033101, 6 pages, 2008. View at: Publisher Site | Google Scholar
  11. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, MIT Press, Ann Arbor, Mich, USA, 1975. View at: MathSciNet
  12. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learnin, Addison-Wesley, New York, NY, USA, 1989.
  13. L. Torres, “Evonorm: easy and effective implementation of estimation of distribution algorithms,” in Research in Computing Science, A. Gelbuckh and S. S. Guerra, Eds., vol. 23, pp. 75–83, 2006. View at: Google Scholar

Copyright © 2013 I. Campos-Cantón et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles