Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1785481.1785545 | ACM Great Lakes Symposium on VLSI |
Keywords | Field | DocType |
boolean function,scalable identification,existing method,weight assignment,threshold logic function,laborious task,function increase,scalable method | Boolean function,Boolean circuit,Digital electronics,Logic gate,Sequential logic,High Threshold Logic,Logic optimization,Computer science,Algorithm,Majority function | Conference |
Citations | PageRank | References |
4 | 0.45 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashok kumar Palaniswamy | 1 | 28 | 3.06 |
| Manoj Kumar Goparaju | 2 | 23 | 2.64 |
| Spyros Tragoudas | 3 | 625 | 88.87 |