LSAT-an algorithm for the synthesis of two level threshold gate networks
See where this sits in the topic map →Summary AI-generated
- TL;DR
- This paper presents LSAT, an algorithm for synthesizing two-level threshold gate networks using techniques inspired by classical logic circuit minimization.
- Problem
- The authors address a restricted version of the network synthesis problem in which the on-set and off-set minterms are explicitly listed.
- Method
- The approach utilizes a simple branch and bound algorithm designed to find near-optimal solutions.
- Results
- Experiments on standard problems demonstrate that the algorithm achieves solutions close to the absolute minimum, outperforming other minimizers even when restricted to classic logic gates.
- Contributions
- Not specified in the abstract.
- Limitations
- Not specified in the abstract.
- Takeaways
- The algorithm features a polynomial run time relative to the input size, with performance that degrades slowly as the problem scales.
- Applications
- Not specified in the abstract.
- Topics
- Not specified in the abstract.
- For industry
- Not specified in the abstract.
- Why it matters
- Not specified in the abstract.
Abstract
The authors present an algorithm for the synthesis of two-level threshold gate networks inspired by techniques used in classical two-level minimization of logic circuits. They specifically address a restricted version of the problem where the on and off set minterms are explicitly listed. Experimental results show that a simple branch and bound algorithm can be used to obtain solutions close to the absolute minimum in a set of standard problems, outperforming other minimizers even when restricted to using only classic logic gates as building blocks. The algorithm has a run time polynomial in the input size and its performance degrades slowly with the size of the problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>