Linear cofactor relationships in Boolean functions

Author

Zhang, Jin S. ; Chrzanowska-Jeske, Malgorzata ; Mishchenko, Alan ; Burch, Jerry R.

Author_Institution

Dept. of Electr. & Comput. Eng., Portland State Univ., OR

Volume

25

Issue

6

fYear

2006

fDate

6/1/2006 12:00:00 AM

Firstpage

1011

Lastpage

1023

Abstract

This paper describes linear cofactor relationships (LCRs), which are defined as the exclusive sums of cofactors with respect to a pair of variables in Boolean functions. These relationships subsume classical symmetries and single-variable symmetries. The paper proposes an efficient algorithm to detect LCRs and discusses their potential applications in Boolean matching, minimization of decision diagrams, synthesis of regular layout-friendly logic circuits, and detection of support-reducing bound sets

Keywords

Boolean functions; logic circuits; logic design; Boolean functions; Boolean matching; classical symmetries; decision diagrams; layout-friendly logic circuits; linear cofactor relationships; logic synthesis; single-variable symmetries; support-reducing bound sets; Binary decision diagrams; Boolean functions; Circuit synthesis; Electronic design automation and methodology; Equations; History; Input variables; Logic circuits; Merging; Minimization methods; Boolean functions; linear cofactor relationship (LCR); logic synthesis; symmetry;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/TCAD.2005.855951

Filename

1629136