Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 3, Issue 3-4, Pages 289-300
http://dx.doi.org/10.1155/1995/67208

A General Approach to Boolean Function Decomposition and its Application in FPGABased Synthesis

Warsaw University of Technology, Institute of Telecommunications, Nowowiejska 15/19, Warsaw 00-665, Poland

Copyright © 1995 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

An effective logic synthesis procedure based on parallel and serial decomposition of a Boolean function is presented in this paper. The decomposition, carried out as the very first step of the .synthesis process, is based on an original representation of the function by a set of r-partitions over the set of minterms. Two different decomposition strategies, namely serial and parallel, are exploited by striking a balance between the two ideas. The presented procedure can be applied to completely or incompletely specified, single- or multiple-output functions and is suitable for different types of FPGAs including XILINX, ACTEL and ALGOTRONIX devices. The results of the benchmark experiments presented in the paper show that, in several cases, our method produces circuits of significantly reduced complexity compared to the solutions reported in the literature.