Application of Functional Decomposition in Synthesis of Boolean Function Sets
Document Type
Conference Proceeding
Publication Date
2008
Publication Title
Proceedings of 19th International Conference on Systems Engineering, ICSEng
Publisher
IEEE
First page number:
350
Last page number:
355
Abstract
The paper presents a new disjoint functional decomposition method for set of Boolean functions specified by separate truth tables. The functional decomposition has important applications in many fields of modern engineering and science (FPGA synthesis, information systems, neural networks and many others). The presented algorithm is dedicated to multi-output Boolean functions. The concept is based on dividing the complex multi-output function into single output functions and then utilizing common information needed by these functions to construct functional decomposition. The presented method was implemented in prototype tool and the results are presented in the paper.
Keywords
Boolean functions; Field programmable; Gate arrays; Logic circuits; Logic design; Network synthesis; Set theory; Table look-up
Disciplines
Computer Engineering | Electrical and Computer Engineering | Engineering
Language
English
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.
Repository Citation
Morawiecki, P.,
Rawski, M.,
Selvaraj, H.
(2008).
Application of Functional Decomposition in Synthesis of Boolean Function Sets.
Proceedings of 19th International Conference on Systems Engineering, ICSEng
350-355.
IEEE.
Comments
From: ICSENG '08. 19th International Conference on 19-21 Aug. 2008, Las Vegas, NV