Publication:
Complexity analysis of the cost-table approach to the design of multiple-valued logic circuits

Loading...
Thumbnail Image
Authors
Schueller, Kriss A.
Butler, Jon T.
Subjects
cost-table
cost function
logic design
minimization
multiple-valued logic
NP-complete
synthesis
Advisors
Date of Issue
1997-02
Date
February 1997
Publisher
Language
Abstract
—We analyze the computational complexity of the cost-table approach to designing multiple-valued logic circuits that is applicable to I 2 L, 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.
Type
Article
Description
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
IEEE Transactions on Computers, February 1997, pp. 205-209
Series/Report No
Department
Department of Electrical and Computer Engineering
Other Units
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Complexity analysis of the cost-table approach to the design of multiple-valued logic circuits," IEEE Transactions on Computers, February 1997, pp. 205-209
Distribution Statement
Rights
Collections