Scalable identification of threshold logic functions

  • Authors:
  • Ashok kumar Palaniswamy;Manoj kumar Goparaju;Spyros Tragoudas

  • Affiliations:
  • Southern Illinois University, Carbondale, Carbondale, IL, USA;Southern Illinois University, Carbondale, Carbondale, IL, USA;Southern Illinois University, Carbondale, Carbondale, IL, USA

  • Venue:
  • Proceedings of the 20th symposium on Great lakes symposium on VLSI
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a scalable method to determine that a Boolean function is a threshold logic function. When the number of inputs of the function increases, identifying a threshold logic function is a laborious task. It is shown experimentally that the proposed method is faster and identifies more threshold logic functions with weight assignment than any other existing method.