메뉴 건너뛰기




Volumn 12, Issue 12, 2004, Pages 1371-1374

Routability checking for three-dimensional architectures

Author keywords

Computer aided design (CAD); Layout; Routability; Satisfiability

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; FIELD PROGRAMMABLE GATE ARRAYS; GRAPH THEORY; INTEGRATED CIRCUIT LAYOUT; MATHEMATICAL MODELS; MULTICHIP MODULES; PRINTED CIRCUIT BOARDS; THEOREM PROVING; VECTORS;

EID: 12344263897     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2004.837999     Document Type: Article
Times cited : (19)

References (18)
  • 1
    • 12344289977 scopus 로고
    • Optimal layout via Boolean satisfiability
    • S. Devadas, "Optimal layout via Boolean satisfiability," Int. J. Comput. Aided VLSI Design, no. 2, pp. 251-262, 1990.
    • (1990) Int. J. Comput. Aided VLSI Design , vol.2 , pp. 251-262
    • Devadas, S.1
  • 5
    • 0022076244 scopus 로고
    • A greedy switch-box router
    • W. K. Luk, "A greedy switch-box router," Integration: The VLSI J., vol. 3, pp. 129-149, 1985.
    • (1985) Integration: the VLSI J. , vol.3 , pp. 129-149
    • Luk, W.K.1
  • 7
    • 12344293160 scopus 로고
    • A minimum-impact routing algorithm
    • K. J. Supowit, "A minimum-impact routing algorithm," in Proc. Design Automation Conf., 1982, pp. 104-112.
    • (1982) Proc. Design Automation Conf. , pp. 104-112
    • Supowit, K.J.1
  • 8
    • 85013873725 scopus 로고    scopus 로고
    • Conflict driven learning in a quantified Boolean satisfiability solver
    • San Jose, CA, Nov.
    • L. Zhang and S. Malik, "Conflict driven learning in a quantified Boolean satisfiability solver," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2002.
    • (2002) Proc. Int. Conf. Computer-aided Design
    • Zhang, L.1    Malik, S.2
  • 9
  • 10
    • 10944270342 scopus 로고    scopus 로고
    • Congestion estimation for 3-D circuit architectures
    • Dec.
    • L. Cheng, W. N. N. Hung, G. Yang, and X. Song, "Congestion estimation for 3-D circuit architectures," IEEE Trans. Circuits Syst. II, vol. 12, pp. 655-659, Dec. 2004.
    • (2004) IEEE Trans. Circuits Syst. II , vol.12 , pp. 655-659
    • Cheng, L.1    Hung, W.N.N.2    Yang, G.3    Song, X.4
  • 11
    • 0004392594 scopus 로고
    • Optimal three-dimensional VLSI layout
    • F. Preparata, "Optimal three-dimensional VLSI layout," Math. Syst. Theory, vol. 16, pp. 1-8, 1983.
    • (1983) Math. Syst. Theory , vol.16 , pp. 1-8
    • Preparata, F.1
  • 12
    • 0029208379 scopus 로고
    • Routing in a three-dimensional chip
    • Jan.
    • C. C. Tong and C. Wu, "Routing in a three-dimensional chip," IEEE Trans. Computers, vol. 44, pp. 106-117, Jan. 1995.
    • (1995) IEEE Trans. Computers , vol.44 , pp. 106-117
    • Tong, C.C.1    Wu, C.2
  • 14
    • 0034246195 scopus 로고    scopus 로고
    • 3-D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems
    • Aug.
    • K. Bazargan, R. Kastner, and M. Sarrafzadeh, "3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems," J. Design Automation Embedded Syst., no. 5, pp. 329-338, Aug. 2000.
    • (2000) J. Design Automation Embedded Syst. , Issue.5 , pp. 329-338
    • Bazargan, K.1    Kastner, R.2    Sarrafzadeh, M.3
  • 17
    • 0022769976 scopus 로고
    • Graph based algorithms for Boolian function manipulation
    • Aug.
    • R. E. Bryant, "Graph based algorithms for Boolian function manipulation," IEEE Trans. Computers, vol. C-35, pp. 677-691, Aug. 1986.
    • (1986) IEEE Trans. Computers , vol.C-35 , pp. 677-691
    • Bryant, R.E.1


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