2002Unpublished venueRequires access

Reducing the logic-level of combinational circuits

Xianjun Zeng, Mingyan Yu, Yan Zhang, Yizheng Ye

Open publisher page 0 citations

Abstract

The Boolean function factoring method with the objective of logic-level minimization is discussed in this paper. An optimization algorithm for combinational logic circuits is proposed based on Lawler's clustering algorithm and sublogic structural transformation.

About this research paper

What this paper is about

The Boolean function factoring method with the objective of logic-level minimization is discussed in this paper. An optimization algorithm for combinational logic circuits is proposed based on Lawler's clustering algorithm and sublogic structural transformation.

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

The Boolean function factoring method with the objective of logic-level minimization is discussed in this paper. An optimization algorithm for combinational logic circuits is proposed based on Lawler's clustering algorithm and sublogic structural transformation.

Key concepts: Combinational logic, Logic optimization, Sequential logic, Logic synthesis, Computer science, Boolean circuit, Logic gate, Boolean function

Related papers

Back to paper searchBrowse research topicsOriginal source
Reducing the logic-level of combinational circuits — Research Paper | ScholarLens