2008年12月
A Clock Scheduling Algorithm for High-Throughput RSFQ Digital Circuits
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- ,
- ,
- 巻
- E91A
- 号
- 12
- 開始ページ
- 3772
- 終了ページ
- 3782
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1093/ietfec/e91-a.12.3772
- 出版者・発行元
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
An algorithm for clock scheduling of concurrent-flow clocking rapid single-flux-quantum (RSFQ) digital circuits is proposed. RSFQ circuit technology is an emerging technology of digital circuits. In concurrent-flow clocking RSFQ digital circuits, all logic gates are driven by clock pulses. Appropriate clock scheduling makes clock frequency of the circuits higher. Given a clock period, the proposed algorithm determines the arrival time of clock pulses and the delay that should be inserted. Experimental results show that inserted delay elements by the proposed algorithm are 59.0% fewer and the height of clock trees are 40.4% shorter on average than those by a straightforward algorithm. The proposed algorithm can also be used to minimize the clock period, thus obtaining 19.0% shorter clock periods on average.
- リンク情報
- ID情報
-
- DOI : 10.1093/ietfec/e91-a.12.3772
- ISSN : 0916-8508
- eISSN : 1745-1337
- CiNii Articles ID : 10026854486
- Web of Science ID : WOS:000262164800046