Application of Functional Decomposition in Synthesis of Boolean Function Sets

Author

Morawiecki, Pawel ; Rawski, Mariusz ; Selvaraj, Henry

Author_Institution

Inst. of Comput. Sci., Kielce Univ. of Commerce, Kielce

fYear

2008

fDate

19-21 Aug. 2008

Firstpage

350

Lastpage

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 lookup; Boolean function set synthesis; FPGA synthesis; disjoint functional decomposition; information systems; multioutput Boolean function; neural networks; truth table; Application software; Boolean functions; Circuit synthesis; Data structures; Field programmable gate arrays; Input variables; Logic; Network synthesis; Systems engineering and theory; Table lookup; Functional decomposition; funtion set; logic synthesis;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems Engineering, 2008. ICSENG '08. 19th International Conference on

Conference_Location

Las Vegas, NV

Print_ISBN

978-0-7695-3331-5

Type

conf

DOI

10.1109/ICSEng.2008.65

Filename

4616662