Jayanta Pal, Dhrubajyoti Bhowmik, A. Singh, Apu Saha, B. Sen
{"title":"Synthesis of composite logic gate in QCA embedding underlying regular clocking","authors":"Jayanta Pal, Dhrubajyoti Bhowmik, A. Singh, Apu Saha, B. Sen","doi":"10.2298/fuee2101115p","DOIUrl":null,"url":null,"abstract":"Quantum-dot Cellular Automata (QCA) has emerged as one of the alternative\n technologies for current CMOS technology. It has the advantage of computing\n at a faster speed, consuming lower power, and work at Nano- Scale. Besides\n these advantages, QCA logic is limited to its primitive gates, majority\n voter and inverter only, results in limitation of cost-efficient logic\n circuit realization. Numerous designs have been proposed to realize various\n intricate logic gates in QCA at the penalty of non-uniform clocking and\n improper layout. This paper proposes a Composite Gate (CG) in QCA, which\n realizes all the essential digital logic gates such as AND, NAND, Inverter,\n OR, NOR, and exclusive gates like XOR and XNOR. Reportedly, the proposed\n design is the first of its kind to generate all basic logic in a single\n unit. The most striking feature of this work is the augmentation of the\n underlying clocking circuit with the logic block, making it a more realistic\n circuit. The Reliable, Efficient, and Scalable (RES) underlying regular\n clocking scheme is utilized to enhance the proposed design?s scalability and\n efficiency. The relevance of the proposed design is best cited with coplanar\n implementation of 2-input symmetric functions, achieving 33% gain in gate\n count and without any garbage output. The evaluation and analysis of\n dissipated energy for both the design have been carried out. The end product\n is verified using the QCADesigner2.0.3 simulator, and QCAPro is employed for\n the study of power dissipation.","PeriodicalId":44296,"journal":{"name":"Facta Universitatis-Series Electronics and Energetics","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Facta Universitatis-Series Electronics and Energetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/fuee2101115p","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 2
Abstract
Quantum-dot Cellular Automata (QCA) has emerged as one of the alternative
technologies for current CMOS technology. It has the advantage of computing
at a faster speed, consuming lower power, and work at Nano- Scale. Besides
these advantages, QCA logic is limited to its primitive gates, majority
voter and inverter only, results in limitation of cost-efficient logic
circuit realization. Numerous designs have been proposed to realize various
intricate logic gates in QCA at the penalty of non-uniform clocking and
improper layout. This paper proposes a Composite Gate (CG) in QCA, which
realizes all the essential digital logic gates such as AND, NAND, Inverter,
OR, NOR, and exclusive gates like XOR and XNOR. Reportedly, the proposed
design is the first of its kind to generate all basic logic in a single
unit. The most striking feature of this work is the augmentation of the
underlying clocking circuit with the logic block, making it a more realistic
circuit. The Reliable, Efficient, and Scalable (RES) underlying regular
clocking scheme is utilized to enhance the proposed design?s scalability and
efficiency. The relevance of the proposed design is best cited with coplanar
implementation of 2-input symmetric functions, achieving 33% gain in gate
count and without any garbage output. The evaluation and analysis of
dissipated energy for both the design have been carried out. The end product
is verified using the QCADesigner2.0.3 simulator, and QCAPro is employed for
the study of power dissipation.