• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Chen Tian, Liang Huaguo, Wang Wei, Yi Maoxiang, Huang Zhengfeng. A Test Compression Scheme Based on LFSR Reseeding and Optimized Coding[J]. Journal of Computer Research and Development, 2012, 49(2): 443-451.
Citation: Chen Tian, Liang Huaguo, Wang Wei, Yi Maoxiang, Huang Zhengfeng. A Test Compression Scheme Based on LFSR Reseeding and Optimized Coding[J]. Journal of Computer Research and Development, 2012, 49(2): 443-451.

A Test Compression Scheme Based on LFSR Reseeding and Optimized Coding

More Information
  • Published Date: February 14, 2012
  • The high density and large-scale IC meets lots of problems during testing, such as huge amount of test data, excessive test power dissipation and so on. This paper presents a scheme of test data compression, which optimizes a set of deterministic test cubes by encoding approach before using linear feedback shift register (LFSR) reseeding. The deterministic test set is obtained by using an automatic test pattern generation (ATPG) software. The test set is compressed to a seed set and stored in ROM on the chip. In the process of compression, firstly, a few specified bits are used to encode partial test cubes for enhancing the consistency between adjacent bits of the cube. This process is aimed at reducing test power. Secondly, in order to improve the encoding efficiency of test compression and even further reduce test storage, the test cubes are encoded to new test cubes by compatible block code (CBC). Finally, the new test cubes are compressed to LFSR seeds. The specified bits in test set encoded with CBC are much less than the original deterministic test set, so the number of stages in LFSR is reduced. Experimental results on ISCAS-89 benchmark show that the scheme can not only reduce test power but also increase the encoding efficiency.
  • Related Articles

    [1]Li Mingyue, Luo Xiangyang, Chai Lixiang, Yuan Fuxiang, GanYong. City-Level IP Geolocation Method Based on Network Node Clustering[J]. Journal of Computer Research and Development, 2019, 56(3): 467-479. DOI: 10.7544/issn1000-1239.2019.20170473
    [2]Wang Changda, Huang Lei, Liu Zhifeng. Information Hiding Algorithm of IP Covert Timing Channels and Its Performance Analysis[J]. Journal of Computer Research and Development, 2016, 53(5): 988-999. DOI: 10.7544/issn1000-1239.2016.20150063
    [3]Wang Zhiwei and Zhang Wei. ID Based Signature Scheme from Strong RSA Assumption in the Standard Model[J]. Journal of Computer Research and Development, 2013, 50(2): 302-306.
    [4]Gao Haiying. Provable Secure ID-Based Authenticated Key Agreement Protocol[J]. Journal of Computer Research and Development, 2012, 49(8): 1685-1689.
    [5]Zhou Yousheng, Sun Yanbin, Qing Sihan, Yang Yixian. An Efficient ID-Based Verifiably Encrypted Signature Scheme[J]. Journal of Computer Research and Development, 2011, 48(8): 1350-1356.
    [6]Lai Xin, Huang Xiaofang, He Dake. An ID-Based Efficient Signcryption Key Encapsulation Scheme[J]. Journal of Computer Research and Development, 2009, 46(5): 857-863.
    [7]Zhou Ling, Sun Yamin. Research on Multicast Routing Algorithm for Mobile IP Based on Bone Node Set[J]. Journal of Computer Research and Development, 2008, 45(7): 1126-1132.
    [8]Wang Li, Xu Mingwei, and Xu Ke. On the Deployment Approach of IPSec and IP Filter in Routers[J]. Journal of Computer Research and Development, 2006, 43(3): 375-380.
    [9]Qu Haipeng, Li Dequan, Su Purui, Feng Dengguo. An IP Traceback Scheme with Packet Marking in Blocks[J]. Journal of Computer Research and Development, 2005, 42(12): 2084-2092.
    [10]Wu Yichuan, Huang Kui, Zheng Jianping, Sun Limin, and Cheng Weiming. An Adaptive Robust TCP/IP Header Compression Algorithm[J]. Journal of Computer Research and Development, 2005, 42(4): 655-661.

Catalog

    Article views (625) PDF downloads (614) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return