• DocumentCode
    1572117
  • Title

    On computing addition related arithmetic operations via controlled transport of charge

  • Author

    Cotofana, Sorin ; Lageweg, Casper ; Vassiliadis, Stamatis

  • Author_Institution
    Comput. Eng. Lab., Delft Univ. of Technol., Netherlands
  • fYear
    2003
  • Firstpage
    245
  • Lastpage
    252
  • Abstract
    We investigate the implementation of basic arithmetic functions, such as addition and multiplication, in single electron tunneling (SET) technology. First, we describe the SET equivalents of Boolean CMOS gates and threshold logic gates. Second, we propose a set of building blocks, which can be utilized for a novel design style, namely arithmetic operations performed by direct manipulation of the location of individual electrons within the system. Using this new set of building blocks, we propose several novel approaches for computing addition related arithmetic operations via the controlled transport of charge (individual electrons). In particular, we prove the following: n-bit addition can be implemented with a depth-2 network built with O(n) circuit elements; n-input parity can be computed with a depth-2 network constructed with O(n) circuit elements and the same applies for n/logn counters; multiple operand addition of m n-bit operands can be implemented with a depth-2 network using O(mn) circuit elements; and finally n-bit multiplication can be implemented with a depth-3 network built with O(n) circuit elements.
  • Keywords
    CMOS logic circuits; adders; digital arithmetic; logic gates; single electron transistors; threshold logic; tunnelling; CMOS gates; SET; arithmetic operation; controlled charge transport; single electron tunneling technology; threshold logic gates; Boolean functions; CMOS logic circuits; CMOS technology; Computer networks; Counting circuits; Digital arithmetic; Electrons; Laboratories; Logic gates; Tunneling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic, 2003. Proceedings. 16th IEEE Symposium on
  • ISSN
    1063-6889
  • Print_ISBN
    0-7695-1894-X
  • Type

    conf

  • DOI
    10.1109/ARITH.2003.1207685
  • Filename
    1207685