Enhance prominent spectral component of test set by using KM algorithm
CSTR:
Author:
Affiliation:

1. College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China; 2. Guangdong Power Grid Co., Ltd. Zhuhai Power Supply Bureau, Zhuhai 519000, China

Clc Number:

TP302

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In the field of integrated circuit testing, in order to improve the test data compression ratio and test generation, it is often necessary to do spectral analysis of the test set and test response and calculate their prominent spectral component. A method is proposed to enhance the prominent spectral component of test set by using KM (KuhnMunkras) algorithm. Based on the test set and its prominent spectral component, a bipartite graph and a weighting matrix are constructed. The problem of the enhancement of prominent spectral component is transformed into a bipartite graph matching problem, and then be solved by KM algorithm. After the order adjustment of test set according to the matching relationship, the correlation between prominent component and test set is increased, and the prominent spectral component is enhanced. In this paper, the experimental results about the test set of the ISCAS89 benchmark circuits show that the coefficient of the sorted test can increase by 19.05% on average, and the test set residue compression ratio basis on FDR (frequencydirected runlength) code can increase by 4.59% on average.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: July 20,2017
  • Published:
Article QR Code