메뉴 건너뛰기




Volumn 22, Issue 3, 2003, Pages 241-253

Minimum buffered routing with bounded capacitive load for slew rate and reliability control

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CAPACITANCE; DIGITAL INTEGRATED CIRCUITS; INTEGRATED CIRCUIT LAYOUT; OPTIMIZATION; RELIABILITY; SPURIOUS SIGNAL NOISE;

EID: 0037346796     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2002.807888     Document Type: Article
Times cited : (16)

References (25)
  • 2
    • 0033350807 scopus 로고    scopus 로고
    • Buffer insertion for noise and delay optimization
    • Nov.
    • C. Alpert, A. Devgan, and S. T. Quay, "Buffer insertion for noise and delay optimization," IEEE Trans. Computer-Aided Design, vol. 18, pp. 1633-1645, Nov. 1999.
    • (1999) IEEE Trans. Computer-Aided Design , vol.18 , pp. 1633-1645
    • Alpert, C.1    Devgan, A.2    Quay, S.T.3
  • 3
    • 4243933708 scopus 로고    scopus 로고
    • Minimum-buffered routing of non-critical nets for slew rate and reliability control
    • Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, Tech. Rep. CS2001-0681
    • C. Alpert, A. B. Kahng, B. Liu, I. Mǎdoiu, and A. Zelikovsky, "Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control," Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, Tech. Rep. CS2001-0681, 2001.
    • (2001)
    • Alpert, C.1    Kahng, A.B.2    Liu, B.3    Mǎdoiu, I.4    Zelikovsky, A.5
  • 5
    • 0032156828 scopus 로고    scopus 로고
    • Polynomial time approximation scheme for Euclidean TSP and other geometric problems
    • S. Arora, "Polynomial time approximation scheme for Euclidean TSP and other geometric problems," J. ACM, vol. 45, pp. 753-782, 1998.
    • (1998) J. ACM , vol.45 , pp. 753-782
    • Arora, S.1
  • 7
    • 0001885235 scopus 로고    scopus 로고
    • A fast and simple Steiner routing heuristic
    • M. Borah, R. M. Owens, and M. J. Irwin, "A fast and simple Steiner routing heuristic," Discrete Appl. Math., vol. 90, pp. 51-67, 1999.
    • (1999) Discrete Appl. Math. , vol.90 , pp. 51-67
    • Borah, M.1    Owens, R.M.2    Irwin, M.J.3
  • 9
    • 0029708404 scopus 로고    scopus 로고
    • Clock buffer placement algorithm for wire-delay-dominated timing model
    • M. Edahiro and R. J. Lipton, "Clock buffer placement algorithm for wire-delay-dominated timing model," in Proc. Great Lakes Symp. VLSI, 1996, pp. 143-147.
    • Proc. Great Lakes Symp. VLSI, 1996 , pp. 143-147
    • Edahiro, M.1    Lipton, R.J.2
  • 11
    • 0000727336 scopus 로고    scopus 로고
    • The rectilinear Steiner tree problem is NP-complete
    • M. R. Garey and D. S. Johnson, "The rectilinear Steiner tree problem is NP-complete," SIAM J. Appl. Math., vol. 32, pp. 826-834, 1977.
    • (1997) SIAM J. Appl. Math. , vol.32 , pp. 826-834
    • Garey, M.R.1    Johnson, D.S.2
  • 12
    • 0000824570 scopus 로고
    • Hot carrier effects
    • N. G. Einspruch, Ed. New York: Academic
    • C. Hu, "Hot carrier effects," in Advanced MOS Device Physics, N. G. Einspruch, Ed. New York: Academic, 1989, pp. 119-160.
    • (1989) Advanced MOS Device Physics , pp. 119-160
    • Hu, C.1
  • 14
    • 0000686934 scopus 로고
    • A linear tree partitioning algorithm
    • S. Kundu and J. Misra, "A linear tree partitioning algorithm," SIAM J. Comput., vol. 6, 151-154, 1977.
    • (1977) SIAM J. Comput. , vol.6 , pp. 151-154
    • Kundu, S.1    Misra, J.2
  • 15
    • 0030110490 scopus 로고    scopus 로고
    • Optimal wire sizing and buffer insertion for low power and a generalized delay model
    • Mar.
    • J. Lillis, C.-K. Cheng, and T.-T. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," IEEE J. Solid-State Circuits, vol. 31, pp. 437-447, Mar. 1996.
    • (1996) IEEE J. Solid-State Circuits , vol.31 , pp. 437-447
    • Lillis, J.1    Cheng, C.-K.2    Lin, T.-T.3
  • 17
    • 0027046667 scopus 로고    scopus 로고
    • A fast and efficient algorithm for determining fanout trees in large networks
    • S. Lin and M. Marek-Sadowska, "A fast and efficient algorithm for determining fanout trees in large networks," in Proc. Eur. Design Automation Conf., 1991, pp. 539-544.
    • Proc. Eur. Design Automation Conf., 1991 , pp. 539-544
    • Lin, S.1    Marek-Sadowska, M.2
  • 18
    • 0030410359 scopus 로고    scopus 로고
    • Buffered steiner tree construction with wire sizing for interconnect layout optimization
    • T. Okamoto and J. Cong, "Buffered steiner tree construction with wire sizing for interconnect layout optimization," in Proc. IEEE-ACM Int. Conf. Computer-Aided Design, 1996, pp. 44-49.
    • Proc. IEEE-ACM Int. Conf. Computer-Aided Design, 1996 , pp. 44-49
    • Okamoto, T.1    Cong, J.2
  • 20
    • 4243618582 scopus 로고    scopus 로고
    • Characterization of self-heating in advanced vlsi interconnect lines based on thermal finite element simulation
    • S. Rzepka, K. Banerjee, E. Meusel, and C. Chenming Hu, "Characterization of self-heating in advanced vlsi interconnect lines based on thermal finite element simulation,".
    • Rzepka, S.1    Banerjee, K.2    Meusel, E.3    Hu, C.C.4
  • 21
    • 0012485223 scopus 로고    scopus 로고
    • Personal Communication, Apr.
    • L. Scheffer, Personal Communication, Apr. 2000.
    • (2000)
    • Scheffer, L.1
  • 22
    • 0026899868 scopus 로고
    • Effective buffer insertion of clock tree for high speed VLSI circuits
    • N. A. Sherwani and B. Wu, "Effective buffer insertion of clock tree for high speed VLSI circuits," Microelectronics J., vol. 23, pp. 291-300, 1992.
    • (1992) Microelectronics J. , vol.23 , pp. 291-300
    • Sherwani, N.A.1    Wu, B.2
  • 24
    • 0031124218 scopus 로고    scopus 로고
    • Minimal buffer insertion in clock trees with skew and slew rate constraints
    • Apr.
    • G. E. Tellez and M. Sarrafzadeh, "Minimal buffer insertion in clock trees with skew and slew rate constraints," IEEE Trans. Computer-Aided Design, vol. 16, pp. 333-342, Apr. 1997.
    • (1997) IEEE Trans. Computer-Aided Design , vol.16 , pp. 333-342
    • Tellez, G.E.1    Sarrafzadeh, M.2


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