Restoring and non-restoring array divider designs in Quantum-dot Cellular Automata

被引:64
|
作者
Sayedsalehi, Samira [1 ]
Azghadi, Mostafa Rahimi [2 ]
Angizi, Shaahin [3 ]
Navi, Keivan [3 ]
机构
[1] Islamic Azad Univ, South Tehran Branch, Fac Comp Engn, Tehran 1777613651, Iran
[2] Univ Adelaide, Sch Elect & Elect Engn, Adelaide, SA 5005, Australia
[3] Inst Res Fundamental Sci IPM, Sch Comp Sci, Tehran 1953833511, Iran
关键词
Quantum-dot Cellular Automata; Array divider; Restoring; Non-restoring; Full adder; MAJORITY GATE; CIRCUITS; DEVICES; QCA;
D O I
10.1016/j.ins.2015.03.030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum-dot Cellular Automata (QCA) is a very high speed, extra low power and extremely dense technology for implementing computing architectures which encodes binary logics through configuration of charges amongst quantum dots. Several studies of adders and multipliers in QCA have been proposed, whereas QCA divider design and implementation is a rather unexplored research area. In this paper the earliest designs for QCA dividers, which explore the restoring and non-restoring array dividers, considered as the best possible dividers, are introduced. These designs use well-organized arithmetic components as their basic construction parts and take some design rules into consideration which make them reliable and more robust against noise. These dividers with their design considerations and constraints are introduced step by step. Moreover, these designs are probed in terms of complexity, clocking and latency. QCADesigner, a simulation tool for QCA circuits, is used to check circuits' layout and functionality. (c) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:86 / 101
页数:16
相关论文
共 50 条
  • [41] Non-coplanar counter in quantum-dot cellular automata
    Heikalabad, Saeed Rasouli
    EUROPEAN PHYSICAL JOURNAL PLUS, 2021, 136 (02):
  • [42] Parallel-array implementations of a non-restoring square root algorithm
    Li, YM
    Chu, WM
    INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1997, : 690 - 695
  • [43] A First Step Toward Cost Functions for Quantum-Dot Cellular Automata Designs
    Liu, Weiqiang
    Lu, Liang
    O'Neill, Maire
    Swartzlander, Earl E., Jr.
    IEEE TRANSACTIONS ON NANOTECHNOLOGY, 2014, 13 (03) : 476 - 487
  • [44] Cost-efficient full adder designs in quantum-dot cellular automata
    Raj, Marshal
    Gopalakrishnan, Lakshminarayanan
    INTERNATIONAL JOURNAL OF MATERIALS & PRODUCT TECHNOLOGY, 2020, 61 (01): : 1 - 15
  • [45] New designs of fault-tolerant adders in quantum-dot cellular automata
    Ahmadpour, Seyed-Sajad
    Mosleh, Mohammad
    NANO COMMUNICATION NETWORKS, 2019, 19 : 10 - 25
  • [46] Design Rules for Quantum-dot Cellular Automata
    Liu, Weiqiang
    Lu, Liang
    O'Neill, Maire
    Swartzlander, Earl E., Jr.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2011, : 2361 - 2364
  • [47] Circuit switching with Quantum-Dot Cellular Automata
    Das, Jadav Chandra
    De, Debashis
    NANO COMMUNICATION NETWORKS, 2017, 14 : 16 - 28
  • [48] Quantum-dot cellular automata at a molecular scale
    Lieberman, M
    Chellamma, S
    Varughese, B
    Wang, YL
    Lent, C
    Bernstein, GH
    Snider, G
    Peiris, FC
    MOLECULAR ELECTRONICS II, 2002, 960 : 225 - 239
  • [49] Clocked molecular quantum-dot cellular automata
    Lent, CS
    Isaksen, B
    IEEE TRANSACTIONS ON ELECTRON DEVICES, 2003, 50 (09) : 1890 - 1896
  • [50] Clocking of molecular quantum-dot cellular automata
    Hennessy, K
    Lent, CS
    JOURNAL OF VACUUM SCIENCE & TECHNOLOGY B, 2001, 19 (05): : 1752 - 1755