Embedded Test Decompressor to Reduce the Required Channels and Vector Memory of Tester for Complex Processor Circuit

An embedded test stimulus decompressor is presented for the test patterns decompression, which can reduce the required channels and vector memory of automatic test equipment (ATE) for complex processor circuit. The proposed decompressor mainly consists of a periodically alterable MUX network which has multiple configurations to decode the input information flexibly and efficiently. In order to reduce the number of test patterns and configurations, a test patterns compaction algorithm, using CI-Graph merging, is proposed. With the proposed periodically alterable MUX network and the patterns compaction algorithm, smaller test data volume and required external pins can be achieved as compared to previous techniques

[1]  Lei Li,et al.  Test set embedding for deterministic BIST using a reconfigurable interconnection network , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Nilanjan Mukherjee,et al.  Embedded deterministic test , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Alex Orailoglu,et al.  Test volume and application time reduction through scan chain concealment , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[4]  Alex Orailoglu,et al.  Decompression hardware determination for test volume and time reduction through unified test pattern compaction and compression , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[5]  Huawei Li,et al.  Embedded test resource for SoC to reduce required tester channels based on advanced convolutional codes , 2006, IEEE Transactions on Instrumentation and Measurement.

[6]  Nur A. Touba,et al.  An efficient test vector compression scheme using selective Huffman coding , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Lei Li,et al.  Three-stage compression approach to reduce test data volume and testing time for IP cores in SOCs , 2005 .

[8]  Janak H. Patel,et al.  Test set compaction algorithms for combinational circuits , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[9]  Nur A. Touba,et al.  Virtual scan chains: a means for reducing scan length in cores , 2000, Proceedings 18th IEEE VLSI Test Symposium.

[10]  Nur A. Touba,et al.  Reducing test data volume using LFSR reseeding with seed compression , 2002, Proceedings. International Test Conference.

[11]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[12]  Krishnendu Chakrabarty,et al.  Test Data Compression and Test Resource Partitioning for System-on-a-Chip Using Frequency-Directed Run-Length (FDR) Codes , 2003, IEEE Trans. Computers.

[13]  Rohit Kapur,et al.  Changing the scan enable during shift , 2004, 22nd IEEE VLSI Test Symposium, 2004. Proceedings..

[14]  Wenjing Rao,et al.  Test application time and volume compression through seed overlapping , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[15]  Mark Mohammad Tehranipoor,et al.  Nine-coded compression technique for testing embedded cores in SoCs , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  Janak H. Patel,et al.  Reducing test application time for full scan embedded cores , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[17]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[18]  H. K. Lee,et al.  HOPE: an efficient parallel fault simulator , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[19]  Hisashi Kobayashi,et al.  Image Data Compression by Predictive Coding I: Prediction Algorithms , 1974, IBM J. Res. Dev..

[20]  Krishnendu Chakrabarty,et al.  System-on-a-chip test-data compression and decompressionarchitectures based on Golomb codes , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Alex Orailoglu,et al.  Reducing test application time through test data mutation encoding , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[22]  Lei Li,et al.  Efficient space/time compression to reduce test data volume and testing time for IP cores , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[23]  Sungho Kang,et al.  MICRO: a new hybrid test data compression/decompression scheme , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[24]  Subhasish Mitra,et al.  XPAND: an efficient test stimulus compression technique , 2006, IEEE Transactions on Computers.

[25]  Janak H. Patel,et al.  Test data compression and test time reduction of longest-path-per-gate tests based on Illinois scan architecture , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[26]  Dong Sam Ha,et al.  HOPE: an efficient parallel fault simulator for synchronous sequential circuits , 1992, DAC '92.

[27]  Nur A. Touba,et al.  3-stage variable length continuous-flow scan vector decompression scheme , 2004, 22nd IEEE VLSI Test Symposium, 2004. Proceedings..

[28]  J. Culberson.  Iterated Greedy Graph Coloring and the Difficulty Landscape , 1992 .

[29]  Shianling Wu,et al.  VirtualScan: a new compressed scan technology for test cost reduction , 2004 .

[30]  Weiwu Hu,et al.  Microarchitecture of the Godson-2 Processor , 2005, Journal of Computer Science and Technology.

[31]  Sarita Thakar,et al.  On the generation of test patterns for combinational circuits , 1993 .

[32]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .