Abstract
Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.
| Original language | English |
|---|---|
| Pages (from-to) | 156-163 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
| Publication status | Published - 1994 |
Fingerprint
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Science Applications
- Hardware and Architecture
- Electrical and Electronic Engineering
Cite this
Maple : a simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays. / Togawa, Nozomu; Sato, Masao; Ohtsuki, Tatsuo.
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994, p. 156-163.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Maple
T2 - a simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays
AU - Togawa, Nozomu
AU - Sato, Masao
AU - Ohtsuki, Tatsuo
PY - 1994
Y1 - 1994
N2 - Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.
AB - Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.
UR - http://www.scopus.com/inward/record.url?scp=0028697847&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028697847&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0028697847
SP - 156
EP - 163
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
SN - 0278-0070
ER -