26,439 research outputs found
Limits on Fundamental Limits to Computation
An indispensable part of our lives, computing has also become essential to
industries and governments. Steady improvements in computer hardware have been
supported by periodic doubling of transistor densities in integrated circuits
over the last fifty years. Such Moore scaling now requires increasingly heroic
efforts, stimulating research in alternative hardware and stirring controversy.
To help evaluate emerging technologies and enrich our understanding of
integrated-circuit scaling, we review fundamental limits to computation: in
manufacturing, energy, physical space, design and verification effort, and
algorithms. To outline what is achievable in principle and in practice, we
recall how some limits were circumvented, compare loose and tight limits. We
also point out that engineering difficulties encountered by emerging
technologies may indicate yet-unknown limits.Comment: 15 pages, 4 figures, 1 tabl
Application of Permutation Group Theory in Reversible Logic Synthesis
The paper discusses various applications of permutation group theory in the
synthesis of reversible logic circuits consisting of Toffoli gates with
negative control lines. An asymptotically optimal synthesis algorithm for
circuits consisting of gates from the NCT library is described. An algorithm
for gate complexity reduction, based on equivalent replacements of gates
compositions, is introduced. A new approach for combining a group-theory-based
synthesis algorithm with a Reed-Muller-spectra-based synthesis algorithm is
described. Experimental results are presented to show that the proposed
synthesis techniques allow a reduction in input lines count, gate complexity or
quantum cost of reversible circuits for various benchmark functions.Comment: In English, 15 pages, 2 figures, 7 tables. Proceeding of the RC 2016
conferenc
- …