메뉴 건너뛰기




Volumn , Issue , 2009, Pages 160-165

Resurrecting infeasible clock-gating functions

Author keywords

Approximation; Clock gating; Clustering; Low power

Indexed keywords

COMPUTER AIDED DESIGN;

EID: 70350731273     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1629911.1629957     Document Type: Conference Paper
Times cited : (31)

References (17)
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35:677-691, 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , pp. 677-691
    • Bryant, R.E.1
  • 5
    • 34547348270 scopus 로고    scopus 로고
    • DDBDD: Delay-driven BDD synthesis for FPGAs
    • L. Cheng, D. Chen, and M. D. F. Wong. DDBDD: delay-driven BDD synthesis for FPGAs. In Proc. of DAC '07, pages 910-915, 2007.
    • (2007) Proc. of DAC '07 , pp. 910-915
    • Cheng, L.1    Chen, D.2    Wong, M.D.F.3
  • 7
    • 51549104736 scopus 로고    scopus 로고
    • Automatic synthesis of clock gating logic with controlled netlist perturbation
    • A. P. Hurst. Automatic synthesis of clock gating logic with controlled netlist perturbation. In Proc. of DAC '08, pages 654-657, 2008.
    • (2008) Proc. of DAC '08 , pp. 654-657
    • Hurst, A.P.1
  • 8
    • 84945199722 scopus 로고    scopus 로고
    • Approximative representation of Boolean functions by size controllable ROBDD's
    • Technical report, Inst. fiir Informatik, Univ. Wfirzburg
    • T. Kunjan, U. Hinsberger, and R. Kolla. Approximative representation of Boolean functions by size controllable ROBDD's. Technical report, Inst. fiir Informatik, Univ. Wfirzburg, 1997.
    • (1997)
    • Kunjan, T.1    Hinsberger, U.2    Kolla, R.3
  • 9
    • 57849143298 scopus 로고    scopus 로고
    • A novel sequential circuit optimization with clock gating logic
    • Y. Kuo, S. Weng, and S. Chang. A novel sequential circuit optimization with clock gating logic. In Proc. of the ICCAD '08, pages 230-233, 2008.
    • (2008) Proc. of the ICCAD '08 , pp. 230-233
    • Kuo, Y.1    Weng, S.2    Chang, S.3
  • 12
    • 37949057504 scopus 로고    scopus 로고
    • BDD path length minimization based on initial variable ordering
    • P. Prasad, M. Raseen, A. Assi, and S. Senanayake. BDD path length minimization based on initial variable ordering. Journal of Computer Sciences, 1(4):521-529, 2005.
    • (2005) Journal of Computer Sciences , vol.1 , Issue.4 , pp. 521-529
    • Prasad, P.1    Raseen, M.2    Assi, A.3    Senanayake, S.4
  • 13
    • 0034156657 scopus 로고    scopus 로고
    • Clock-gating and its application to low power design of sequential circuits
    • Q.Wu, M.Pedram, and X.Wu. Clock-gating and its application to low power design of sequential circuits. IEEE Transactions on Computers, 47(103):415-420, 2000.
    • (2000) IEEE Transactions on Computers , vol.47 , Issue.103 , pp. 415-420
    • Wu, Q.1    Pedram, M.2    Wu, X.3
  • 14
    • 70350736781 scopus 로고    scopus 로고
    • Intelligate: Scalable dynamic invariant learning for power reduction
    • R.Wiener, G.Kamhi, and M.Y.Vardi. Intelligate: scalable dynamic invariant learning for power reduction. In Procõ of PATMOS ,08, 2008.
    • (2008) Procõ of PATMOS ,08
    • Wiener, R.1    Kamhi, G.2    Vardi, M.Y.3
  • 16
    • 0033712183 scopus 로고    scopus 로고
    • BDS: A BDD-based logic optimization system
    • C. Yang and M. Ciesielski. BDS: a BDD-based logic optimization system. In Proc. of DAC '00, pages 92-97, 2000.
    • (2000) Proc. of DAC '00 , pp. 92-97
    • Yang, C.1    Ciesielski, M.2
  • 17
    • 0033297733 scopus 로고    scopus 로고
    • BDD decomposition for efficient logic synthesis
    • C. Yang, V. Singhal, and M. Ciesielski. BDD decomposition for efficient logic synthesis. In Proc. of ICCD '99, pages 626-631, 1999.
    • (1999) Proc. of ICCD '99 , pp. 626-631
    • Yang, C.1    Singhal, V.2    Ciesielski, M.3


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