Electronic Resource
Springer
International journal of parallel programming
6 (1977), S. 151-163
ISSN:
1573-7640
Keywords:
Switching theory
;
logic design
;
combinational circuits
;
Boolean algebra
;
circuit simplication
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract A new notation for a NAND operator is proposed, based on the prefix Polish notation following the style of Lukasiewicz. There is a direct one-to-one correspondence between the operators in the resulting system and gates in a circuit realization if identical subfunctions are recognized. An axiom set for the Boolean algebra based on this operator is given, and the axiomatic derivation of the algebra is demonstrated. A number of results concerning circuit manipulation, redundant sets of gate inputs, and necessary and sufficient conditions for the relocation of certain gate inputs are presented, and their use demonstrated by a number of examples.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00999303
Permalink
|
Location |
Call Number |
Expected |
Availability |
