DMCA
Optimal Implementation of Combinational Logic on Look-up Tables
BibTeX
@MISC{Atasu_optimalimplementation,
author = {Kubilay Atasu and Tim Todman and Oskar Mencer and Wayne Luk},
title = {Optimal Implementation of Combinational Logic on Look-up Tables},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — We present a methodology for optimally implementing combinational logic equations on networks of look-up tables. Our work effectively extends optimality to span logic minimization and technology mapping. We restrict ourselves to 4-input look-up tables (LUTs) and enumerate all possible circuits up to a certain area or latency. Since simple-minded enumeration would take a long time, we develop levels of abstractions (steps) and we formulate the key step of enumeration as an Integer Linear Programming (ILP) problem. We show results on a set of ISCAS benchmarks. I.
