A Low-cost BIST Design Supporting Offline and Online Tests

被引:0
|
作者
Ahmad Menbari
Hadi Jahanirad
机构
[1] University of Kurdistan,Department of Electrical Engineering
来源
关键词
Built-in self-test; Concurrent self-test; Concurrent test latency; Linear feedback shift register;
D O I
暂无
中图分类号
学科分类号
摘要
Offline and online built-in self-test (BIST) designs are low-cost platforms to test very complex modern chips. The offline BIST design embeds the test pattern generator (TPG) into the chip to be activated in the test time. On the other hand, the online (or concurrent) BIST design eliminates the TPG and utilizes the system’s input vectors to accomplish the test process. This paper proposes a BIST design that supports both online and offline tests. In the online part of the design, a selector module passes the input vectors which belong to a pre-computed test set to the reduction part. The test set contains the test vectors, which generate 0 remainders in the division by the LFSR’s polynomial of the selector. In the concurrent test latency (CTL) aware design, the size of the test set is expanded by adopting the selecting part to select the test vectors which generate the same remainders in the division by two different polynomials. The internal TPG of the offline part is realized based on the HW-aware test set using the shifted versions of LFSR’s polynomial and XORing their contents. The reduction part compresses the widths of the current test vector and the related CUT outputs. The compactor LFSR compresses the test vectors so that the resulted remainders would be different for all test vectors to solve the masking problem. The small size of the test set and the compacting test vectors resulted in a tremendous reduction of hardware overhead. The proposed method imposes less than 6% and 28% hardware overhead for large size and very large size circuits, respectively. The simulation results for ISCAS 85, ISCAS 89, and ITC99 benchmark circuits showed that our proposed BIST design outperforms the previous state-of-the-art in both hardware overheads. Furthermore, the CTL reduces 100 times by the proposed CTL-aware approach on average.
引用
收藏
页码:107 / 123
页数:16
相关论文
共 50 条
  • [31] Low-Cost Robotic Articulator as an Online Education tool: Design, Deployment and Usage
    Nutakki, Chaitanya
    Vijayan, Asha
    Sasidharakurup, Hemalatha
    Nair, Bipin
    Achuthan, Krishnashree
    Diwakar, Shyam
    2016 INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION FOR HUMANITARIAN APPLICATIONS (RAHA), 2016, : 37 - 41
  • [32] Low-cost airports for low-cost airlines: Flexible design to manage the risks
    De Neufville, Richard
    TRANSPORTATION PLANNING AND TECHNOLOGY, 2008, 31 (01) : 35 - 68
  • [33] Supporting Safe Surgery with Simple, Low-Cost Solutions
    David Watters
    World Journal of Surgery, 2023, 47 : 1648 - 1649
  • [34] Unisys tests low-cost microburst radar
    1600, McGraw-Hill Inc, New York, NY, USA (141):
  • [35] UNISYS TESTS LOW-COST MICROBURST RADAR
    不详
    AVIATION WEEK & SPACE TECHNOLOGY, 1994, 141 (17): : 37 - 37
  • [36] Supporting Safe Surgery with Simple, Low-Cost Solutions
    Watters, David
    WORLD JOURNAL OF SURGERY, 2023, 47 (07) : 1648 - 1649
  • [37] Low-Cost Online Convolution Checksum Checker
    Filippas, Dionysios
    Margomenos, Nikolaos
    Mitianoudis, Nikolaos
    Nicopoulos, Chrysostomos
    Dimitrakopoulos, Giorgos
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2022, 30 (02) : 201 - 212
  • [38] Low-cost airlines and online price dispersion
    Bachis, Enrico
    Piga, Claudio A.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ORGANIZATION, 2011, 29 (06) : 655 - 667
  • [39] Low-cost online testing of asynchronous handshakes
    Shang, D.
    Yakovlev, A.
    Burns, F.
    Xia, F.
    Bystrov, A.
    ETS 2006: ELEVENTH IEEE EUROPEAN TEST SYMPOSIUM, PROCEEDINGS, 2006, : 225 - +
  • [40] Low-cost system for supporting drivers in traffic jam
    Holubowski, Waldemar
    Frankiewicz, Ryszard
    Kusinski, Slawomir
    Sikora, Andrzej
    Zielonka, Adam
    TRANSPORT PROBLEMS, 2023, 18 (01) : 103 - 115