Open Access Open Access  Restricted Access Subscription or Fee Access

Reduction of Test Data Volume Based On Viterbi Compression Algorithm

K.S. Neelukumari, A. Pavithra, N. Saranya, S. Vanitha


Test vector compression has been an active area of research, yielding a wide variety of techniques. A test pattern compression scheme is proposed in order to reduce test data volume and application time. The proposed scheme finds a set of compressed test vectors using the Viterbi algorithm instead of solving linear equations. By assigning a cost function to the branch metric of the Viterbi algorithm, an optimal compressed vector is selected among the possible solution set. This feature enables high flexibility to combine various test requirements such as low-power compression and/or improving capability to repeat test patterns. The proposed on chip decompressor follows the structure of Viterbi encoders which require only one input channel. Experimental results compared with the dictionary algorithm compression. Dictionary based compression techniques are also popular in embedded systems domain. Since they provide a dual advantage of good compression efficiency as well as fast decompression mechanism. Viterbi algorithm provides better compression ratio compared to dictionary algorithm.


Test Data Compression, Viterbi, Dictionary, Compression Efficiency

Full Text:



Dongsoo Lee, Student Member, and Kaushik Roy, “Viterbi-Based Efficient Test Data Compression” IEEE Trans. Comput.-Aided Des. Integr. Circuit Syst, vol. 31, no. 4, April 2012, pp.610-619

N. A. Touba, “Survey of test vector compression techniques,” IEEE Des. Test Comput., vol. 23, no. 4, pp. 294–303, Apr. 2006.

K. J. Balakrishnan and N. A. Touba, “Improving linear test data compression,” IEEE Trans. Very Large Scale Integr. Syst., vol. 14, no. 11, pp. 1227–1237, Nov. 2006.

Z. Wang, H. Fang, and K. Chakrabarty, “Deviation-based LFSR reseeding for test-data compression,” IEEE Trans. Comput.-Aided Des. Integr. Circuit Syst., vol. 28, no. 2, pp. 259–271, Feb. 2009.

L. Li, K. Chakrabarty, and N. Touba, “Test data compression using dictionaries with selective entries and fixed-length indices,” ACM Trans. Des. Autom. Electron. Syst., vol. 8, no. 4, pp. 470–490, 2003.

Wurtenberger, C. Tautermann, and S. Hellebrand, “Data compression for multiple scan chains using dictionaries with corrections,” in Proc. Int. Test Conf., 2004, pp. 926–935.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.