• Corpus ID: 54199189

Fast Extract with Cube Hashing Work presented in partial fulfillment of the requirements for the degree of Bachelor in Computer

@inproceedings{Schmitt2016FastEW,
  title={Fast Extract with Cube Hashing Work presented in partial fulfillment of the requirements for the degree of Bachelor in Computer},
  author={Dennis Schmitt and Rui Vicente Oppermann and Vladimir Pinheiro do Nascimento and Lu{\'i}s da Cunha and Raul Fernando Weber},
  year={2016}
}
The fast-extract algorithm is a well-known algebraic method for factoring and decomposing Boolean expressions. Since it uses pairwise comparisons between cubes to find factors, the run-time is degraded for networks whose primary outputs are expressed in terms of primary inputs and have Boolean functions with thousands of cubes. This work describes a new implementation of the fast-extract algorithm, fxch, having complexity linear in the number of cubes. The reduction in complexity is achieved by… 

References

SHOWING 1-10 OF 17 REFERENCES
A Linear Divisor Extraction Algorithm
TLDR
FXCH can be used to synthesize depth-bounded networks, and features a novel post-processing step to factor out shared logic from the output plane of a multi-output SOP, which leads to speed-ups in practical applications with large SOPs.
A method for concurrent decomposition and factorization of Boolean expressions
  • J. Vasudevamurthy, J. Rajski
  • Computer Science
    1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
  • 1990
TLDR
It is demonstrated that these objects, despite their simplicity, provide a very good framework to reason about common algebraic divisors and the duality relations between expressions.
Read-polarity-once Boolean functions
TLDR
This work proposes a domain transformation that splits existing binate variables into two independent unate variables, which leads to ISF, which can be efficiently factored by applying the proposed algorithm.
A Domain-Transformation Approach to Synthesize Read-Polarity-Once Boolean Functions
TLDR
This work proposes a domain transformation that splits existing binate variables into two independent unate variables, which leads to ISFs, which can be efficiently factored by applying the proposed algorithm.
Boolean factoring with multi-objective goals
TLDR
This paper introduces a new algorithm for Boolean factoring based on a novel synthesis paradigm, functional composition, which performs synthesis by associating simpler sub-solutions with minimum costs.
Application of a Key–Value Paradigm to Logic Factoring
TLDR
A scalable factoring algorithm that reduces its dependence on the two-level minimization is described and is implemented using a new distributed environment that harnesses the key-value concept to find solutions through systematic transformations of a data set.
Jezz: An effective legalization algorithm for minimum displacement
In this paper, we present a new method for circuit legalization called Jezz, which is, on average, 42.7% better than the classic legalization algorithm Tetris in terms of overall cell displacement,
Two-level logic minimization: an overview
Electronic Design Automation: Synthesis, Verification, and Test
TLDR
EDA/VLSI practitioners and researchers in need of fluency in an "adjacent" field will find this an invaluable reference to the basic EDA concepts, principles, data structures, algorithms, and architectures for the design, verification, and test of VLSI circuits.
Synthesis and Optimization of Digital Circuits
TLDR
This book covers techniques for synthesis and optimization of digital circuits at the architectural and logic levels, i.e., the generation of performance-and-or area-optimal circuits representations from models in hardware description languages.
...
1
2
...