ScholarLens Back to search
2001•Journal of Nantong Institute of TechnologyRequires access

The 0ptimal Design of Boolean Circuits In Integrated Circuit

Zhijin Guan

Open publisher page 0 citations

Abstract

Binary decision diagrams (BDDs) are representations of Boolean functions. It is widely used in the synthesis simulation and testing of Boolean circuits. In all these applications of BDD's, solutions to some fundamental computational problems are needed. We present a method for the transference from Boolean circuits into BDDs. We exp1ain the program in two parts: transference for fanout free circuit and then for circuits with fanout points. Final1y we combine both into a general algorithm.

About this research paper

What this paper is about

Binary decision diagrams (BDDs) are representations of Boolean functions. It is widely used in the synthesis simulation and testing of Boolean circuits. In all these applications of BDD's, solutions to some fundamental computational problems are needed. We present a method for the transference from Boolean circuits into BDDs. We exp1ain the program in two parts: transference for fanout free circuit and then for circuits with fanout points. Final1y we combine both into a general algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Binary decision diagrams (BDDs) are representations of Boolean functions. It is widely used in the synthesis simulation and testing of Boolean circuits. In all these applications of BDD's, solutions to some fundamental computational problems are needed. We present a method for the transference from Boolean circuits into BDDs. We exp1ain the program in two parts: transference for fanout free circuit and then for circuits with fanout points. Final1y we combine both into a general algorithm.

Key concepts: Binary decision diagram, Boolean function, Circuit minimization for Boolean functions, Boolean circuit, Boolean expression, Electronic circuit, Computer science, And-inverter graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The 0ptimal Design of Boolean Circuits In Integrated Circuit — Research Paper | ScholarLens