메뉴 건너뛰기




Volumn , Issue , 1998, Pages 336-341

M32: A constructive multilevel logic synthesis system

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); LOGIC SYNTHESIS; ALGORITHMS; LOGIC DESIGN;

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

References (31)
  • 1
    • 0025557059 scopus 로고
    • Multilevel synthesis minimizing the routing factor
    • June
    • P. Abouzeid, K. Sakouti, G. Saucier, and F. Poirot. Multilevel synthesis minimizing the routing factor. In Proc. 27th DAC, pp. 365-368, June 1990.
    • (1990) Proc. 27th DAC , pp. 365-368
    • Abouzeid, P.1    Sakouti, K.2    Saucier, G.3    Poirot, F.4
  • 2
    • 84939034790 scopus 로고
    • Synthesis and optimization of multilevel logic under timing constraints
    • CAD-5
    • K. Bartlett, W. Cohenand A. de Geus, and G. Hachtel. Synthesis and optimization of multilevel logic under timing constraints. IEEE Trans. CAD IC, CAD-5, 1986.
    • (1986) IEEE Trans. CAD IC
    • Bartlett, K.1    De Geus, W.C.A.2    Hachtel, G.3
  • 5
    • 0021549812 scopus 로고
    • Synthesis and optimization of multistage logic
    • R. K. Brayton and C. McMullen. Synthesis and optimization of multistage logic. In Proc. ICCD, pp. 23-28, 1984.
    • (1984) Proc. ICCD , pp. 23-28
    • Brayton, R.K.1    McMullen, C.2
  • 8
    • 85053106069 scopus 로고
    • Cascade Design Automation, Bellevue, WA 98006., ver. 3.2
    • Cascade Design Automation, Bellevue, WA 98006. EPOCH User's Manual, ver. 3.2, 1995.
    • (1995) EPOCH User's Manual
  • 9
    • 0014613537 scopus 로고
    • An algorithm for NAND decomposition under network constraints
    • C-18: Dec
    • E. Davidson. An algorithm for NAND decomposition under network constraints. IEEE TC, C-18(12):1098-1109, Dec. 1969.
    • (1969) IEEE TC , Issue.12 , pp. 1098-1109
    • Davidson, E.1
  • 10
    • 0023559691 scopus 로고
    • Technology mapping in MIS
    • Nov
    • E. Detjens, G. Gannot, R. Rudell, et al. Technology mapping in MIS. In Proc. ICCAD, pp. 116-119, Nov. 1987.
    • (1987) Proc. ICCAD , pp. 116-119
    • Detjens, E.1    Gannot, G.2    Rudell, R.3
  • 12
    • 0003934798 scopus 로고
    • Technical Report UCB/ERL M92/41, UC Berkeley, Electronics Research Laboratory, May
    • E. M. Sentovich et al. SIS: A system for sequential circuit synthesis. Technical Report UCB/ERL M92/41, UC Berkeley, Electronics Research Laboratory, May 1992.
    • (1992) SIS: A System for Sequential Circuit Synthesis
    • Sentovich, E.M.1
  • 13
    • 0027001626 scopus 로고
    • LATTIS: An iterative speedup heuristic for mapped logic
    • June
    • J. P. Fishburn. LATTIS: An iterative speedup heuristic for mapped logic. In Proc. 29th DAC, pp. 488-491, June 1992.
    • (1992) Proc. 29th DAC , pp. 488-491
    • Fishburn, J.P.1
  • 14
    • 85027164515 scopus 로고
    • Socrates: A system for automatically synthesizing and optimizing combinational logic
    • D. Gregory, K. Bartlett, A. de Geus, and G. Hachtel. Socrates: A system for automatically synthesizing and optimizing combinational logic. In Proc. 23rdDAC, pp. 79-85, 1986.
    • (1986) Proc. 23rdDAC , pp. 79-85
    • Gregory, D.1    Bartlett, K.2    Geus, A.D.3    Hachtel, G.4
  • 15
    • 0026839945 scopus 로고
    • On properties of algebraic transformations and the synthesis of multifault-ir- redundant circuits
    • March
    • G. Hachtel, R. M. Jacoby, K. Keutzer et al. On properties of algebraic transformations and the synthesis of multifault-ir- redundant circuits. IEEE TCAD IC, 11(3):313-321, March 1992.
    • (1992) IEEE TCAD IC , vol.11 , Issue.3 , pp. 313-321
    • Hachtel, G.1    Jacoby, R.M.2    Keutzer, K.3
  • 16
    • 0023210698 scopus 로고
    • DAGON: Technology binding and local optimization by DAG matching
    • June
    • K. Keutzer. DAGON: Technology binding and local optimization by DAG matching. In Proc. 24th DAC, pp. 341-347, June 1987.
    • (1987) Proc. 24th DAC , pp. 341-347
    • Keutzer, K.1
  • 17
    • 0030651944 scopus 로고    scopus 로고
    • The future of logic synthesis and physical design in deep-submicron process geometries
    • K. Keutzer, A. R. Newton, and N. Shenoy. The future of logic synthesis and physical design in deep-submicron process geometries. In Proc. ISPD, pp. 218-224, 1997.
    • (1997) Proc. ISPD , pp. 218-224
    • Keutzer, K.1    Newton, A.R.2    Shenoy, N.3
  • 18
    • 85053131115 scopus 로고    scopus 로고
    • Constructive multilevel logic synthesis under properties of boolean algebra
    • March
    • V. N. Kravets and K. A. Sakallah. Constructive multilevel logic synthesis under properties of boolean algebra. Technical Report CSE-TR-359-98, March 1998.
    • (1998) Technical Report CSE-TR-359-98
    • Kravets, V.N.1    Sakallah, K.A.2
  • 20
    • 0027046531 scopus 로고
    • Performance enhancement through the generalized bypass transform
    • Nov
    • P. McGeer, R. Brayton, and A. Sangiovanni-Vincentelli. Performance enhancement through the generalized bypass transform. In Proc. ICCAD, pp. 184-187, Nov. 1991.
    • (1991) Proc. ICCAD , pp. 184-187
    • McGeer, P.1    Brayton, R.2    Sangiovanni-Vincentelli, A.3
  • 22
    • 0001277124 scopus 로고    scopus 로고
    • A survey of boolean matching techniques for library binding
    • L. Benini G. De Micheli. A survey of boolean matching techniques for library binding. ACM TODAES, 2(3), 1997.
    • (1997) ACM TODAES , vol.2 , Issue.3
    • Micheli, L.B.G.D.1
  • 23
    • 0026175629 scopus 로고
    • Layout driven technology mapping
    • June
    • M. Pedram and N. Bhat. Layout driven technology mapping. In Proc. 28th DAC, pp. 99-105, June 1991.
    • (1991) Proc. 28th DAC , pp. 99-105
    • Pedram, M.1    Bhat, N.2
  • 24
    • 0027698343 scopus 로고
    • Lexicographical expressions of boolean functions with applications to multilevel synthesis
    • Nov
    • G. Saucier, J. Fron, and P. Abouzied. Lexicographical expressions of boolean functions with applications to multilevel synthesis. IEEE TCAD IC, 12:1642-1654, Nov. 1993.
    • (1993) IEEE TCAD IC , vol.12 , pp. 1642-1654
    • Saucier, G.1    Fron, J.2    Abouzied, P.3
  • 25
    • 84913253965 scopus 로고
    • An algorithm for synthesis of multiple-output combinational logic
    • C- 17:, Feb
    • P. R. Schneider and D. L. Dietmeyer. An algorithm for synthesis of multiple-output combinational logic. IEEE TC, C- 17(2): 117-128, Feb. 1968.
    • (1968) IEEE TC , Issue.2 , pp. 117-128
    • Schneider, P.R.1    Dietmeyer, D.L.2
  • 28
    • 0027075807 scopus 로고
    • Delay optimization of combinational logic circuits and partial collapsing
    • June
    • H. J. Touati, H. Savoj, and R. K. Brayton. Delay optimization of combinational logic circuits and partial collapsing. In Proc. 28th DAC., pp. 188-191, June 1991.
    • (1991) Proc. 28th DAC , pp. 188-191
    • Touati, H.J.1    Savoj, H.2    Brayton, R.K.3
  • 29
    • 0029225180 scopus 로고
    • Minimizing the routing cost during logic extraction
    • June
    • H. Vaishnav and M. Pedram. Minimizing the routing cost during logic extraction. In Proc. 32ndDAC, pp. 70-75, June 1995.
    • (1995) Proc. 32ndDAC , pp. 70-75
    • Vaishnav, H.1    Pedram, M.2
  • 31
    • 85053161888 scopus 로고
    • A depth-decreasing heuristic for combinational logic; or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between
    • June
    • K. Yoshikawa, H. Ichiiryu, H. Tanishita et al. A depth-decreasing heuristic for combinational logic; or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between. In Proc. 28thDAC, pp. 112-117, June 1991.
    • (1991) Proc. 28thDAC , pp. 112-117
    • Yoshikawa, K.1    Ichiiryu, H.2    Tanishita, H.3


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