| Creator |
|
|
|
| Language |
|
| Date |
|
| Source Title |
|
| Source Title |
|
| Vol |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
|
|
|
|
|
|
| Related URI |
|
|
|
|
|
|
|
|
|
| Relation |
|
|
|
|
|
|
|
|
|
| Abstract |
In this paper we present the post-processing algorithm, Cut Substitution, for technology mapping for LUT-based FPGAs to minimize the area under depth minimum constraint. The problem to generate a LUT’...s network whose area is minimum under depth minimum costraint seems to be as difficult as NP-Hard class problem. Cut Substitution is the process to generate a local optimum solution by eliminating redundant LUTs while the depth of network is maintained. The experiments shows that the proposed method derives the solutions whose area are 9% smaller than the solutions of a previous state-of-the-art, DAOmap on average.show more
|
Export Mendeley
taiga07_2