This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Equational Realizations of Switching Functions
November 1975 (vol. 24 no. 11)
pp. 1054-1066
ASCII Text
x 
 
F.M. Brown, "Equational Realizations of Switching Functions," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1054-1066, November, 1975.
 
 
BibTex
x
 
@article{ 10.1109/T-C.1975.224133,
author = {F.M. Brown},
title = {Equational Realizations of Switching Functions},
journal ={IEEE Transactions on Computers},
volume = {24},
number = {11},
issn = {0018-9340},
year = {1975},
pages = {1054-1066},
doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224133},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Equational Realizations of Switching Functions
IS - 11
SN - 0018-9340
SP1054
EP1066
EPD - 1054-1066
A1 - F.M. Brown,
PY - 1975
KW - Boolean equations
KW - Boolean matrices
KW - combinational logic
KW - digital comparators
KW - functional decomposition.
VL - 24
JA - IEEE Transactions on Computers
ER -
 
F.M. Brown, Department of Electrical Engineering, University of Kentucky
Equational logic is an approach to combinational synthesis based on the equation f(x) = 1 rather than on the function f(x). The central problem of equational logic is to find a system of equations gi(x) = hi(x) (i = 1,2,...,k), of the simplest possible form, that has the same solutions as f(x) = 1. Given such a k-equation system, f(x) may be realized as the output of a k-wide
Index Terms:
Boolean equations, Boolean matrices, combinational logic, digital comparators, functional decomposition.
Citation:
F.M. Brown, "Equational Realizations of Switching Functions," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1054-1066, Nov. 1975, doi:10.1109/T-C.1975.224133
Usage of this product signifies your acceptance of the Terms of Use.