메뉴 건너뛰기





Volumn , Issue , 1995, Pages 60-64

Method for finding good ashenhurst decompositions and its application to FPGA synthesis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DATA STRUCTURES; EQUIVALENCE CLASSES; LOGIC GATES; SET THEORY; SWITCHING FUNCTIONS; TABLE LOOKUP;

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

References (12)
  • Reference 정보가 존재하지 않습니다.

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