| An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains | |
|---|---|
| 學年 | 93 |
| 學期 | 1 |
| 發表日期 | 2004-11-15 |
| 作品名稱 | An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains |
| 作品名稱（其他語言） | |
| 著者 | Rau, Jiann-Chyi; Lin, Ching-Hsiu; Chang, Jun-Yi |
| 作品所屬單位 | 淡江大學電機工程學系 |
| 出版者 | |
| 會議名稱 | The Asian Test Symposium, 2004 |
| 會議地點 | 屏東縣, 臺灣 |
| 摘要 | In this paper, we present an efficient method for reducing the total length of the scan paths. The method appropriately assigns scan flip-flops into scan chains after these flip-flops being placed. We compare our proposed method with previous work based on pre-placement (PP), greedy (GR), and stable marriage (SM) assignment, and show that our method is superior to the previous approaches. We also perform our method on some of the ISCAS 89 benchmarks. The obtained results of our experiments indicate that our algorithm improves the scan chain lengths by 79%-96%and the CPU time almost increases linearly. |
| 關鍵字 | |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 20041115~20041117 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | Y |
| 出版型式 | 紙本 |
| 出處 | Proceedings of The Asian Test Symposium, 2004，頁82-87 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95957 ) |
| SDGS | 產業創新與基礎設施 |
GoogleAnalytics