NDLI: Comments on ANew Algorithm for Generating Prime Implicants

Content Provider	IEEE Xplore Digital Library
Author	Das, S.R.
Copyright Year	1968
Description	One of the major areas in switching theory research has been concerned with obtaining suitable algorithrns for the minimization of Boolean functions in connection with the general problem of their economic realization. A solution of the minimization problem, in general, involves consideration of two distinct phases. In the first phase all the prime implicants of the function are found, while in the second phase, from this set of all the prime implicants, a minimal subset (according to some criterion of minimality) of prime implicants is selected such that their disjunction is equivalent to the function and from which none of the prime implicants can be dropped without sacrificing equivalence. Many different algorithms exist for solving both the first and the second phase of this minimization problem. In a recent paper,' Slagle et al. describe a new algorithm for the generation of all the prime implicants of a Boolean function. As claimed by the authors, this algorithm is different from those previously given in the literature. The algorithm is efficient, does not generate the same prime implicant more than once (though the algorithm sometimes generates some non-prime implicants), and does not need large capacity of memory for implementation on a digital computer. The algorithm works equally well with either the conjunctive or the disjunctive (both canonical and noncanonical) form of the function.
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	1614
Ending Page	1615
Page Count	2
File Size	513567
File Format	PDF
ISSN	00189340
Volume Number	C-20
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1971-12-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
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 Method for Generating Prime Implicants of a Boolean Expression

Comments on Weighting Method for the Determination of the Irredundant Set of Prime Implicants

A Prime Implicant Algorithm with Factoring

A New Algorithm for Generating Prime Implicants

Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions

Generation of Prime Implicants by Direct Multiplication

Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification

Weighting Method for the Determination of the Irredundant Set of Prime Implicants

Comments on A Minimization Technique for TANT Networks

Comments on ANew Algorithm for Generating Prime Implicants

Similar Documents

A Method for Generating Prime Implicants of a Boolean Expression

Comments on Weighting Method for the Determination of the Irredundant Set of Prime Implicants

A Prime Implicant Algorithm with Factoring

A New Algorithm for Generating Prime Implicants

Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions

Generation of Prime Implicants by Direct Multiplication

Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification

Weighting Method for the Determination of the Irredundant Set of Prime Implicants

Comments on A Minimization Technique for TANT Networks

Comments on ANew Algorithm for Generating Prime Implicants