Open Access Open Access  Restricted Access Subscription or Fee Access

Implementation of Simulated Annealing Strategies for the Initialization Sequences Construction of Digital Circuits

R. Zouaoui, N. Khalfaoui

Abstract


In this paper we propose a new algorithm for the construction of initialization sequences of synchronous sequential circuits. To resolve this problem we are encouraged to use a new optimization strategy which is "simulated annealing». For this we used the methods of technical analysis, the theory of Boolean functions, the switching circuits and their modeling logic, automata and evolutionary computation methods. Essentially in our work we use the model of synchronous sequential circuits, in which we allocate a combinational block and a block of the state of the elements represented by D-triggers. In the construction of evaluation functions we use the task of modeling a circuit intact or defective. This is done by breaking the return lines (feedback) and using a model of the equivalent iterative combinatorial. The advantage of this strategy, unlike the deterministic methods, is the ability of working with large circuits. The result of our work is summarized in two points: the study of simulated annealing algorithm to use to identify problems in the construction of initialization sequences and the development of a single-level algorithm for the simulation of annealing and construction of initialization sequences by checking their equivalence.

Keywords


Algorithm, Cost Function, Digital Circuits, Genetic Algorithm, Initialization Sequences, Sequential Circuits, Simulated Annealing, Synchronous Circuits.

Full Text:

PDF

References


С. Pixley, S. Jeong, G. Hatchel, “Exact Calculation of Synchronization Sequences based on Binary Decision Diagrams”, IEEE Trans. on CAD, Vol.13, pp.1024-1034, 1994.

J.-K. Rho, F. Somenzi, C. Pixley, “Minimum Length Synchronizing Sequences of Finite State Mashine”, Proc. ACM Design Automation Conf., 1993, pp.463-468.

J.A. Wehbeh, D.G. Saab, “Initialization of Sequential Circuits and its Application to ATPG,”, Proc. IEEE VLSI Test Symp., 1996, pp. 246-251.

R.E. Bryant “Symbolic Boolean Manipulatuion with Ordered Binary Decision Diagrams”, ACM Computing Surveys, Vol.24, Nr 3, 1992, pp. 293-318.

M. Keim, B. Becker, B. Stenner, “On the (Non-)Resettability of Synchronous Sequential Circuits,” Proc. IEEE VLSI Test Symp., 1996, pp. 240-245.

P. Camurati, F. Corno, P. Prinetto, M. Sonza Reorda, “A simulation-based approach yo test pattern generation for synchronous circuits”, Proc. IEEE VLSI Test Symposium, 1992, pp.263-267.

V.D. Agrawal, K.-T. Cheng, P. Agrawal, “CONTEST: A concurrent Test Generator for Sequential Circuits”, Proc. 25-th Design Automation Conference, 1988, pp.84-89.

P. Prinetto, M. Rebaudengo, M. Sonza Reorda, "An Automatic Test Pattern Generator for Large Sequential Circuits based on Genetic Algorithms" In Proc. Int. Test Conf., 1994, pp. 240-249.

E.A Ivanov, YA Ckobtsov, A.I EL-Khatib, “The construction of initialization sequences for synchronous digital circuits using genetic algorithms. The problems of information technologies”. -2007. – N° pp. 158-1. -164.

AC Barashkov, YA Skobtsov, DV Speransky. "Modeling and testing of discrete devices.” – Kiev: Scientific, 1992. – Pp.288.

N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, “Equation of State Calculation by Fast Computing Mashines”, J. of Chem.Phys., Vol.21, No.6, pp.1087-1092, 1953.

S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, “Optimization by simulating annealing”, Science, 220, pp.671-680, 1983.

Y.A Ckobtsov. "The principles of calculating the evolution." - Donetsk: DonNTU, 2008. - Pp.326.

E.A Ivanov, Y.A Ckobtsov. "System modeling and test generation of digital circuits / / Research Center Donetsk National Technical University-series"technical computing and automation," Issue 12. - Donetsk. - 1999. - Pp.143-150.


Refbacks

  • There are currently no refbacks.