메뉴 건너뛰기




Volumn , Issue , 2011, Pages 230-234

Constructive AIG optimization through functional composition

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; LOGIC SYNTHESIS;

EID: 79959242781     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (16)
  • 4
    • 33846545005 scopus 로고    scopus 로고
    • DAG-aware AIG rewriting a fresh look at combinational logic synthesis
    • Mishchenko, A., Chatterjee, S., and Brayton, R.. DAG-aware AIG rewriting a fresh look at combinational logic synthesis. DAC '06, 532-535.
    • DAC '06 , pp. 532-535
    • Mishchenko, A.1    Chatterjee, S.2    Brayton, R.3
  • 5
    • 0043092192 scopus 로고    scopus 로고
    • Large-scale SOP minimization using decomposition and functional properties
    • Mishchenko, A. and Sasao, T. 2003. Large-scale SOP minimization using decomposition and functional properties. DAC '03, 149-154.
    • (2003) DAC '03 , pp. 149-154
    • Mishchenko, A.1    Sasao, T.2
  • 6
    • 0033347266 scopus 로고    scopus 로고
    • Factoring logic functions using graph partitioning
    • IEE Press, Piscataway, NJ
    • M.C. Golumbic and A. Mintz, Factoring Logic Functions Using Graph Partitioning, ICCAD ‟99. IEE Press, Piscataway, NJ, 195-199.
    • ICCAD ‟99 , pp. 195-199
    • Golumbic, M.C.1    Mintz, A.2
  • 8
    • 33745823396 scopus 로고    scopus 로고
    • Fraigs: A unifying representation for logic synthesis and verification
    • EECS Dept., UC Berkeley, March
    • A. Mishchenko, S. Chatterjee, R. Jiang, R. Brayton, “FRAIGs: A Unifying Representation for Logic Synthesis and Verification”, ERL Technical Report, EECS Dept., UC Berkeley, March 2005.
    • (2005) ERL Technical Report
    • Mishchenko, A.1    Chatterjee, S.2    Jiang, R.3    Brayton, R.4
  • 10
    • 0032681920 scopus 로고    scopus 로고
    • Cut ranking and pruning: Enabling a general and efficient FPGA mapping solution
    • Cong, J., Wu, C., and Ding, Y. 1999. Cut ranking and pruning: enabling a general and efficient FPGA mapping solution. FPGA '99, NY, 29-35.
    • (1999) FPGA '99 , pp. 29-35
    • Cong, J.1    Wu, C.2    Ding, Y.3
  • 11
    • 0028259317 scopus 로고
    • FlowMap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs
    • January
    • J. Cong and Y. Ding, "FlowMap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs," IEEE Trans. CAD, Vol.13, No. 1 (January 1994), pp. 1-12.
    • (1994) IEEE Trans. CAD , vol.13 , Issue.1 , pp. 1-12
    • Cong, J.1    Ding, Y.2
  • 13
    • 77953103647 scopus 로고    scopus 로고
    • KL-cuts: A new approach for logic synthesis targeting multiple output blocks
    • Osvaldo Martinello Jr, Felipe S. Marques, Renato P. Ribas, André I. Reis. KL-Cuts: A New Approach for Logic Synthesis Targeting Multiple Output Blocks. DATE 2010, pp. 777-782.
    • (2010) DATE , pp. 777-782
    • Marques, F.S.1    Ribas, R.P.2    Reis, A.I.3
  • 14
    • 49749130486 scopus 로고    scopus 로고
    • High-quality circuit synthesis for modern technologies
    • Lech Jozwiak, Artur Chojnacki, Aleksander Slusarczyk, "High-Quality Circuit Synthesis for Modern Technologies," ISQED 2008, pp.168-173.
    • (2008) ISQED , pp. 168-173
    • Jozwiak, L.1    Chojnacki, A.2    Slusarczyk, A.3
  • 16
    • 0018060164 scopus 로고
    • An algorithm for minimal tant network generation
    • Dec. 1978
    • Lee, H. -. 1978. An Algorithm for Minimal TANT Network Generation. IEEE Trans. Comput. 27, 12 (Dec. 1978), 1202-1206.
    • (1978) IEEE Trans. Comput. , vol.27 , Issue.12 , pp. 1202-1206
    • Lee, H.1


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