Publication | Closed Access
A new enhanced constructive decomposition and mapping algorithm
30
Citations
22
References
2003
Year
Unknown Venue
Mathematical ProgrammingCircuit ComplexityEngineeringBoolean FunctionComputer ArchitectureComplexity ReductionComputational ComplexityConstructive DecompositionRange SearchingSystem SynthesisFormal VerificationProprietary BenchmarksAlgorithm DesignLibrary-aware Constructive DecompositionSystems EngineeringCombinatorial OptimizationComputational GeometryComputer EngineeringComputer ScienceLogic SynthesisCircuit DesignMapping AlgorithmFormal Methods
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Library-aware constructive decomposition offers a solution to this problem. This paper proposes novel techniques to improve the quality and runtime of constructive decomposition. The improvements are effective both in the stand-alone mapping procedure and in the context of re-synthesis applied to a mapped multi-level network. Experiments with public and proprietary benchmarks show promising results.
| Year | Citations | |
|---|---|---|
Page 1
Page 1