Abstract
We present a systematic procedure to synthesise and minimise digital circuits using propositional satisfiability. After encoding the truth table into a canonical sum of at most k different products, we seek its minimal satisfiable representation. We show how to use an interesting local search landscape for this minimisation. This approach can be very useful since we can generate exact minimal solutions within reasonably computational resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. Brayton, G. D. Hachtel, C. T. McMullen, A. L. Sangiovanni-Vincentelli: Logic minimization algorithms for VLSI synthesis, Kluwer, 1984.
R. K. Brayton, R. Rudell, A. L. Sangiovanni-Vincentelli, A. R. Wang: MIS: A multiple-level logic optimization system. IEEE Trans. on Computer Aided Design, vol. 6(6), pp. 1062–1081, 1987.
C. A. Coello, R. L. Zavala, B. Mendoza, A. Hernandez: Automated Design of Combinational Logic Circuits using the Ant System. Engineering Optimization, vol. 34(2), pp. 109–127, 2002.
C. A. Coello, A. Hernandez: Design of Combinational Logic Circuits through an Evolutionary Multiobjective Optimization Approach. Artificial Intelligence for Engineering, Design, Analysis and Manufacture, vol. 16(1), 2002.
T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe: A probabilistic 3-SAT algorithm further improved. Proc. of the STACS, Springer-Verlag LNCS 2285, pp. 192–202, March, 2002.
T. Kalganova: Evolvable Hardware Design for Combinational Logic Circuits, PhD thesis, School of Computing, Napier University, UK, 2000.
A. Kamath, N. Karmarkar, K. Ramakrishnan, M. Resende: A continuous approach to inductive inference. Mathematical programming, vol. 57, pp. 215–238, 1992.
A. Kamath, N. Karmarkar, K. Ramakrishnan, M. Resende: An interior point approach to boolean vector function synthesis. Proc. of the MSCAS, pp. 185–189, 1993.
C. M. Li: Integrating Equivalency reasoning into Davis-Putnam procedure. Proc. of the AAAI, pp. 291–296, 2000.
J. F. Miller, D. Job, V. K. Vassilev: Principles in the evolutionary design of digital circuits—Part I. Genetic programming and evolvable machines, vol 1(1/2), pp. 7–35, 2000.
B. Selman, H. Levesque, D. Mitchell: A New Method for Solving Hard Satisfiability Problems. Proc. of the AAAI, pp. 440–446, 1992.
B. Selman, H. Kautz, B. Cohen: Local Search Strategies for Satisfiability Testing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. David S. Johnson and Michael A. Trick, ed. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, AMS, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estrada, G.G. (2003). A Note on Designing Logical Circuits Using SAT. In: Tyrrell, A.M., Haddow, P.C., Torresen, J. (eds) Evolvable Systems: From Biology to Hardware. ICES 2003. Lecture Notes in Computer Science, vol 2606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36553-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-36553-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00730-2
Online ISBN: 978-3-540-36553-2
eBook Packages: Springer Book Archive