Header menu link for other important links
X
Low complexity design of ripple carry and brent-kung adders in QCA
Published in
2012
Volume: 11
   
Issue: 1
Pages: 105 - 119
Abstract
The design of adders on quantum dot cellular automata (QCA) has been of recent interest. While few designs exist, investigations on reduction of QCA primitives (majority gates and inverters) for various adders are limited. In this paper, we present a number of new results on majority logic. We use these results to present efficient QCA designs for the ripple carry adder (RCA) and various prefix adders. We derive bounds on the number of majority gates for n-bit RCA and n-bit rent-Kung, Kogge-Stone, Ladner-Fischer, and Han-Carlson adders. We further show that the Brent-Kung adder has lower delay than the best existing adder designs as well as other prefix adders. In addition, signal integrity and robustness studies show that the proposed Brent-Kung adder is fairly well-suited to changes in time-related parameters as well as temperature. Detailed simulations using QCADesigner are presented. © 2011 IEEE.
About the journal
JournalIEEE Transactions on Nanotechnology
ISSN1536125X
Open AccessNo
Concepts (14)
  •  related image
    Area
  •  related image
    BRENT-KUNG ADDERS
  •  related image
    Cell count
  •  related image
    KOGGE-STONE ADDER
  •  related image
    MAJORITY GATES
  •  related image
    QUANTUM DOT CELLULAR AUTOMATA
  •  related image
    RIPPLE CARRY ADDERS
  •  related image
    Cellular automata
  •  related image
    Design
  •  related image
    Electric inverters
  •  related image
    MAJORITY LOGIC
  •  related image
    Semiconductor quantum dots
  •  related image
    Sequential machines
  •  related image
    Adders