Hierarchical clustering driven test case selection in digital circuits

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The quality assurance of circuits is of major importance as the complexity of circuits is rising with their capabilities. Thus a high degree of testing is required to guarantee proper operation. If, on the other hand, too much time is spent in testing then this prolongs development time. The work presented in this paper proposes a methodology to select a minimal set of test cases for validating digital circuits with respect to their functional specification. We do this by employing hierarchical clustering algorithms to group test cases using a hamming distance similarity measure. The test cases are selected from the clusters, by our proposed approach of distance-based selection. Results are tested on the two circuits viz. Multiplier and Galois Field multiplier that exhibit similar behaviour but differ in the number of test cases and their implementation. It is shown that on small fraction values, distance-based selection can outperform traditional random-based selection by preserving diversity among the chosen test cases.

Cite

CITATION STYLE

APA

Ryan, C., Kshirsagar, M., Gupt, K. K., Rosenbauer, L., & Sullivan, J. P. (2021). Hierarchical clustering driven test case selection in digital circuits. In Proceedings of the 16th International Conference on Software Technologies, ICSOFT 2021 (pp. 589–596). SciTePress. https://doi.org/10.5220/0010605805890596

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free