2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.
DOI: 10.1109/fpt.2002.1188684
|View full text |Cite
|
Sign up to set email alerts
|

Power-aware technology mapping for LUT-based FPGAs

Abstract: We present a new power-aware technology mapping technique for LUT-based

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
37
0

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(38 citation statements)
references
References 18 publications
1
37
0
Order By: Relevance
“…To show the efficiency of our algorithm, we first design a mapping algorithm with single Vdd, which uses similar cost function as that in DVmap and relaxes the noncritical paths based on cost to achieve better power results. The single-Vdd mapper, named SVmap, shows an advantage over the latest published low-power mapping algorithm Emap [10] and another low power mapper presented in [8]. We then show that our dual-Vdd mapping algorithm DVmap can further improve SVmap by up to 11.6% for power savings.…”
Section: Introductionmentioning
confidence: 84%
See 1 more Smart Citation
“…To show the efficiency of our algorithm, we first design a mapping algorithm with single Vdd, which uses similar cost function as that in DVmap and relaxes the noncritical paths based on cost to achieve better power results. The single-Vdd mapper, named SVmap, shows an advantage over the latest published low-power mapping algorithm Emap [10] and another low power mapper presented in [8]. We then show that our dual-Vdd mapping algorithm DVmap can further improve SVmap by up to 11.6% for power savings.…”
Section: Introductionmentioning
confidence: 84%
“…There are previous works on technology mapping for low-power FPGA designs, all assuming single Vdd [7,8,9,10]. The basic approach was to hide the nodes of high-switching activity into LUTs so the overall dynamic power was reduced.…”
Section: Introductionmentioning
confidence: 99%
“…Both [24] and [25] used this method for mapping to minimize area. The works in [9], [11], and [12] present low-power mappers based on this technique as well. After cut enumeration and arrival time and cost propagation, a cut selection procedure is carried out to cover the entire netlist.…”
Section: A Overviewmentioning
confidence: 99%
“…4) Output Fanout Number: Another factor we consider is the fanout number of the root node of the target cut. This is trying to control node duplication because duplication usually hurts power minimization [9]. In Fig.…”
Section: Calculation Of Cut Costmentioning
confidence: 99%
“…There is previous work such as [11], [12], PowerMap [13], PowerMinMap [14], Emap [15], and SVmap/DVmap [16] on low-power FPGA technology mapping. Techniques including bin packing, dynamic programming, greedy algorithm, binate covering, network flow algorithm, and cut-enumeration algorithm have been applied to hide the nodes of high-switching activity into LUTs so the overall dynamic power can be reduced.…”
Section: Seumentioning
confidence: 99%