This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complexity Analysis of the Cost-Table Approach to the Design of Multiple-Valued Logic Circuits
February 1997 (vol. 46 no. 2)
pp. 205-209
ASCII Text
x 
 
Kriss A. Schueller, Jon T. Butler, "Complexity Analysis of the Cost-Table Approach to the Design of Multiple-Valued Logic Circuits," IEEE Transactions on Computers, vol. 46, no. 2, pp. 205-209, February, 1997.
 
 
BibTex
x
 
@article{ 10.1109/12.565599,
author = {Kriss A. Schueller and Jon T. Butler},
title = {Complexity Analysis of the Cost-Table Approach to the Design of Multiple-Valued Logic Circuits},
journal ={IEEE Transactions on Computers},
volume = {46},
number = {2},
issn = {0018-9340},
year = {1997},
pages = {205-209},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.565599},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Complexity Analysis of the Cost-Table Approach to the Design of Multiple-Valued Logic Circuits
IS - 2
SN - 0018-9340
SP205
EP209
EPD - 205-209
A1 - Kriss A. Schueller,
A1 - Jon T. Butler,
PY - 1997
KW - Computational complexity
KW - cost-table
KW - cost function
KW - logic design
KW - minimization
KW - multiple-valued logic
KW - NP-complete
KW - synthesis.
VL - 46
JA - IEEE Transactions on Computers
ER -
 

Abstract—We analyze the computational complexity of the cost-table approach to designing multiple-valued logic circuits that is applicable to I2L, CCDs, current-mode CMOS, and RTDs. We show that this approach is NP-complete. An efficient algorithm is shown for finding the exact minimal realization of a given function by a given cost-table.

[1] M.H. Abd-El-Barr, Z.G. Vranwsic, and S.C. Zaky, "Algorithmic Synthesis of MVL Functions for CCD Implementations," IEEE Trans. Computers, vol. 40, no. 8, pp. 977-986, Aug. 1991.
[2] J.F. Gimpel, "A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table," IEEE Trans. Electronic Computers, vol. 14, no. 6, pp. 485-488, June 1965.
[3] R.M. Karp, "Reducibility Among Combinatorial Problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85-103. Plenum Press, 1972.
[4] K. Keutzer and D. Richards, "Computational Complexity of Logic Synthesis and Optimization," Proc. Int'l Workshop Logic Synthesis, pp. 1-15, May 1989.
[5] H.G. Kerkhoff and M.L. Tervoert, "Multiple-Valued Logic Charge Coupled Devices," IEEE Trans. Computers, vol. 30, no. 9, pp. 644-652, Sept. 1981.
[6] H.G. Kerkhoff and H.A.J. Robroek, "The Logic Design of Multiple-Valued Logic Functions Using Charge-Coupled Devices," Proc. 12th Int'l Symp. Multiple-Valued Logic, pp. 35-44, May 1982.
[7] K.A. Schueller and J.T. Butler, "On the Design of Cost-Tables for Realizing Multiple-Valued Circuits," IEEE Trans. Computers, vol. 41, no. 2, pp. 178-189, Feb. 1992.

Index Terms:
Computational complexity, cost-table, cost function, logic design, minimization, multiple-valued logic, NP-complete, synthesis.
Citation:
Kriss A. Schueller, Jon T. Butler, "Complexity Analysis of the Cost-Table Approach to the Design of Multiple-Valued Logic Circuits," IEEE Transactions on Computers, vol. 46, no. 2, pp. 205-209, Feb. 1997, doi:10.1109/12.565599
Usage of this product signifies your acceptance of the Terms of Use.