A heuristic for multiple weight set generation

H. S. Kim, J. K. Lee, S. Kang

Research output: Contribution to conferencePaperpeer-review

3 Citations (Scopus)

Abstract

The number of weighted random patterns depends on the number of deterministic test patterns with a low sampling probability. The weight set that is extracted from the deterministic pattern set with high sampling probability reduces the number of test patterns. In the basis, in this paper we present a new deterministic pattern selection algorithm which generates high performance weight sets by removing deterministic patterns with low sampling frequencies. Simulation results using ISCAS 85 benchmark circuits prove the effectiveness of the new weight set generation algorithm.

Original languageEnglish
Pages513-514
Number of pages2
Publication statusPublished - 2001
EventIEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001) - Austin, TX, United States
Duration: 2001 Sept 232001 Sept 26

Other

OtherIEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001)
Country/TerritoryUnited States
CityAustin, TX
Period01/9/2301/9/26

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A heuristic for multiple weight set generation'. Together they form a unique fingerprint.

Cite this