|
ABSTRACT
In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization during the mapping process by computing min-cost min-height K-feasible cuts for critical nodes for depth minimization and computing min-cost K-feasible cuts for non-critical nodes for area minimization. CutMap guarantees depth-optimal mapping solutions in polynomial time as the FlowMap algorithm but uses considerably fewer K-Luts. We have implemented CutMap and tested it on the MCNC logic synthesis benchmarks. For depth-optimal mapping solutions, CutMap uses 15% fewer K-LUTs than FlowMap. We also tested CutMap followed by the depth relaxation routines in FlowMap_r algorithm, which achieves area minimization by depth relaxation. CutMap followed FlowMap_r performs better than FlowMap_r.
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.
| |
BrRS87
|
Brayton, R. K., R. Rudell, and A. L. Sangiovanni-Vincentelli, "MIS: A Multiple- Level Logic Optimization," IEEE Transactions on CAD, pp. 1062-1081, Nov. 1987.
|
| |
ChCD92
|
|
| |
CoDi93b
|
|
| |
CoDi94a
|
Cong, J. and Y. Ding, "An Optimal Technology Mapping Algorithm fo Delay Optimization in Lookup-Table Based FPGA Designs," IEEE Trans. on Computer-Aided Design, Vol. 13, pp. 1-12, Jan. 1994.
|
| |
CoDi94b
|
Cong, J. and Y. Ding, "On Area/Depth Tradeoff in LUT-Based FPGA Technology Mapping," IEEE Trans. on VLSI Systems, Vol. 2, June 1994.
|
| |
CoHw95
|
Cong, J. and Y.-Y. Hwang, "Simultaneous Depth and Area Minimization in LUT-based FPGA Mapping," in UCLA Computer Science Department Technical Report CSD-950001, , Los Angeles, CA (January 1995).
|
 |
CoLB94
|
Jason Cong , Zheng Li , Rajive Bagrodia, Acyclic multi-way partitioning of Boolean networks, Proceedings of the 31st annual conference on Design automation, p.670-675, June 06-10, 1994, San Diego, California, United States
[doi> 10.1145/196244.196609]
|
| |
FaMa93
|
Farrahi, A. and M. Sarrafzadeh, "On the Lookup-Table Minimization Problem for FPGA Technology Mapping," in Tech. Report 93-AC-102, , Department of EECS, Northwestern University (July 1993).
|
 |
FrRC90
|
Robert J. Francis , Jonathan Rose , Kevin Chung, Chortle: a technology mapping program for lookup table-based field programmable gate arrays, Proceedings of the 27th ACM/IEEE conference on Design automation, p.613-619, June 24-27, 1990, Orlando, Florida, United States
[doi> 10.1145/123186.123418]
|
| |
FrRV91b
|
Francis, R. J., J. Rose, and Z. Vranesic, "Technology Mapping for Delay Optimization of Lookup Table-Based FPGAs," MCNC Logic Synthesis Workshop, 1991.
|
 |
Ka91a
|
|
 |
LaPV93
|
Yung-Te Lai , Massoud Pedram , Sarma B. K. Vrudhula, BDD based decomposition of logic functions with application to FPGA synthesis, Proceedings of the 30th international conference on Design automation, p.642-647, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.165078]
|
 |
MuNS90
|
Rajeev Murgai , Yoshihito Nishizaki , Narendra Shenoy , Robert K. Brayton , Alberto Sangiovanni-Vincentelli, Logic synthesis for programmable gate arrays, Proceedings of the 27th ACM/IEEE conference on Design automation, p.620-625, June 24-27, 1990, Orlando, Florida, United States
[doi> 10.1145/123186.123421]
|
| |
MuSB91
|
Murgai, R., N. Shenoy, R. K. Brayton, and A. S angiov anni- V inc ente lli, ' 'Performance Directed Synthesis for Table Look Up Programmable Gate Arrays," Prec. IEEE Int'l Conf. on Computer-Aided Design, pp. 572- 575, Nov. 1991.
|
| |
ScKC92
|
|
CITED BY 29
|
|
|
|
|
|
|
|
|
|
|
|
Andy Yan , Rebecca Cheng , Steven J. E. Wilton, On the sensitivity of FPGA architectural conclusions to experimental assumptions, tools, and techniques, Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays, February 24-26, 2002, Monterey, California, USA
|
|
|
|
|
|
|
|
|
Darko Kirovski , Yean-Yow Hwang , Miodrag Potkonjak , Jason Cong, Intellectual property protection by watermarking combinational logic synthesis solutions, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.194-198, November 08-12, 1998, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jason Cong , John Peck , Yuzheng Ding, RASP: a general logic synthesis system for SRAM-based FPGAs, Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays, p.137-143, February 11-13, 1996, Monterey, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|