• Articles • Previous Articles     Next Articles

Low Cost Scan Test by Test Correlation Utilization

Ozgur Sinanoglu   

  1. Mathematics and Computer Science Department, Kuwait University, Safat, Kuwait
  • Received:2006-12-19 Revised:2007-05-21 Online:2007-09-10 Published:2007-09-10

Scan-based testing methodologies remedy the testability problem of sequential circuits; yet they suffer from prolonged test time and excessive test power due to numerous shift operations. The correlation among test data along with the high density of the unspecified bits in test data enables the utilization of the existing test data in the scan chain for the generation of the subsequent test stimulus, thus reducing both test time and test data volume. We propose a pair of scan approaches in this paper; in the first approach, a test stimulus partially consists of the preceding stimulus, while in the second approach, a test stimulus partially consists of the preceding test response bits. Both proposed scan-based test schemes access only a subset of scan cells for loading the subsequent test stimulus while freezing the remaining scan cells with the preceding test data, thus decreasing scan chain transitions during shift operations. The proposed scan architecture is coupled with test data manipulation techniques which include test stimuli ordering and partitioning algorithms, boosting test time reductions. The experimental results confirm that test time reductions exceeding 97\%, and test power reductions exceeding 99\% can be achieved by the proposed scan-based testing methodologies on larger ISCAS89 benchmark circuits.

Key words: algebraic structure; cooperation; distributed expert systems; iso-morphic transformation; uncertain reasoning; group;

[1] Jas A, Touba N. Test vector decompression via cyclical scan chains and its application to testing core-based designs. In -\it Proc. International Test Conference}, Washington DC, USA, 1998, pp.458$\sim$464.

[2] Chandra A, Chakrabarty K. System-on-a-chip test-data compression architectures based on Golomb codes. -\it IEEE Trans. Computer-Aided Design}, March 2001, 20(3): 355$\sim$368.

[3] Bayraktaroglu I, Orailoglu A. Test volume and application time reduction through scan chain concealment. In -\it Proc. Design Automation Conference}, Las Vegas, NV, USA, 2001, pp.151$\sim$155.

[4] Wunderlich H J, Gerstendorfer S. Minimized power consumption for scan based BIST. In -\it Proc. International Test Conference}, Atlantic City, NJ, USA, 1999, pp.85$\sim$94.

[5] Whetsel L. Adapting scan architectures for low power operation. In -\it Proc. International Test Conference}, Atlantic City, NJ, USA, 2000, pp.863$\sim$872.

[6] Sinanoglu O, Bayraktaroglu I, Orailoglu A. Scan power reduction through test data transition frequency analysis. In -\it Proc. International Test Conference}, Baltimore, MD, USA, 2002, pp.844$\sim$850.

[7] Sinanoglu O, Orailoglu A. Modeling scan chain modifications for scan-in test power minimization. In -\it Proc. International Test Conference}, Charlotte, USA, 2003, pp.602$\sim$611.

[8] Sinanoglu O, Orailoglu A. Aggressive test power reduction through test stimuli transformation. In -\it Proc. International Conference on Computer Design}, San Jose, USA, 2003, pp.542$\sim$547.

[9] Jas A, Pouya B, Touba N. Virtual scan chains: A means for reducing scan length in cores. In -\it Proc. VLSI Test Symposium}, Montreal, Canada, 2000, pp.73$\sim$78.

[10] Hamzaoglu I, Patel J H. Reducing test application time for full scan embedded cores. In -\it Proc. International Symposium on Fault-Tolerant Computing}, Madison, USA, 1999, pp.260$\sim$267.

[11] Fujiwara H, Yamamoto A. Parity-scan design to reduce the cost of test application. -\it IEEE Transactions on Computer-Aided Design}, October 1993, 12(10): 1604$\sim$1611.

[12] Garey M, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.

[13] Brglez F, Fujiwara H. A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. In -\it Proc. IEEE Int. Symp. Circuits and Systems}, Kyoto, Japan, June 1985, 3(3): 785$\sim$794.

[14] Brglez F, Bryan D, Kozminski K. Combinational Profiles of Sequential Benchmark Circuits. -\it IEEE Int. Symp. Circuits and Systems}, Portland, USA, May 1989, 14(2): 1929$\sim$1934.

