메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 195-204

Slack matching quasi delay-insensitive circuits

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS MACHINERY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

EID: 33749615676     PISSN: 26431394     EISSN: 26431483     Source Type: Conference Proceeding    
DOI: 10.1109/ASYNC.2006.27     Document Type: Conference Paper
Times cited : (38)

References (11)
  • 2
    • 0034477943 scopus 로고    scopus 로고
    • Pipeline optimization for asynchronous circuits:complexity analysis and an efficient optimal algorithm
    • S. Kim and P. Beerel. Pipeline optimization for asynchronous circuits:complexity analysis and an efficient optimal algorithm. In Proc. International Conference on Computer-Aided Design, 2000.
    • (2000) Proc. International Conference on Computer-aided Design
    • Kim, S.1    Beerel, P.2
  • 4
    • 0038111456 scopus 로고
    • Master's thesis, California Institute of Technology
    • A.M. Lines. Pipelined asynchronous circuits. Master's thesis, California Institute of Technology, 1995.
    • (1995) Pipelined Asynchronous Circuits
    • Lines, A.M.1
  • 10
    • 23544474598 scopus 로고
    • Latency and throughput tradeoffs in self-timed asynchronous pipelines and rings
    • Stanford
    • T. Williams. Latency and throughput tradeoffs in self-timed asynchronous pipelines and rings. Technical report, Stanford, 1990.
    • (1990) Technical Report
    • Williams, T.1


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