Abstract
An efficient technology mapping algorithm that achieves probably optimal delay in the technology mapped circuit using the general delay model is presented. The algorithm is a non-trivial generalization of FlowMap. A key problem in the algorithm is to compute a K-feasible network cut such that the circuit delay on every cut edge is upper-bounded by a specific value. The algorithm is implemented in a lookup-table (LUT) based FPGA technology mapping package called Edge-Map, and Edge-Map is tested on a set of benchmark circuits.
| Original language | English |
|---|---|
| Title of host publication | 1994 IEEE/ACM International Conference On Computer-aided Design, ICCAD 1994 |
| Publisher | IEEE |
| Pages | 150-155 |
| Number of pages | 6 |
| ISBN (Print) | 0818664177, 0818630108 |
| DOIs | |
| Publication status | Published - Nov 1994 |
| Event | 1994 IEEE/ACM International Conference on Computer-aided Design, ICCAD 1994 - San Jose, United States Duration: 6 Nov 1994 → 10 Nov 1994 https://ieeexplore.ieee.org/xpl/conhome/4983/proceeding (Link to conference proceedings) |
Publication series
| Name | Proceedings of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
|---|
Conference
| Conference | 1994 IEEE/ACM International Conference on Computer-aided Design, ICCAD 1994 |
|---|---|
| Country/Territory | United States |
| City | San Jose |
| Period | 6/11/94 → 10/11/94 |
| Internet address |
|