Practical Boolean Decomposition for Delay-driven LUT Mapping
Abstract
Ashenhurst-Curtis decomposition (ACD) is a decomposition technique used, in particular, to map combinational logic into lookup tables (LUTs) structures when synthesizing hardware designs. However, available implementations of ACD suffer from excessive complexity, search-space restrictions, and slow run time, which limit their applicability and scalability. This paper presents a novel fast and versatile technique of ACD suitable for delay optimization. We use this new formulation to compute two-level decompositions into a variable number of LUTs and enhance delay-driven LUT mapping by performing ACD on the fly. Compared to state-of-the-art technology mapping, experiments on heavily optimized benchmarks demonstrate an average delay improvement of 12.39%, and area reduction of 2.20% with affordable run time. Additionally, our method improves 4 of the best delay results in the EPFL synthesis competition without employing design-space exploration techniques.
Cite
@article{arxiv.2406.06241,
title = {Practical Boolean Decomposition for Delay-driven LUT Mapping},
author = {Alessandro Tempia Calvino and Alan Mishchenko and Giovanni De Micheli and Robert Brayton},
journal= {arXiv preprint arXiv:2406.06241},
year = {2024}
}
Comments
originally accepted at 33rd International Workshop on Logic & Synthesis 2024