Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC-Reference-Cited by-同舟云学术

Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC

Published:2024-03-29 Issue:1 Volume:21 Page:28-47
ISSN:2617-6963
Container-title:Informatics
language:
Short-container-title:Informatika (Minsk)

Author:

Bibilo P. N.¹,Kardash S. N.¹

Affiliation:

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

Abstract

Objectives. The problem of choosing the best methods and programs for circuit implementation as part of digital ASIC (Application-Specific Integrated Circuit) sparse systems of disjunctive normal forms (DNF) of completely defined Boolean functions is considered. For matrix forms of sparse DNF systems, the ternary matrix specifying elementary conjunctions contains a large proportion of undefined values corresponding to missing literals of Boolean input variables, and the Boolean matrix specifying the occurrences of conjunctions in DNF functions contains a large proportion of zero values.Methods. It is proposed to investigate various methods of technologically independent logical optimization performed at the first stage of logical synthesis: joint minimization of systems of functions in the DNF class, separate and joint minimization in classes of multilevel representations in the form of Boolean networks and BDD representations using mutually inverse cofactors, as well as the division of a system of functions into subsystems with a limited number of input variables and the method of block cover of DNF systems, focused on minimizing the total area of the blocks forming the cover.Results. When implementing sparse DNF systems of Boolean functions in ASIC, along with traditional methods of joint minimization of systems of functions in the DNF class, methods for optimizing multilevel representations of Boolean function systems based on Shannon expansions can be used for technologically independent optimization, while separate minimization and joint minimization of the entire system as a whole turn out to be less effective compared with block partitions and coatings of the DNF system and subsequent minimization of multilevel representations. Schemes obtained as a result of synthesis using minimized representations of Boolean networks often have a smaller area than schemes obtained using minimized BDD representations.Conclusion. For the design of digital ASIC, the effectiveness of combined approach is shown, when initially the block coverage programs of the DNF system is used, followed by the use of programs to minimize multilevel block representations in the form of Boolean networks minimized based on Shannon expansion.

Publisher

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

Reference32 articles.

1. Tarasov I. E. PLIS Xilinx. Yazyki opisaniya apparatury VHDL i Verilog, SAPR, priemy proektirovaniya. XILINX FPGA. Hardware Description Languages VHDL and Verilog, CAD, Design Techniques. Moscow, Goryachaya liniya – Telekom, 2020, 538 р. (In Russ.).

2. Zakrevskij A. D. Logicheskij sintez kaskadnyh skhem. Logical Synthesis of Cascading Circuit. Moscow, Nauka, 1981, 416 р. (In Russ.).

3. Brayton K. R., Hachtel G. D., McMullen C., Sangiovanni-Vincentelli A. L. Logic Minimization Algorithm for VLSI Synthesis. Boston, Kluwer Academic Publishers, 1984, 193 p.

4. Zakrevskij A. D. (ed.). Sintez asinhronnyh avtomatov na EHVM. Synthesis of Asynchronous Automata on a Computer. Minsk, Nauka i tekhnika, 1975, 184 р. (In Russ.).

5. Brayton R. K., McMullen C. T. The decomposition and factorization of Boolean expressions. Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS 1982), Rome, Italy, 10–12 May 1982. Rome, 1982, pp. 49–54.