|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
February 1987 (vol. 36 no. 2)
pp. 157-166
| ASCII Text | x | ||
| null Hung Chi Lai, S. Muroga, "Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables," IEEE Transactions on Computers, vol. 36, no. 2, pp. 157-166, February, 1987. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1987.1676878, author = {null Hung Chi Lai and S. Muroga}, title = {Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables}, journal ={IEEE Transactions on Computers}, volume = {36}, number = {2}, issn = {0018-9340}, year = {1987}, pages = {157-166}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676878}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables IS - 2 SN - 0018-9340 SP157 EP166 EPD - 157-166 A1 - null Hung Chi Lai, A1 - S. Muroga, PY - 1987 KW - single-rail input logic KW - Integer programming KW - logic design KW - minimum networks KW - NAND gates KW - NOR gates KW - parity function VL - 36 JA - IEEE Transactions on Computers ER - | |||
Design of logic networks, in single-rail input logic, with a minimum number of NOR gates for parity functions of an arbitrary number of variables is described. This is partly based on minimum networks for parity functions of a small number of variables which are designed by the integer programming logic design method. Although it is generally difficult to design minimum networks for functions of an arbitrarily large number of variables, we have previously designed minimum networks for adders of an arbitrary number of variables. The minimum networks for parity functions of an arbitrary number of variables discussed in this paper is another case. Many unique properties of minimum NOR networks for parity functions are shown. Minimum networks with NAND gates for parity functions can be easily obtained from those with NOR gates because of duality relationship between NAND and NOR.
Index Terms:
single-rail input logic, Integer programming, logic design, minimum networks, NAND gates, NOR gates, parity function
Citation:
null Hung Chi Lai, S. Muroga, "Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables," IEEE Transactions on Computers, vol. 36, no. 2, pp. 157-166, Feb. 1987, doi:10.1109/TC.1987.1676878
Usage of this product signifies your acceptance of the Terms of Use.

