SoC test scheduling using the B*-tree based floorplanning technique
Resource
Design Automation Conference, 2005. Proceedings of the ASP-DAC 2005. Asia and South Pacific
Journal
Asia and South Pacific Design Automation Conference, ASP-DAC 2005
Pages
-
Date Issued
2005-01
Date
2005-01
Author(s)
DOI
N/A
Abstract
We present in this paper a new algorithm to co-optimize the problems of test scheduling and core wrapper design under power constraints for core-based SoC (system on chip) designs. The problem of test scheduling is first transformed into a floorplanning problem with a given maximum height (test access mechanism width) constraint. Then, we apply the B*-tree based floorplanning technique to solve the SoC test scheduling problem. Experimental results based on the ITC'02 benchmarks show that our method is very effective and efficient-our method obtains the best results ever reported for SoC test scheduling with power constraint in every efficient running time. Compared with recent works, our method achieves average improvements of 4.7% to 20.1%.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
01466554.pdf
Size
896.95 KB
Format
Adobe PDF
Checksum
(MD5):01691ec3d3cdaf678f7d284b2d956919