z-logo
open-access-imgOpen Access
The Synthesis of Logical Nets Consisting of NOR Units
Author(s) -
H. P. Williams
Publication year - 1968
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/11.2.173
Subject(s) - truth table , computer science , table (database) , computation , function (biology) , net (polyhedron) , algorithm , arithmetic , logical conjunction , theoretical computer science , mathematics , programming language , data mining , geometry , evolutionary biology , biology
This paper describes an algorithm for synthesising a logical net consisting of NOR units. Starting with a logical function presented as a truth table the function is converted into a succession of NOR statements. A simplifying procedure is used which, while not always resulting in the minimum number of NOR units, produces an economical solution. Details are given of how this algorithm can be programmed for automatic computation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom