Quantum-dot cellular automata based reversible low power parity generator and parity checker design for nanocommunication

被引:57
作者
Das, Jadav Chandra [1 ]
De, Debashis [1 ,2 ]
机构
[1] West Bengal Univ Technol, Dept Comp Sci & Engn, Kolkata 700064, India
[2] Univ Western Australia, Dept Phys, Crawley, WA 6009, Australia
关键词
Quantum-dot cellular automata (QCA); Parity generator; Parity checker; Feynman gate; Nanocommunication; Power dissipation; GATES; REALIZATION; SIMULATION; CIRCUITS; ADDER;
D O I
10.1631/FITEE.1500079
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum-dot cellular automata (QCA) is an emerging area of research in reversible computing. It can be used to design nanoscale circuits. In nanocommunication, the detection and correction of errors in a received message is a major factor. Besides, device density and power dissipation are the key issues in the nanocommunication architecture. For the first time, QCA-based designs of the reversible low-power odd parity generator and odd parity checker using the Feynman gate have been achieved in this study. Using the proposed parity generator and parity checker circuit, a nanocommunication architecture is proposed. The detection of errors in the received message during transmission is also explored. The proposed QCA Feynman gate outshines the existing ones in terms of area, cell count, and delay. The quantum costs of the proposed conventional reversible circuits and their QCA layouts are calculated and compared, which establishes that the proposed QCA circuits have very low quantum cost compared to conventional designs. The energy dissipation by the layouts is estimated, which ensures the possibility of QCA nano-device serving as an alternative platform for the implementation of reversible circuits. The stability of the proposed circuits under thermal randomness is analyzed, showing the operational efficiency of the circuits. The simulation results of the proposed design are tested with theoretical values, showing the accuracy of the circuits. The proposed circuits can be used to design more complex low-power nanoscale lossless nanocommunication architecture such as nano-transmitters and nano-receivers.
引用
收藏
页码:224 / 236
页数:13
相关论文
共 32 条
  • [21] Implementing a one-bit reversible full adder using quantum-dot cellular automata
    Mohammadi, Zahra
    Mohammadi, Majid
    [J]. QUANTUM INFORMATION PROCESSING, 2014, 13 (09) : 2127 - 2147
  • [22] Realization of a functional cell for quantum-dot cellular automata
    Orlov, AO
    Amlani, I
    Bernstein, GH
    Lent, CS
    Snider, GL
    [J]. SCIENCE, 1997, 277 (5328) : 928 - 930
  • [23] Efficient Design of a Hybrid Adder in Quantum-Dot Cellular Automata
    Pudi, Vikramkumar
    Sridharan, K.
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (09) : 1535 - 1548
  • [24] Rahman M.A., 2013, INT J COMPUT SCI ISS, V10, P167
  • [25] Designing efficient QCA logical circuits with power dissipation analysis
    Sheikhfaal, Shadi
    Angizi, Shaahin
    Sarmadi, Soheil
    Moaiyeri, Mohammad Hossein
    Sayedsalehi, Samira
    [J]. MICROELECTRONICS JOURNAL, 2015, 46 (06) : 462 - 471
  • [26] Robust Serial Nanocommunication With QCA
    Silva, Douglas S.
    Sardinha, Luiz H. B.
    Vieira, Marcos A. M.
    Vieira, Luiz F. M.
    Vilela Neto, Omar P.
    [J]. IEEE TRANSACTIONS ON NANOTECHNOLOGY, 2015, 14 (03) : 464 - 472
  • [27] Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate
    Smolin, JA
    DiVincenzo, DP
    [J]. PHYSICAL REVIEW A, 1996, 53 (04): : 2855 - 2856
  • [28] Srivastava S, 2011, IEEE INT SYMP CIRC S, P2377
  • [29] QCADesigner: A rapid design and simulation tool for quantum-dot cellular automata
    Walus, K
    Dysart, TJ
    Jullien, GA
    Budiman, RA
    [J]. IEEE TRANSACTIONS ON NANOTECHNOLOGY, 2004, 3 (01) : 26 - 31
  • [30] Design of dual-edge triggered flip-flops based on quantum-dot cellular automata
    Xiao, Lin-rong
    Chen, Xie-xiong
    Ying, Shi-yan
    [J]. JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, 2012, 13 (05): : 385 - 392