Near optimal factorization of Boolean functions

An algorithm for algebraic factorization of single-output functions is presented. The algorithm is based on the generation of some products covering a set of true cubes suitably chosen. The products forming a near-optimal factored expression are locally chosen from the ones covering each of those cu...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems Vol. 10; no. 8; pp. 1072 - 1078
Main Author: Caruso, G.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.08.1991
Institute of Electrical and Electronics Engineers
Subjects:
Applied sciences
Boolean functions
Circuit synthesis
Design automation
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Heuristic algorithms
Kernel
Logic
Circuit design
Boolean function
Heuristic approach
Algorithm
Factorization
Computer aided design
Comparative study
ISSN:0278-0070
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm for algebraic factorization of single-output functions is presented. The algorithm is based on the generation of some products covering a set of true cubes suitably chosen. The products forming a near-optimal factored expression are locally chosen from the ones covering each of those cubes. In order to obtain a good factorization, heuristics are used in the three procedures of which the method is composed. The algorithm is compared to a QUICK-FACTOR-like algorithm, using a large set of randomly generated functions. and it provides good results.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-0070
DOI:10.1109/43.85744