메뉴 건너뛰기




Volumn , Issue , 2006, Pages 466-471

Efficient SAT-based Boolean matching for FPGA technology mapping

Author keywords

Boolean matching; Boolean satisfiability; FPGA technology mapping

Indexed keywords

CONFORMAL MAPPING; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); OPTIMIZATION; PROBLEM SOLVING; PROGRAMMABLE LOGIC CONTROLLERS; SPACE TIME ADAPTIVE PROCESSING;

EID: 34547183601     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146909.1147034     Document Type: Conference Paper
Times cited : (33)

References (15)
  • 1
    • 27944440083 scopus 로고    scopus 로고
    • A new canonical form for fast Boolean matching in logic synthesis and verification
    • A. Abdollahi and M. Pedram. A new canonical form for fast Boolean matching in logic synthesis and verification. In Design Automation Conf., pages 379-384, 2005.
    • (2005) Design Automation Conf , pp. 379-384
    • Abdollahi, A.1    Pedram, M.2
  • 2
    • 43349100507 scopus 로고    scopus 로고
    • Altera Corp
    • Altera Corp. Statix II device family data sheet. http://www.altera.com/ literature/hb/stx2/stx2_sii5v1_01.pdf, 2005.
    • (2005) Statix II device family data sheet
  • 3
    • 0001277124 scopus 로고    scopus 로고
    • A survey of Boolean matching techniques for library binding
    • L. Benini and G. D. Micheli. A survey of Boolean matching techniques for library binding. ACM Trans. Des. Autom. Electron. Syst., 2(3):193-226, 1997.
    • (1997) ACM Trans. Des. Autom. Electron. Syst , vol.2 , Issue.3 , pp. 193-226
    • Benini, L.1    Micheli, G.D.2
  • 4
    • 0026866240 scopus 로고
    • A detailed router for field-programmable gate arrays
    • S. Brown, J. Rose, and Z. Vranesic. A detailed router for field-programmable gate arrays. IEEE Trans. on CAD, 11(5):620-628, 1992.
    • (1992) IEEE Trans. on CAD , vol.11 , Issue.5 , pp. 620-628
    • Brown, S.1    Rose, J.2    Vranesic, Z.3
  • 5
    • 0027003876 scopus 로고
    • An optimal technology mapping for delay optimization in lookup-table based fpga designs
    • J. Cong and Y. Ding. An optimal technology mapping for delay optimization in lookup-table based fpga designs. In Int'l Conf. on CAD, pages 48-53, 1992.
    • (1992) Int'l Conf. on CAD , pp. 48-53
    • Cong, J.1    Ding, Y.2
  • 6
    • 0035440923 scopus 로고    scopus 로고
    • Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping
    • J. Cong and Y. Y. Hwang. Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping. IEEE Trans. on CAD, 20(9):1077-1090, 2001.
    • (2001) IEEE Trans. on CAD , vol.20 , Issue.9 , pp. 1077-1090
    • Cong, J.1    Hwang, Y.Y.2
  • 7
    • 0023210698 scopus 로고
    • DAGON: Technology binding and local optimization by DAG matching
    • K. Keutzer. DAGON: Technology binding and local optimization by DAG matching. In Design Automation Conf., pages 341-347, 1987.
    • (1987) Design Automation Conf , pp. 341-347
    • Keutzer, K.1
  • 8
    • 0026623575 scopus 로고
    • Test pattern generation using Boolean satisfiability
    • T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
    • (1992) IEEE Trans. on CAD , vol.11 , pp. 4-15
    • Larrabee, T.1
  • 9
    • 27944492443 scopus 로고    scopus 로고
    • FPGA technology mapping: A study of optimality
    • A. Ling, D. Singh, and S. Brown. FPGA technology mapping: a study of optimality. In Design Automation Conf., pages 427-432, 2005.
    • (2005) Design Automation Conf , pp. 427-432
    • Ling, A.1    Singh, D.2    Brown, S.3
  • 10
    • 0030402207 scopus 로고    scopus 로고
    • GRASP - a new search algorithm for satisfiability
    • J. Marques-Silva and K. Sakallah. GRASP - a new search algorithm for satisfiability. In Int'l Conf. on CAD, pages 220-227, 1996.
    • (1996) Int'l Conf. on CAD , pp. 220-227
    • Marques-Silva, J.1    Sakallah, K.2
  • 13
    • 84947269280 scopus 로고    scopus 로고
    • Pruning techniques for the sat-based bounded model checking problem
    • O. Strichman. Pruning techniques for the sat-based bounded model checking problem. In CHARME, pages 58-70, 2001.
    • (2001) CHARME , pp. 58-70
    • Strichman, O.1
  • 15
    • 34547150634 scopus 로고    scopus 로고
    • guide
    • Xilinx. Virtex-4 user guide. http://direct.xilinx.com/bvdocs/userguides/ ug070.pdf, 2005.
    • (2005) Virtex-4 user
    • Xilinx1


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