DocumentCode :
1109807
Title :
Minimal Negative Gate Networks
Author :
Nakamura, Keijiro ; Tokura, Nobuki ; Kasami, Tadao
Author_Institution :
Faculty of Marcantile Marine, Kobe University of Marcantile Marine
Issue :
1
fYear :
1972
Firstpage :
5
Lastpage :
11
Abstract :
A negative gate is a gate that can realize an arbitrary negative function (or monotone decreasing function) and a positive gate is one that can realize an arbitrary positive function (or monotone increasing function). This paper discusses methods of realizing a given logical function or a given set of logical functions using a minimum number of negative gates alone or using a minimum number of negative and positive gates.
Keywords :
Inversion complexity, minimal decomposition, minimal negative gate network, monotone function, negative function, positive function.; Cities and towns; Hamming distance; Upper bound; Inversion complexity, minimal decomposition, minimal negative gate network, monotone function, negative function, positive function.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1972.223425
Filename :
1672018
Link To Document :
بازگشت