Input Variable Partitioning Method for Functional Decomposition of Functions Specified By Large Truth Tables

Document Type

Conference Proceeding

Publication Date

2008

Publication Title

International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2007

Publisher

IEEE

First page number:

164

Last page number:

168

Abstract

In this paper, a new input variable partitioning method for functional decomposition is presented. Efficiency of currently used decomposition algorithms is dependent on the size of decomposed functions. One of the crucial aspects of functional decomposition is the input variable partitioning. This synthesis method has important application in many fields of modern engineering and science. However the practical usefulness of decomposition-based methods for very complex systems is restricted by computational complexity and memory requirements of the existing algorithms. The paper presents many examples confirming that the proposed method leads to reduction in the computation time.

Keywords

Logic design

Disciplines

Computer Engineering | Electrical and Computer Engineering | Engineering

Language

English

Comments

From: Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on (Volume:2 ), 13-15 Dec. 2007, Sivakasi, Tamil Nadu

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library

Share

COinS