Technology Mapping with Choices, Priority Cuts, and Placement-Aware Heuristics

Alan Mishchenko - Dept. of EECS, University of California, Berkeley, USA

Data e ora
martedì 18 maggio 2010 alle ore 16.45 - Ore 16.45 caffe' e pasticcini, ore 17 inizio seminario

Ca' Vignal 3 - Piramide, Piano 0, Sala Verde

Tiziano Villa

Referente esterno

Data pubblicazione
6 maggio 2010



 This talk introduces the topic of technology mapping and presents an
algorithm for mapping logic networks into K-input lookup-tables (K-LUTs).
The algorithm avoids the hurdles 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. An extension of
the algorithm allows for sequential mapping, which searches the combined
space of all mappings and retimings. This leads to an average 20%
improvement in depth with a marginal area penalty, compared to
combinational mapping followed by retiming.

Inizio pagina