LCC simulators speed development of synchronous hardware
Computer Design
Demand driven simulation: BACKSIM
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Generalized Reed-Muller Forms as a Tool to Detect Symmetries
IEEE Transactions on Computers
The Unison algorithm: fast evaluation of Boolean expressions
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Unit delay simulation with the inversion algorithm
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Digital system simulation: methodologies and examples
DAC '98 Proceedings of the 35th annual Design Automation Conference
Hybrid techniques for fast functional simulation
DAC '98 Proceedings of the 35th annual Design Automation Conference
Enhancing simulation with BDDs and ATPG
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Reliable verification using symbolic simulation with scalar values
Proceedings of the 37th Annual Design Automation Conference
Event manipulation for discrete simulations requiring large numbers of events
Communications of the ACM
Proceedings of the 38th annual Design Automation Conference
A fast, inexpensive and scalable hardware acceleration technique for functional simulation
Proceedings of the 39th annual Design Automation Conference
Event driven simulation without loops or conditionals
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Generalized symmetries in boolean functions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Limits of Using Signatures for Permutation Independent Boolean Comparison
Formal Methods in System Design
Improvements in functional simulation addressing challenges in large, distributed industry projects
Proceedings of the 40th annual Design Automation Conference
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Using conjugate symmetries to enhance gate-level simulations
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Exploiting Regularities for Boolean Function Synthesis
Theory of Computing Systems
DRedSOP: Synthesis of a New Class of Regular Functions
DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
Synthesis of Autosymmetric Functions in a New Three-Level Form
Theory of Computing Systems
A model and implementation of a universal time delay simulator for large digital nets
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
The inversion algorithm for digital simulation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Three-level logic minimization based on function regularities
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient event-driven simulation by exploiting the output observability of gate clusters
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Extending symmetric variable-pair transitivities using state-space transformations
Proceedings of the great lakes symposium on VLSI
| Hi-index | 0.00 |
Conjugate symmetry is an entirely new approach to symmetric Boolean functions that can be used to extend existing methods for handling symmetric functions to a much wider class of functions. These are functions that currently appear to have no symmetries of any kind. Conjugate symmetries occur widely in practice. In fact, we show that even the simplest circuits exhibit conjugate symmetry. To demonstrate the effectiveness of conjugate symmetry we modify an existing simulation algorithm, the hyperlinear algorithm, to take advantage of conjugate symmetry. This algorithm can simulate symmetric functions faster than non-symmetric ones, but due to the rarity of symmetric functions, this optimization is of limited benefit. Because the standard benchmark circuits contain many symmetries it is possible to simulate these circuits faster than is possible with the fastest known event-driven algorithm. The detection and exploitation of conjugate symmetries makes use of GF(2) matrices. It is likely that conjugate symmetry and GF(2) matrices will find applications in many other areas of EDA.