Now showing items 65-76 of 76

    • The Subgroups of S6 in Cycle Form 

      Maurer, Peter M. (2012-01-19)
      This technical report lists all subgroups of S6 in cycle form using the integers 0-5.
    • The Super Symmetric Representations of S4 in GL3(2) 

      Maurer, Peter M. (2013-09-20)
      This report gives all conjugacy classes of the super symmetric groups HR3 and VR3
    • Super Symmetry 

      Maurer, Peter M. (2013-09-20)
      Super symmetry is a type of matrix-based symmetry that extends the concept of total symmetry. Super symmetric functions are “even more symmetric” than totally symmetric functions. Even if a function is not super ...
    • Three-Valued Simulation with the Inversion Algorithm 

      Maurer, Peter M. (2009-11-05)
      The Inversion Algorithm is an event-driven logic simulation technique that is competitive with Levelized Compiled Code Simulation. Previous versions of the Inversion Algorithm have been limited to purely binary simulation. ...
    • TOKDEC: A Tool for Compiler Debugging 

      Maurer, Peter M. (2009-11-13)
      TOKDEC is a tool that helps create compiler debugging code by converting numeric tokens into character strings. It is meant to be used with the output of the “yacc” preprocessor.
    • Two New Techniques for Unit-Delay Compiled Simulation 

      Maurer, Peter M. (2009-11-05)
      The PC-set method and the parallel technique are two methods for generating compiled unit-delay simulations of acyclic circuits. The PC-set method analyzes the network, determines the set of potential change times for each ...
    • Unit Delay Scheduling for the Inversion Algorithm 

      Maurer, Peter M. (2009-11-05)
      The Inversion Algorithm is an event driven algorithm whose performance meets or exceeds that of Levelized Compiled Code simulation, even when the activity rate is unrealistically high. Existing implementations of the ...
    • A Universal Symmetry Detection Algorithm 

      Maurer, Peter M. (2013-09-20)
      Research on symmetry detection focuses on identifying and detecting new types of symmetry. We present an algorithm that is capable of detecting any type of permutation based symmetry, including many types for which there ...
    • Using GF(2) matrices in Simulation and Logic Synthesis 

      Maurer, Peter M. (2009-01-23)
      GF(2) matrices are matrices of ones and zeros under modulo 2 arithmetic. Like the GF(2) polynomials used in error detection and correction, they have many potential uses in Electronic Design Automation (EDA). Non-singular ...
    • Using GF2 Matrices to Simplify Boolean Logic 

      Maurer, Peter M. (2009-01-23)
      Conventional logic simplification can be couched in terms of singular GF(2) matrices. The advantage to doing this is that different matrices can be used to combine terms that are separated by a Hamming distance greater ...
    • Using the Connlib Package to Obtain Parsed Netlist Data 

      Maurer, Peter M. (2009-11-05)
      The connlib package can be used to obtain parsed netlist data from “.ckt” files. These files must be created using the Functional Hardware Description Language FHDL. This data can be used in any way you choose. The ISCAS85 ...
    • Why is Symmetry So Hard? 

      Maurer, Peter M. (2011-05-13)
      The problem of detecting virtually any type of symmetry is shown to be co-NP-complete. We start with totally symmetric functions, then extend the result to partially symmetric functions, then to more general cofactor ...