Combinational and sequential mapping with priority cuts

An algorithm for technology mapping of combinational and sequential logic networks is proposed and applied to mapping into K-input lookup-tables (K-LUTs). The new algorithm avoids the hurdle of computing all K-input cuts while preserving the quality of the results, in terms of area and depth. The memory and runtime of the proposed algorithm are linear in circuit size and quite affordable even for large industrial designs. For example, computing a good quality 6-LUT mapping of an AIG with 1M nodes takes 150Mb of RAM and 1 minute on a typical laptop. An extension of the algorithm allows for sequential mapping, which searches the combined space of all possible mappings and retimings. This leads to an 18-22% improvement in depth with a 3-5% LUT count penalty, compared to combinational mapping followed by retiming.

• Type: Conference
• Year: 2007
• Where: ICCAD
• Authors: Alan Mishchenko, Sungmin Cho, Satrajit Chatterjee, Robert K. Brayton
• Keywords: Combinational Mapping, Hardware, ICCAD 2007, Quality 6-LUT Mapping, Sequential Mapping