DocumentCode :
1577545
Title :
Graphical preprocessing of orderings used in disjunctive decomposition detection
Author :
Ngwira, SM
Author_Institution :
Dept. of Phys. & Electron Eng., Univ. of Swaziland, Swaziland
Volume :
1
fYear :
1999
fDate :
6/21/1905 12:00:00 AM
Firstpage :
575
Abstract :
A graphical analysis is presented to predict the input variable subsets that give efficient disjunctive decompositions of complex combinatorial logic functions. The subsets obtained match substantially with the optimum orderings from an exhaustive search for disjunctive decompositions, thus, the technique can serve as a preprocessor before exhaustive search algorithms
Keywords :
search problems; switching functions; complex combinatorial logic functions; disjunctive decomposition detection; exhaustive search algorithms; graphical analysis; input variable subsets; optimum orderings; Algorithm design and analysis; Computer architecture; Data preprocessing; Input variables; Logic functions; Partitioning algorithms; Physics; Samarium; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Africon, 1999 IEEE
Conference_Location :
Cape Town
Print_ISBN :
0-7803-5546-6
Type :
conf
DOI :
10.1109/AFRCON.1999.820973
Filename :
820973
Link To Document :
بازگشت