Linear cofactor relationships in Boolean functions
J.S. Zhang, Malgorzata Chrzanowska-Jeske, Alina Denisovna Mishchenko, Jerry R. Burch · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2006
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