Algorithms for partitioning logical circuits into subcircuits-Reference-Cited by-同舟云学术

Algorithms for partitioning logical circuits into subcircuits

Published:2020-09-30 Issue:3 Volume:17 Page:54-63
ISSN:2617-6963
Container-title:Informatics
language:
Short-container-title:Informatika (Minsk)

Author:

Kirienko N. A.¹

Affiliation:

1. The United Institute of Informatics Problems of the National Academy of Sciences of Belarus

Abstract

The problem of partitioning a logical circuit into subcircuits is considered. It is of great importance when performing optimization transformations in the process of circuit synthesis. The brief review of partitioning methods and algorithms is given, and two groups of algorithms are identified: constructive and iterative one. The interpretation of a logical circuit in the form of a graph is presented. The problem of partitioning in terms of a graph-theoretic model is defined and some algorithms for solving the partitioning problem are proposed. Logic circuit functions are defined by a system of logical equations. Algorithms perform the partitioning the system of logical equations into subsystems with the restrictions of the number of input and output variables. The data structures to execute the algorithms are defined. Various types of equations connections, obtaining better solutions for partitioning are described. The problems of the use of partitioning algorithms to improve the quality of the circuit at the stage of technology-independent optimization are investigated. The results of an experimental study carried out by the BDD optimization procedure for the functional description of the circuit and LeonardoSpectrum synthesis confirm the effectiveness of the developed algorithms. The algorithms are implemented as partitioning circuit procedures in the experimental FLC system for logical design.

Publisher

United Institute of Informatics Problems of the National Academy of Sciences of Belarus

Subject

General Earth and Planetary Sciences,General Environmental Science

Reference16 articles.

1. Rabaey Jan M. Digital Integrated Circuits: A Design Perspective. Prentice Hall, 1995, 702 p.

2. Alpert C. J., Mehta D. P., Sapatnekar S. S. (eds.). Partitioning-based methods. Handbook of Algorithms for Physical design Automation. CRC Press, 2009, pp. 290–308.

3. Kahng A. B., Liening J., Markov I. L., Hu J. Global and detailed placement. VLSI physical design: Graph Partitioning to Timing Closure. Springer, 2011, pp. 95–122.

4. Bibilo P., Kirienko N. Block synthesis of combinational circuits. Design of Embedded Control Systems. Springer, 2004, pp. 189–196.

5. Bazilevich R. P., Shcherbyuk I. F. Algoritmicheskie i programmnye sredstva dlya razmeshcheniya raznogabaritnyh elementov na konstruktive [Algorithmic and software tools for placing oversized elements on a construct]. Avtomatizaciya proektirovaniya diskretnyh sistem: materialy Shestoy Mezhdunarodnoj konferencii [Computer-Aided Design of Discrete Devices: Proceedings of the Sixth International Conference]. Minsk, The United Institute of Informatics Problems of the National Academy of Sciences of Belarus, 2007, pp. 157–164 (in Russian).