An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/95957

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/95957

题名:	An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains
作者:	Rau, Jiann-Chyi;Lin, Ching-Hsiu;Chang, Jun-Yi
贡献者:	淡江大學電機工程學系
日期:	2004-11
上传时间:	2014-02-13 11:26:39 (UTC+8)
摘要:	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.
關聯:	Proceedings of The Asian Test Symposium, 2004，頁82-87
显示于类别:	[電機工程學系暨研究所] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains_英文摘要.docx	21Kb	Microsoft Word	131	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章