Scan Data Volume Reduction Using Periodically Alterable MUXs Decompressor

This paper presents a decompression architecture using a periodically alterable MUXs decompressor for scan data volume reduction. Compared to static XOR network, the periodically alterable MUXs decompressor has multiple configurations to decode the input information more efficiently. Three different DFT techniques are proposed to handle hard, firm and soft cores, respectively. With the proposed pattern decompression algorithms and scan decompression architecture, smaller test data volume and test application time can be achieved as compared to previous techniques.

[1]  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..

[2]  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..

[3]  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).

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

[5]  Krishnendu Chakrabarty,et al.  Nine-coded compression technique with application to reduced pin-count testing and flexible on-chip decompression , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[6]  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.

[7]  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.

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

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

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

[11]  Kuen-Jong Lee,et al.  Using a single input to support multiple scan chains , 1998, ICCAD '98.

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

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

[14]  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..

[15]  Bashir M. Al-Hashimi,et al.  Integrated test data decompression and core wrapper design for low-cost system-on-a-chip testing , 2002, Proceedings. International Test Conference.

[16]  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).

[17]  Rohit Kapur,et al.  A reconfigurable shared scan-in architecture , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

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

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

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

[21]  Lei Li,et al.  Test Data Compression Using Dictionaries with Fixed-Length Indices , 2003 .

[22]  Lei Li,et al.  Test data compression using dictionaries with fixed-length indices [SOC testing] , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[23]  Bapiraju Vinnakota,et al.  Combining dictionary coding and LFSR reseeding for test data compression , 2004, Proceedings. 41st Design Automation Conference, 2004..

[24]  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).

[25]  Lei Li,et al.  On combining pinpoint test set relaxation and run-length codes for reducing test data volume , 2003, Proceedings 21st International Conference on Computer Design.

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