+

Szyprowski et al., 2012 - Google Patents

A study of optimal 4-bit reversible circuit synthesis from mixed-polarity Toffoli gates

Szyprowski et al., 2012

Document ID
11976767419286987089
Author
Szyprowski M
Kerntopf P
Publication year
Publication venue
2012 12th IEEE International Conference on Nanotechnology (IEEE-NANO)

External Links

Snippet

Optimal synthesis of reversible circuits is a very hard task. In 2010, a method and a tool of practical usage for finding optimal circuits built from multi-control Toffoli gates for any 4-bit reversible specification were finally developed. In 2011 we published an extension to the …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/50—Adding; Subtracting
    • G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
    • G06F7/506—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination with simultaneous carry generation for, or propagation over, two or more stages
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
Miller et al. On the construction of multiple-valued decision diagrams
Wille et al. Effect of BDD optimization on synthesis of reversible and quantum logic
Datta et al. Exploiting negative control lines in the optimization of reversible circuits
Szyprowski et al. A study of optimal 4-bit reversible circuit synthesis from mixed-polarity Toffoli gates
Cheng et al. Heuristic synthesis of reversible logic-a comparative study
Noorallahzadeh et al. A new design of parity-preserving reversible multipliers based on multiple-control toffoli synthesis targeting emerging quantum circuits
Chattopadhyay et al. Reversible logic synthesis via biconditional binary decision diagrams
Krishna et al. Efficient reversible logic synthesis via isomorphic subgraph matching
Szyprowski et al. Optimal 4-bit reversible mixed-polarity Toffoli circuits
Morrison et al. A novel optimization method for reversible logic circuit minimization
Aruna et al. A quantum cost efficient reversible multiplexer for low power applications
Hattori et al. Mapping a quantum circuit to 2D nearest neighbor architecture by changing the gate order
Bos et al. ECM at work
Zheng et al. A novel Toffoli network synthesis algorithm for reversible logic
Haghparast et al. Optimization approaches for designing quantum reversible arithmetic logic unit
Lancellotti et al. Design of a Quantum walk circuit to solve the subset-sum problem
WO2019208581A1 (en) Invertible logic circuit device
Khan et al. Reconfigurable lower-part approximate adder with error-tolerant application: an approach using QCA computing
Sanaee et al. Generating Toffoli networks from ESOP expressions
Jegier et al. An approach to constructing reversible multi-qubit benchmarks with provably minimal implementations
Tran et al. Synthesis of reversible circuits based on EXORs of products of EXORs
Voudouris et al. Decomposition of multi-output boolean functions
Pang et al. A novel method of synthesizing reversible logic
El-Razouk Novel trace-based construction of the parallel-in-serial-out multiplication for elliptic curve digital signature algorithm like binary extension fields
Datta et al. Group theory based reversible logic synthesis
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载