[15] Lee H K, Ha D S. On the generation of test patterns for combinational circuits. Technical Report 12-93, Department of Electrical Eng., Virginia Polytechnic Institute and State University.
[1] Qing-Mei Tan, Xu-Na Wang. Multi-Attribute Preferences Mining Method for Group Users with the Process of Noise Reduction [J]. Journal of Computer Science and Technology, 2021, 36(4): 944-960.
[2] Hua Chen, Juan Liu, Qing-Man Wen, Zhi-Qun Zuo, Jia-Sheng Liu, Jing Feng, Bao-Chuan Pang, Di Xiao. CytoBrain: Cervical Cancer Screening System Based on Deep Learning Technology [J]. Journal of Computer Science and Technology, 2021, 36(2): 347-360.
[3] Yu-Liang Ma, Ye Yuan, Fei-Da Zhu, Guo-Ren Wang, Jing Xiao, Jian-Zong Wang. Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks [J]. Journal of Computer Science and Technology, 2019, 34(1): 170-184.
[4] Bo-Han Li, An-Man Zhang, Wei Zheng, Shuo Wan, Xiao-Lin Qin, Xue Li, Hai-Lian Yin. GRIP: A Group Recommender Based on Interactive Preference Model [J]. Journal of Computer Science and Technology, 2018, 33(5): 1039-1055.
[5] Yan-Xia Xu, Wei Chen, Jia-Jie Xu, Zhi-Xu Li, Guan-Feng Liu, Lei Zhao. Discovering Functional Organized Point of Interest Groups for Spatial Keyword Recommendation [J]. Journal of Computer Science and Technology, 2018, 33(4): 697-710.
[6] Peng-Peng Zhao, Hai-Feng Zhu, Yanchi Liu, Zi-Ting Zhou, Zhi-Xu Li, Jia-Jie Xu, Lei Zhao, Victor S. Sheng. A Generative Model Approach for Geo-Social Group Recommendation [J]. , 2018, 33(4): 727-738.
[7] Hong-Cheng Huang, Jie Zhang, Zu-Fan Zhang, Zhong-Yang Xiong. Interference-Limited Device-to-Device Multi-User Cooperation Scheme for Optimization of Edge Networking [J]. , 2016, 31(6): 1096-1109.
[8] Xiao-Fen Wang, Yi Mu, Rongmao Chen, Xiao-Song Zhang. Secure Channel Free ID-Based Searchable Encryption for Peer-to-Peer Group [J]. , 2016, 31(5): 1012-1027.
[9] Sumyea Helal. Subgroup Discovery Algorithms: A Survey and Empirical Evaluation [J]. , 2016, 31(3): 561-576.
[10] Jing Jiang, Zi-Fei Shan, Xiao Wang, Li Zhang, Ya-Fei Dai. Understanding Sybil Groups in the Wild [J]. , 2015, 30(6): 1344-1357.
[11] Huai-Yu Wan, Zhi-Wei Wang You-Fang Lin, Xu-Guang Jia, Yuan-Wei Zhou. Discovering Family Groups in Passenger Social Networks [J]. , 2015, 30(5): 1141-1153.
[12] Chen-Da Hou, Dong Li, Jie-Fan Qiu, Hai-Long Shi, Li Cui. SeaHttp:A Resource-Oriented Protocol to Extend REST Style for Web of Things [J]. , 2014, 29(2): 205-215.
[13] Cheng-Wen Xing, Hai-Chuan Ding, Guang-Hua Yang, Shao-Dan Ma, and Ze-Song Fei. Outage Analysis of Opportunistic Cooperative Ad Hoc Networks with Randomly Located Nodes [J]. , 2013, 28(3): 403-411.
[14] You-Ming Qiao (乔友明), Jayalal Sarma M.N., and Bang-Sheng Tang (唐邦晟). On Isomorphism Testing of Groups with Normal Hall Subgroups [J]. , 2012, 27(4): 687-701.
[15] Yue-Hua Wang (王跃华), Student Member, IEEE, Zhong Zhou (周忠), Member, CCF, ACM, IEEE, Ling Liu, Senior Member, IEEE, and Wei Wu (吴威), Member, CCF. Fault Tolerance and Recovery for Group Communication Services in Distributed Networks [J]. , 2012, (2): 298-312.
Full text



[1] Liu Mingye; Hong Enyu;. Some Covering Problems and Their Solutions in Automatic Logic Synthesis Systems[J]. , 1986, 1(2): 83 -92 .
[2] Chen Shihua;. On the Structure of (Weak) Inverses of an (Weakly) Invertible Finite Automaton[J]. , 1986, 1(3): 92 -100 .
[3] Gao Qingshi; Zhang Xiang; Yang Shufan; Chen Shuqing;. Vector Computer 757[J]. , 1986, 1(3): 1 -14 .
[4] Chen Zhaoxiong; Gao Qingshi;. A Substitution Based Model for the Implementation of PROLOG——The Design and Implementation of LPROLOG[J]. , 1986, 1(4): 17 -26 .
[5] Huang Heyan;. A Parallel Implementation Model of HPARLOG[J]. , 1986, 1(4): 27 -38 .
[6] Min Yinghua; Han Zhide;. A Built-in Test Pattern Generator[J]. , 1986, 1(4): 62 -74 .
[7] Tang Tonggao; Zhao Zhaokeng;. Stack Method in Program Semantics[J]. , 1987, 2(1): 51 -63 .
[8] Min Yinghua;. Easy Test Generation PLAs[J]. , 1987, 2(1): 72 -80 .
[9] Zhu Hong;. Some Mathematical Properties of the Functional Programming Language FP[J]. , 1987, 2(3): 202 -216 .
[10] Li Minghui;. CAD System of Microprogrammed Digital Systems[J]. , 1987, 2(3): 226 -235 .

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved