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

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/95957

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/95957

Title:	An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains
Authors:	Rau, Jiann-Chyi;Lin, Ching-Hsiu;Chang, Jun-Yi
Contributors:	淡江大學電機工程學系
Date:	2004-11
Issue Date:	2014-02-13 11:26:39 (UTC+8)
Abstract:	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.
Relation:	Proceedings of The Asian Test Symposium, 2004，頁82-87
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

File	Size	Format
An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains_英文摘要.docx	21Kb	Microsoft Word	102	View/Open