ACM Home Page
Please provide us with feedback. Feedback
Power minization in LUT-based FPGA technology mapping
Full text PdfPdf (633 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2001 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
Pages: 635 - 640  
Year of Publication: 2001
ISBN:0-7803-6634-4
Authors
Zhi-Hong Wang  Department of Electrical Engineering, Texas A&M University, College Station, TX
En-Cheng Liu
Jianbang Lai
Ting-Chi Wang
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IPSJ : Information Processing Society of Japan
IEEE HK CAS : IEEE HK CAS and Comm. Joint Chapter
IEICE : Inst of Electronics, Info & Communication Engineers
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 13,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/370155.370569
What is a DOI?

ABSTRACT

In this paper, we consider the problem of lookup table (LUT) based FPGA technology mapping for power minimization in combinational circuits. The problem has been previously proved to be NP-hard, and hence we present an efficient heuristic algorithm for it. The main idea of our algorithm is to exploit the "cut enumeration" technique to generate possible mapping solutions for the sub-circuit rooted at each node. However, for the consideration of both run time and memory space, only a fixed-number of solutions are selected and stored by our algorithm. To facilitate the selection process, a method that correctly calculates the estimated power consumption for each mapped sub-circuit is developed. The experimental results indicate that our algorithm reduces the average power consumption by up to 14.18%, and the average number of LUTs by up to 6.99% over an existing method.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
J. Cong and Y. Ding, "FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs," 1EEE Trans. on Computer-Aided Design of Integrated Circztits and Systems, pp. 1 - 12, Jan. 1994.
 
5
J. Cong and Y. Ding," On Area/Depth Trade-Off in LUT-based FPGA Technology Mapping," 1EEE Trans. on VLSI Systems, pp. 137-148, Jun. 1994.
6
7
 
8
A.H. Farrahi and M. Sarrafzadeh, "Complexity of the Lookup-Table Minimization Problem for FPGA Technology Mapping," 1EEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, pp. 1319-1332, Nov. 1994.
 
9
10
11
 
12
 
13
14
15
16
17
 
18
R. Murgai, N. Shenoy, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Improved Logic Synthesis Algorithms for Table Look Up Architectures," Proc. Int. Conf. on Computer-Aided Design, pp. 564- 567, 1991.
 
19
R. Murgai, N. Shenoy, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Performance Directed Synthesis for Table Look Up Programmable Gate Arrays," Prvc. Int. Conf. on Computer-Aided Design, pp. 572- 575, 1991.
 
20
F. Najm, "Transition Density: A New Measure of Activity in Digital Circuits," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, pp. 310-323, Feb. 1993.
 
21
R Sawkar and D. Thomas, "Tcchnology Mapping for Table-Look-Up Based Field Programmable Gate Arrays," Proc. Int. Workshop on Field Programmable Gate Arrays, pp. 83-88, 1992.
 
22
 
23
C.-C. Wang and C.-R Kwan, "Low Power Technology Mapping by Hiding High-Transition Paths in Invisible Edges of LUT-Based FPGAs", Proc. lnt. Symp. on Circuits and Systems, pp. 1536-1539, 1997.
24
 
25
Xilinx, The Prvgrammable Gate Arrays Data Book, Xilinx, San Jose, CA, 1992.

CITED BY  9

Collaborative Colleagues:
Zhi-Hong Wang: colleagues
En-Cheng Liu: colleagues
Jianbang Lai: colleagues
Ting-Chi Wang: colleagues