This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization by the D Algorithm
May 1986 (vol. 35 no. 5)
pp. 476-478
ASCII Text
x 
 
J.P. Roth, "Minimization by the D Algorithm," IEEE Transactions on Computers, vol. 35, no. 5, pp. 476-478, May, 1986.
 
 
BibTex
x
 
@article{ 10.1109/TC.1986.1676790,
author = {J.P. Roth},
title = {Minimization by the D Algorithm},
journal ={IEEE Transactions on Computers},
volume = {35},
number = {5},
issn = {0018-9340},
year = {1986},
pages = {476-478},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676790},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Minimization by the D Algorithm
IS - 5
SN - 0018-9340
SP476
EP478
EPD - 476-478
A1 - J.P. Roth,
PY - 1986
KW - PLA
KW - D algorithm
KW - logic
KW - minimization
VL - 35
JA - IEEE Transactions on Computers
ER -
 
J.P. Roth, IBM Thomas J. Watson Research Center
Programmed logic arrays [1], [2] are common in computer design. A form of this method of design has been used since the beginnings of computers, in telephone relay networks [3]. Optimization of such realizations of functions were begun by Karnaugh [4], Quine [5], McCluskey [6], and Roth [7]. Substantial use was mnade of such programs by Preiss [8] and Perlman [9]. Despite the existence of exact procedures, "fast," "approximate" procedures have been widely used. A new approximate procedure, using the D algorithm [1], [10], [11] is introduced here. It gets around a large computation, in complementation, using prior methods. Running programs "verify" this expectation.
Index Terms:
PLA, D algorithm, logic, minimization
Citation:
J.P. Roth, "Minimization by the D Algorithm," IEEE Transactions on Computers, vol. 35, no. 5, pp. 476-478, May 1986, doi:10.1109/TC.1986.1676790
Usage of this product signifies your acceptance of the Terms of Use.