A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions

Author

Falkowski, Bogdan J. ; Schäfer, Ingo ; Perkowski, Marek A.

Author_Institution

Dept. of Electr. Eng., Portland State Univ., OR, USA

fYear

1990

fDate

12-14 Aug 1990

Firstpage

1119

Abstract

An algorithm is presented that generates an array of disjoint cubes describing completely and incompletely specified Boolean functions. A peculiar feature of the algorithm, which speeds up its execution, is that in comparison to known algorithms it minimizes the number of usages of cube calculus operations. Pointer structures and array allocations of the C language are effectively used in its implementation

Keywords

Boolean functions; logic design; mathematics computing; Boolean functions; C language; array allocations; completely specified functions; disjoint cubes array; disjoint cubes generation; fast computer algorithm; incompletely specified functions; Algorithm design and analysis; Boolean functions; Calculus; Data preprocessing; Logic arrays; Logic design;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on

Conference_Location

Calgary, Alta.

Print_ISBN

0-7803-0081-5

Type

conf

DOI

10.1109/MWSCAS.1990.140922

Filename

140922

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2831404