NDLI: Boolean functions classification via fixed polarity Reed-Muller forms

Content Provider	IEEE Xplore Digital Library
Author	Chien-Chung Tsai Marek-Sadowska, M.
Copyright Year	1968
Abstract	In this paper, we present a new method to characterize completely specified Boolean functions. The central theme of the classification is the functional equivalence (a.k.a. Boolean matching). Two Boolean functions are equivalent if there exists input permutation, input negation, or output negation that can transform one function to the other. We have derived a method that can efficiently identify equivalence classes of Boolean functions. The well-known canonical Fixed Polarity Reed-Muller (FPRM) forms are used as a powerful analysis tool. The necessary transformations to derive one function from the other are inherent in the FPRM representations. To identify uniquely each equivalence class, a set of well-known characteristics of Boolean functions and their variables (including linearity, symmetry, total symmetry, self-complement, and self-duality) are employed. It is shown that all the equivalence classes of four-variable functions are uniquely identified where majority of the classes have a single FPRM form as their representative. The Boolean matching has applications in technology mapping and in design of standard cell libraries.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	173
Ending Page	186
Page Count	14
File Size	192226
File Format	PDF
ISSN	00189340
Volume Number	46
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Boolean functions Libraries Field programmable gate arrays Circuit synthesis Network synthesis Logic Inverters Computer Society Linearity Application software
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A comment on Boolean functions classification via fixed polarity Reed-Muller form

Fast OFDD-based minimization of fixed polarity Reed-Muller expressions

A multiple-valued Reed-Muller transform for incompletely specified functions

Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions

Multiple-valued generalized Reed-Muller forms

Technology mapping of mixed polarity Reed-Muller representations

Synthesis of highly testable fixed-polarity AND-XOR canonical networks-A genetic algorithm-based approach

POA-FPRMs: Power Optimization Approach of Fixed Polarity Reed-Muller Expressions for Incompletely Specified Boolean Functions

A fast algorithm for multi-level mixed-polarity Reed-Muller functions optimization

Boolean functions classification via fixed polarity Reed-Muller forms

Similar Documents

A comment on Boolean functions classification via fixed polarity Reed-Muller form

Fast OFDD-based minimization of fixed polarity Reed-Muller expressions

A multiple-valued Reed-Muller transform for incompletely specified functions

Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions

Multiple-valued generalized Reed-Muller forms

Technology mapping of mixed polarity Reed-Muller representations

Synthesis of highly testable fixed-polarity AND-XOR canonical networks-A genetic algorithm-based approach

POA-FPRMs: Power Optimization Approach of Fixed Polarity Reed-Muller Expressions for Incompletely Specified Boolean Functions

A fast algorithm for multi-level mixed-polarity Reed-Muller functions optimization

Boolean functions classification via fixed polarity Reed-Muller forms