Area-minimal algorithm for LUT-Based FPGA technology mapping with duplication-free restriction

被引：0

作者：

Kao, CC ^{[1
]}

Lai, YT ^{[1
]}

机构：

[1] Natl Pingtung Inst Commerce, Dept Informat Technol, Pingtung, Taiwan

来源：

ASP-DAC 2004: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE | 2004年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a polynomial time algorithm which can run in O(n(3)) time to generate an efficient solution where n is the total number of gates in the circuit. The proposed algorithm partitions the graph representing the given circuit into subgraphs such that the solution can be obtained by merging the subgraph solutions. The greedy technique is then used to find the solution for each subgraph. It is shown that except for some cases the greedy method can find an optimal solution of a given problem. We have tested our algorithm on a set of benchmark examples. The experimental results demonstrate the effectiveness of our algorithm.

引用

页码：719 / 724

页数：6

共 50 条

[41] Mapping multi-mode circuits to LUT-based FPGA using embedded MUXes
Courtney, T
Turner, R
Woods, R
10TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2002, : 318 - 319
[42] An Efficient Cut Enumeration for Depth-Optimum Technology Mapping for LUT-based FPGAs
Takata, Taiga
Matsunaga, Yusuke
GLSVLSI 2009: PROCEEDINGS OF THE 2009 GREAT LAKES SYMPOSIUM ON VLSI, 2009, : 351 - 356
[43] FMAP: A technology mapping algorithm for FPGA with MUX-LUT mixed architecture
Wen, YJ
Tong, JR
Chiang, C
2003 5TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS, 2003, : 812 - 815
[44] Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping
Cong, J
Hwang, YY
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2001, 20 (09) : 1077 - 1090
[45] Efficient Cut Enumeration Heuristics for Depth-Optimum Technology Mapping for LUT-Based FPGAs
Takata, Taiga
Matsunaga, Yusuke
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2009, E92A (12) : 3268 - 3275
[46] PIMap: A Flexible Framework for Improving LUT-Based Technology Mapping via Parallelized Iterative Optimization
Liu, Gai
Zhang, Zhiru
ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2019, 11 (04)
[47] On K-LUT Based FPGA Optimum Delay and Optimal Area Mapping
Bucur, Ion
Fagarasan, Ioana
Popescu, Cornel
Boiangiu, Costin-Anton
Culea, George
MACMESE 2008: PROCEEDINGS OF THE 10TH WSEAS INTERNATIONAL CONFERENCE ON MATHEMATICAL AND COMPUTATIONAL METHODS IN SCIENCE AND ENGINEERING, PTS I AND II, 2008, : 137 - +
[48] Delay Optimum And Area Optimal Mapping Of k-LUT Based FPGA Circuits
Bucur, Ion I.
Fagarasan, Ioana
Popescu, Cornel
Culea, George
Susu, Alexandru E.
CONTROL ENGINEERING AND APPLIED INFORMATICS, 2009, 11 (01): : 43 - 48
[49] FPGA Delay-Oriented Process Mapping Algorithm of Xiangxi Minority Based on LUT
Xiao, Yun
Zeng, Wei
Zhang, Huang
MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
[50] Low power technology mapping by hiding high-transition paths in invisible edges for LUT-based FPGAs
Wang, CC
Kwan, CP
ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1536 - 1539

← 1 2 3 4 5 →