메뉴 건너뛰기




Volumn , Issue , 1998, Pages 128-133

A DSM design flow: Putting floorplanning, technology-mapping, and gate-placement together

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING; ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; DYNAMIC PROGRAMMING; GATES (TRANSISTOR); TREES (MATHEMATICS);

EID: 0031624148     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (19)
  • 1
    • 0026989865 scopus 로고    scopus 로고
    • A near-optimal algorithm for technology mapping minimizing area under delay constraints
    • [CP921], June
    • [CP921] K. Chaudhary, and M. Pedram "A near-optimal algorithm for technology mapping minimizing area under delay constraints, " In Proceeding 29th Design Automation Conference, pages 492-498, June.
    • Proceeding 29th Design Automation Conference , pp. 492-498
    • Chaudhary, K.1    Pedram, M.2
  • 5
    • 1642554808 scopus 로고
    • Finding unidirectional cuts based on physical partitioning and logic restructing
    • IPFC93], ", April
    • [IPFC93] S. Iman, M. Pedram, C. Fabian, and J. Cong, "Finding unidirectional cuts based on physical partitioning and logic restructing, " 4th ACM/SIGDA Physical Design Workshop, pages 187-198, April 1993.
    • (1993) 4th ACM/SIGDA Physical Design Workshop , pp. 187-198
    • Iman, S.1    Pedram, M.2    Fabian, C.3    Cong, J.4
  • 6
    • 0023210698 scopus 로고
    • DAGON: Technology mapping and local optimization
    • [Ke87], June
    • [Ke87] K. Keutzer "DAGON: Technology mapping and local optimization, " In Proceedings of Design Automation Conference, pages 341-347, June 1987.
    • (1987) Proceedings of Design Automation Conference , pp. 341-347
    • Keutzer, K.1
  • 7
    • 0004791043 scopus 로고
    • Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees
    • [Le82], March
    • [Le82] T. Lengauer, "Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees, " In SI AM J. Alg. Disc. Meth., vol. 3, no. 1, pages 99-113, March 1982.
    • (1982) SI AM J. Alg. Disc. Meth. , vol.3 , Issue.1 , pp. 99-113
    • Lengauer, T.1
  • 8
    • 0031365992 scopus 로고    scopus 로고
    • An exact solution to simultaneous technology mapping and linear placement problem
    • [LSP97], November
    • [LSP97] J. Lou, A. H. Salek, and M. Pedram, "An exact solution to simultaneous technology mapping and linear placement problem, " In Proceedings International Conference on Computer-Aided Design, pages 671-675, November 1997.
    • (1997) Proceedings International Conference on Computer-Aided Design , pp. 671-675
    • Lou, J.1    Salek, A.H.2    Pedram, M.3
  • 12
    • 84954419892 scopus 로고
    • Bear-FP: A robust framework for floorplanning
    • PK921]
    • [PK921] M. Pedram and E. Kuh, "Bear-FP: A Robust Framework For Floorplanning, " In International Journal of High Speed Electronics, Vol. 3, No. 1; pages 137-170, 1992.
    • (1992) International Journal of High Speed Electronics , vol.3 , Issue.1 , pp. 137-170
    • Pedram, M.1    Kuh, E.2
  • 13
    • 0003623384 scopus 로고
    • Logic synthesis for VLSI design
    • [Ru891], Ph.D. Dissertation, University of California at Berkeley, April
    • [Ru891]R. Rudell "Logic synthesis for VLSI design " Memorandum UCB/ERL M89/49, Ph.D. Dissertation, University of California at Berkeley, April 1989.
    • (1989) Memorandum UCB/ERL M89/49
    • Rudell, R.1
  • 17
    • 0020746257 scopus 로고
    • Optimal orientation of cells in slicing floorplan designs
    • St83]
    • [St83] L. Stockmeyer, "Optimal orientation of cells in slicing floorplan designs, " Information and Control, volume 57, pages 91-101, 1983.
    • (1983) Information and Control , vol.57 , pp. 91-101
    • Stockmeyer, L.1
  • 19
    • 0022146832 scopus 로고
    • A polynomial algorithm for the min-cut linear arrangement of trees
    • [Ya85], October
    • [Ya85] M. Yannakakis, "A polynomial algorithm for the min-cut linear arrangement of trees, ' In Journal of the Association for Computing Machinery, vol. 32, no. 4, pages 950-988, October 1985.
    • (1985) Journal of the Association for Computing Machinery , vol.32 , Issue.4 , pp. 950-988
    • Yannakakis, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.