A Straightforward Method to Judge the Completeness of a Polymorphic Gate Set

09/10/2017
by   Zhifang Li, et al.
0

Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of polymorphic circuits, including the definition of complete polymorphic gate sets and algorithms to judge the completeness of a polymorphic gate set. However, the previous algorithms have to enumerate all the polymorphic signals for judging the completeness of a polymorphic gate set, and it is not easy to be conducted manually. In this paper, a straightforward method is proposed to judge the completeness of a polymorphic gate set. And the correctness of the straightforward method is proved theoretically. Some examples are given to show that the proposed method could be conducted step by step. Its actual computing cost is usually low, and it is suitable for manual operation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2017

Design Methods for Polymorphic Combinational Logic Circuits based on the Bi_Decomposition Approach

Polymorphic circuits are a special kind of digital logic components, whi...
research
04/19/2022

Quartz: Superoptimization of Quantum Circuits (Extended Version)

Existing quantum compilers optimize quantum circuits by applying circuit...
research
04/11/2020

The ZX calculus: A complete graphical calculus for classical circuits using spiders

We give a complete presentation for the fragment, ZX , of the ZX-calcu...
research
09/13/2021

Generators and Relations for Real Stabilizer Operators

Real stabilizer operators, which are also known as real Clifford operato...
research
05/30/2019

Quantization Loss Re-Learning Method

In order to quantize the gate parameters of the LSTM (Long Short-Term Me...
research
04/27/2018

The category TOF

We provide a complete set of identities for the symmetric monoidal categ...
research
09/01/2021

Irredundant Buffer and Splitter Insertion and Scheduling-Based Optimization for AQFP Circuits

The adiabatic quantum-flux parametron (AQFP) is a promising energy-effic...

Please sign up or login with your details

Forgot password? Click here to reset