{"title":"On optimizing scan testing power and routing cost in scan chain design","authors":"L. Hsu, Hung-Ming Chen","doi":"10.1109/ISQED.2006.95","DOIUrl":null,"url":null,"abstract":"With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging works. Without careful design in scan cell placement and chain ordering, circuits consume much more power in test mode operation than that in normal functional mode. This elevated testing power may cause problems including overall yield lost and instant circuit damage. In this paper, we present an approach to simultaneously minimizing power and routing cost in scan chain reordering after cell placement. We formulate the problem as a traveling salesman problem (TSP), different cost evaluation from (Bonhomme et al., 2004), (Bonhomme et al., 2003), and apply an efficient heuristic to solve it. The experimental results are encouraging. Compared with a recent result in (Bonhomme et al., 2004), which uses the approach with clustering overhead, we obtain up to 10% average power saving under the same low routing cost Furthermore, we obtain 57% routing cost improvement under the same test power consumption in s9234, one of ISCAS'89 benchmarks. We collaborate multiple scan chains architecture with our methodology and obtain good results as well","PeriodicalId":138839,"journal":{"name":"7th International Symposium on Quality Electronic Design (ISQED'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Quality Electronic Design (ISQED'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED.2006.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging works. Without careful design in scan cell placement and chain ordering, circuits consume much more power in test mode operation than that in normal functional mode. This elevated testing power may cause problems including overall yield lost and instant circuit damage. In this paper, we present an approach to simultaneously minimizing power and routing cost in scan chain reordering after cell placement. We formulate the problem as a traveling salesman problem (TSP), different cost evaluation from (Bonhomme et al., 2004), (Bonhomme et al., 2003), and apply an efficient heuristic to solve it. The experimental results are encouraging. Compared with a recent result in (Bonhomme et al., 2004), which uses the approach with clustering overhead, we obtain up to 10% average power saving under the same low routing cost Furthermore, we obtain 57% routing cost improvement under the same test power consumption in s9234, one of ISCAS'89 benchmarks. We collaborate multiple scan chains architecture with our methodology and obtain good results as well
凭借先进的深亚微米(DSM) VLSI制造技术,我们可以将整个电子系统集成在单芯片(SoC)上。由于SoC设计的复杂性,电路的可测试性成为最具挑战性的工作之一。如果没有仔细设计扫描单元的位置和链的排序,电路在测试模式下比在正常功能模式下消耗更多的功率。这种提高的测试功率可能会导致包括总产量损失和瞬间电路损坏在内的问题。在本文中,我们提出了一种在单元放置后扫描链重新排序中同时最小化功耗和路由成本的方法。我们将问题表述为旅行推销员问题(TSP),不同于(Bonhomme et al., 2004), (Bonhomme et al., 2003)的成本评估,并应用有效的启发式方法来解决它。实验结果令人鼓舞。与最近在(Bonhomme et al., 2004)中使用集群开销方法的结果相比,我们在相同的低路由成本下获得了高达10%的平均功耗节省。此外,在isas '89基准之一的s9234中,我们在相同的测试功耗下获得了57%的路由成本改进。我们将多个扫描链架构与我们的方法协作,并获得了良好的结果