Scan-chain partition for high test-data compressibility and low shift power under routing constraint

  • Authors:
  • Sying-Jyan Wang;Katherine Shu-Min Li;Shih-Cheng Chen;Huai-Yan Shiu;Yun-Lung Chu

  • Affiliations:
  • Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan;Global Unichip Corporation, Hsinchu, Taiwan;Chinese Army, Taiwan;Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan

  • Venue:
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.03

Visualization

Abstract

The degree of achievable test-data compression depends on not only the compression scheme but also the structure of the applied test data. Therefore, it is possible to improve the compression rate of a given test set by carefully organizing the way that test data are present in the scan structure. The relationship between signal probability and test-data entropy is explored in this paper, and the results show that the theoretical maximum compression can be increased through a partition of scan flip-flops such that the test data present in each partition have a skewed signal distribution. In essence, this approach simply puts similar scan flip-flops in an adjacent part of a scan chain, which also helps to reduce shift power in the scan test process. Furthermore, it is shown that the intrapartition scan-chain order has little impact on the compressibility of a test set; thus, it is easy to achieve higher test compression with low routing overhead. Experimental results show that the proposed partition method can raise the compression rates of various compression schemes by more than 17%, and the average reduction in shift power is about 50%. In contrast, the increase in routing length is limited.