Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation

Authors:
Venkatesan Muthukumar;Henry Selvaraj
Affiliations:
-;-
Venue:
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Year:
2003

Citing 7
Cited 0

A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping

EURO-DAC '92 Proceedings of the conference on European design automation
BDD based decomposition of logic functions with application to FPGA synthesis

DAC '93 Proceedings of the 30th international Design Automation Conference
An Input-Output Encoding Approach for Serial Decomposition

SBCCI '00 Proceedings of the 13th symposium on Integrated circuits and systems design
Functional Decomposition for FPGA Based Designs: A Weighted Graph Approach for Encoding of Compatible Classes

ICCIMA '99 Proceedings of the 3rd International Conference on Computational Intelligence and Multimedia Applications
Information Relationships and Measures in Application to Logic Design

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
An Efficient Approach to Decomposition of Multi-Output Boolean Functions with Large Sets of Bound Variables

EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
An Algorithm for the Disjunctive Decomposition of Switching Functions

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional decomposition is a process of splitting a complexcircuit into smaller sub-circuits. This paper deals withthe problem of determining the set of best free and boundvariables (variable partitioning problem) for disjoint (disjointserial) decomposition, such that the decomposed circuitsare smaller in size and its truth table representationhave maximal don't cares. A novel pruned breadth firstsearch (PBFS/IPBFS) approach is proposed to determinethe set of good variable partitions with minimal time andcomputational complexity. The heuristics proposed minimizethe size of the sub-functions. The proposed approachhas been successfully implemented and test with MCNC andEspresso benchmarks.