Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Bin Zhou,Mingxue Huo,Xinchun Wu.Low Cost BIST Scheme Using LFSR-RC Reseeding[J].Journal of Harbin Institute Of Technology(New Series),2015,22(3):57-62.DOI:10.11916/j.issn.1005-9113.2015.03.008.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 1686times   downloaded 955times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
Low Cost BIST Scheme Using LFSR-RC Reseeding
Author NameAffiliation
Bin Zhou Research Center of Basic Space Science, Harbin Institute of Technology, Harbin 150001, China 
Mingxue Huo Research Center of Basic Space Science, Harbin Institute of Technology, Harbin 150001, China
Dept.of Microelectronics Science and Technology, Harbin Institute of Technology, Harbin 150001, China 
Xinchun Wu School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China 
Abstract:
A novel BIST scheme for reducing the test storage (TS) is presented. The proposed approach relies on a two-dimensional compression scheme, which combines the advantages of the previous LFSR reseeding scheme and test set embedding technique based on ring counters (RCs) to improve the encoding efficiency. It presents a general method to determine the probability of encoding as a function of the number of specified bits in the test cube, the length of the LFSR and the width of the test set, and conclude that the probability of encoding a n-bit test cube with s specified bits using a (smax+1+20/n)-stage LFSR with a fixed polynomial is 1-10-6. Experimental results for the ISCAS’89 benchmark circuits show that compared with the previous schemes, the proposed scheme based on LFSR-RC reseeding requires 57% less TS and 99.1% test application time (TAT) with simple and uniform BIST control logic.
Key words:  built-in self-test  linear feedback shift register (LFSR)  ring counters(RCs)  test compression
DOI:10.11916/j.issn.1005-9113.2015.03.008
Clc Number:TN47
Fund:

LINKS