메뉴 건너뛰기




Volumn 48, Issue 8, 1999, Pages 769-779

Automatic synthesis of large telescopic units based on near-minimum timed supersetting

Author keywords

Logic synthesis; Throughput optimization; Timing analysis

Indexed keywords


EID: 0038450799     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.795120     Document Type: Article
Times cited : (32)

References (16)
  • 1
    • 0031076832 scopus 로고    scopus 로고
    • Design Issues in Division and Other Floating-Point Operations
    • Feb.
    • S.F. Oberman and M.J. Flynn, "Design Issues in Division and Other Floating-Point Operations," IEEE Trans. Computers, vol. 46, no. 2, pp. 154-161, Feb. 1997.
    • (1997) IEEE Trans. Computers , vol.46 , Issue.2 , pp. 154-161
    • Oberman, S.F.1    Flynn, M.J.2
  • 6
    • 0002609165 scopus 로고
    • A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran
    • Kyoto, Japan, June
    • F. Brglez and H. Fujiwara, "A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran," Proc. ISCAS-85: IEEE Int'l Symp. Circuits and Systems, pp. 785-794, Kyoto, Japan, June 1985.
    • (1985) Proc. ISCAS-85: IEEE Int'l Symp. Circuits and Systems , pp. 785-794
    • Brglez, F.1    Fujiwara, H.2
  • 9
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Aug.
    • R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, vol. 35, no. 8, pp. 79-85, Aug. 1986.
    • (1986) IEEE Trans. Computers , vol.35 , Issue.8 , pp. 79-85
    • Bryant, R.1
  • 10
    • 0026913667 scopus 로고
    • Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams
    • Sept.
    • R. Bryant, "Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams," ACM Computing Surveys, vol. 24, no. 3, pp. 293-318, Sept. 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.1
  • 16
    • 0026107125 scopus 로고
    • On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
    • Feb.
    • R.E. Bryant, "On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication," IEEE Trans. Computers, vol. 40, no. 2, pp. 205-213, Feb. 1991.
    • (1991) IEEE Trans. Computers , vol.40 , Issue.2 , pp. 205-213
    • Bryant, R.E.1


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