Abstract
Among cutting-edge nanotechnologies, quantum-dot cellular automata (QCA) is a well-matched substitute for transistor-based technologies. Full-adder as a primary element of computational circuits has a great effect on other circuits. Hence this paper presents a new schematic design of QCA full-adder (QFA) to implement an efficient layout with minimum cells. The simple structure of the proposed design in minimum latency makes the aforementioned layout unique among state-of-the-art QFAs. Besides, different sizes of ripple carry adder (RCA) are implemented using this efficient full-adder layout to show its applicability. The proposed design of this work are simulated using QCADesigner tool. Moreover, The proposed full-adder have verified with physical formulas. 32.43% decreasing cell count and 50% increasing speed is the result of a comparison between our optimum QFA layout and previously published design with a similar structure. Ultimately different sizes of ripple carry adders of this paper are compared to the previous layouts and results show the performance of suggested RCA’s structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abedi D, Jaberipur G, Sangsefidi M (2015) Coplanar full adder in quantum-dot cellular automata via clock-zone-based crossover. IEEE Trans Nanotechnol 14:497–504
Ahmad F, Bhat G, Khademolhosseini H, Azimi S, Angizi S, Navi K (2016) Towards single layer quantum-dot cellular automata adders based on explicit interaction of cells. J Comput Sci 16:8–15. https://doi.org/10.1016/j.jocs.2016.02.005
Akeela R, Wagh M (2011) A five input majority gate in quantum dot cellular automata. Nanotechnology 2:13–16
Angizi S, Sarmadi S, Sayedsalehi S, Navi K (2015) Design and evaluation of new majority gate-based ram cell in quantum-dot cellular automata. Microelectron J 46(1):43–51. https://doi.org/10.1016/j.mejo.2014.10.003
Chang C, Molahosseini A, Zarandi A, Tay T (2015) Residue number systems: a new paradigm to datapath optimization for low-power and high-performance digital signal processing applications. IEEE Circ Syst 15(4):26–44. https://doi.org/10.1109/MCAS.2015.2484118
Cho H, Swartzlander E (2007) Adder design and analyses for quantum-dot cellular automata. IEEE Trans Nano 6(3):374–384. https://doi.org/10.1109/TNANO.2007.894839
Cho H, Swartzlander E (2009) Adder and multiplier design in quantum-dot cellular automata. IEEE Trans Comput 58(6):721–727. https://doi.org/10.1109/TC.2009.21
Dalui M, Sen B, Sikdar B (2010) Fault tolerant qca logic design with coupled majorityminority gate. Int J Comput Appl 1:81–87
Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219–253
Goswami M, Sen B, Mukherjee R, Sikdar B (2017) Design of testable adder in quantum-dot cellular automata with fault secure logic. Microelectron J 60:1–12. https://doi.org/10.1016/j.mejo.2016.11.008
Goswami M, Roychoudhury M, Sarkar J, Sen B, Sikdar B (2020) An efficient inverter logic in quantum-dot cellular automata for emerging nanocircuits. Arab J Sci Eng 45:2663–2674. https://doi.org/10.1007/s13369-019-04103-2
Hanninen I, Takala J (2007) Robust adders based on quantum-dot cellular automata. In: 2007 IEEE international conf. on application-specific systems, architectures and processors (ASAP), pp 391–396
Haruehanroengra S, Wang W (2007) Efficient design of qca adder structures. Solid State Phenomena 121–123:553–556. https://doi.org/10.4028/www.scientific.net/SSP.121-123.553
Hashemi S, Navi K (2015) A novel robust qca full-adder. Procedia Mater Sci 11:376–380. https://doi.org/10.1016/j.mspro.2015.11.133
Hashemi S, Tehrani M, Navi K (2012) An efficient quantum-dot cellular automata full-adder. Sci Res Essays 7(2):177–189
Hayati M, Rezaei A (2012) Design and optimization of full comparator based on quantum-dot cellular automata. ETRI J 34(2):284–287. https://doi.org/10.4218/etrij.12.0211.0258
Heikalabad S, Karkaj E (2017) A testable parity conservative gate in quantum-dot cellular automata. Superlatt Microstruct 101:625–632. https://doi.org/10.1016/j.spmi.2016.08.054
Heikalabad S, Asfestani M, Hosseinzadeh M (2018) A full adder structure without cross-wiring in quantum-dot cellular automata with energy dissipation analysis. J Supercomput 74(5):1994–2005. https://doi.org/10.1007/s11227-017-2206-4
Jagarlamudi H, Saha M, Jagarlamudi P (2011) Quantum dot cellular automata based effective design of combinational and sequential logical structures. World Acad Sci Eng Technol 60:671–675. https://doi.org/10.5281/zenodo.1079046
Keshavarzian P, Sarikhani R (2013) A novel cntfet-based ternary full adder. Circ Syst Signal Process 33:665–679. https://doi.org/10.1007/s00034-013-9672-6
Kianpour M, Nadooshan R, Navi K (2014) A novel design of 8-bit adder/subtractor by quantum-dot cellular automata. J Comput Syst Sci 80:1404–1414
Kumar P, Singh S (2019) Optimization of the area efciency and robustness of a qca-based revrsible full adder. J Comput Electron 18:1478–1489. https://doi.org/10.1007/s10825-019-01369-5
Lakshmi S, Athisha G (2012) Design of logical structures and characteristics analysis of aoi for quantum dot cellular automata. SEAS Trans Circ Syst 11(1):11–20
Lent C, Tougaw P, Porod W, Bernstein G (1993) Quantum cellular automata. Nanotechnology 4(1):49–57
Lent S, Tougaw P (1997) A device architecture for computing with quantum dots. Proc IEEE 85(4):541–557. https://doi.org/10.1109/5.573740
Liu W, Lu L, Swartzlander E, Woods R (2011) Design of quantum-dot cellular automata circuits using cut-set retiming. IEEE Trans Nanotechnol 10:5
Mohammadi M (2009) Design and optimization of nanometeric reversible and quantum logiccircuits. Doctorate thesis, Shahid Beheshti University, Iran
Mohammadi M, Mohammadi M, Gorgin S (2016) An efficient design of fulladder in quantum-dot cellular automata (qca) technology. Microelectron J 50:35–43. https://doi.org/10.1016/j.mejo.2016.02.004
Mukhopadhyay D, Dutta P (2012) Quantum cellular automata based novel unit 2:1 multiplexer. Int J Comput Appl 43(2):22–25
Navi K, Farazkish R, Sayedsalehi S, Azghadi M (2010a) A new quantum-dot cellular automata full-adder. Microelectron J 41(12):820–826. https://doi.org/10.1016/j.mejo.2010.07.003
Navi K, Sayedsalehi S, Farazkish R, Azghadi M (2010b) Five-input majority gate, a new device for quantum-dot cellular automata. J Comput Theor Nanosci 7(8):1–8. https://doi.org/10.1166/jctn.2010.1517
Niemir M (2004) Designing digital systems in quantum cellular automata. Msc dissertation, Notre Dame University, Indiana
Oya T, Asai T, Fukui T, Amemiya Y (2003) A majority-logic device using an irreversible single-electron box. IEEE Trans Nanotechnol 2(1):15–22. https://doi.org/10.1109/TNANO.2003.808507
Purkayastha T, De D, Chattopadhyay T (2018) Planar fault-tolerant quantum cellular automata full adder. Nanomater Energy 7(1):9–15. https://doi.org/10.1680/jnaen.17.00007
Qanbari M, Nadooshan R (2013) Two novel quantum-dot cellular automata full adders. J Eng 2013:1–6. https://doi.org/10.1155/2013/561651
Ramesh B, Rani M (2016) Implementation of parallel adders using area efficient quantum dot cellular automata full adder. In: 2016 10th international conference on intelligent systems and control (ISCO), pp 1–5
Roohi A, Hosseini K, Sayedsalehi S, Navi K (2014a) A symmetric quantum- dot cellular automata design for 5-input majority gate. J Comput Electron 13(3):701–708
Roohi A, Khademolhosseini H, Sayedsalehi S, Navi K (2014b) A symmetric quantum-dot cellular automata design for 5-input majority gate. J Comput Electron 13(3):701–708. https://doi.org/10.1007/s10825-014-0589-5
Roohi A, Zand R, Angizi S, DeMara R (2018) A parity-preserving reversible qca gate with self-checking cascadable resiliency. IEEE Trans Emerg Top Comput 6(4):450–459. https://doi.org/10.1109/TETC.2016.2593634
Sasamal T, Singhb A, Mohan A (2016) An optimal design of full adder based on 5-input majority gate in coplanar quantum-dot cellular automata. Optik 127:8576–8591
Sen B, Rajoria A, Sikdar B (2013) Design of efficient full adder in quantum-dot cellular automata. Sci World J 2013:1. https://doi.org/10.1155/2013/250802
Sen B, Dutta M, Goswami M, Sikdar B (2014a) Modular design of testable reversible ALU by QCA multiplexer with increase in programmability. Microelectron J 45(11):1522–1532. https://doi.org/10.1016/j.mejo.2014.08.012
Sen B, Dutta M, Sikdar B (2014b) Efficient design of parity preserving logic in quantum dot cellular automata targeting enhanced scalability in testing. Microelectron J 45(2):239–248
Sen B, Dutta M, Some S, Sikdar B (2014c) Realizing reversible computing in qca framework resulting in efficient design of testable alu. J Emerg Technol Comput Syst 11(3):1–22. https://doi.org/10.1145/2629538
Seyedi S, Navimipour N (2018) An optimized design of full adder based on nanoscale quantum-dot cellular automata. Optik 158:243–256. https://doi.org/10.1016/j.ijleo.2017.12.062
Sheikhfaal S, Angizi S, Sarmadi S, Navi K (2015) Designing efficient qca logical circuits with power dissipation analysis. Microelectron J 46(6):462–471. https://doi.org/10.1016/j.mejo.2015.03.016
Sousan H, Mosleh M, Setayeshi S (2015) Designing and implementing a fast and robust fulladder in quantum-dot cellular automata (qca) technology. J Adv Comput Res 6(1):27–45
Tang R, Fengming Z, Kim Y (2005) Quantum-dot cellular automata spice macro model. GLSVLSI 5:17–19
Thapliyal H, Ranganathan N (2009) Conservative qca gate (cqca) for designing concurrently testable molecular qca circuits. In: 22nd International Conference on VLSI Design VLSID, vol 9, pp 511–516. https://doi.org/10.1109/VLSI.Design.2009.75
Thapliyal H, Ranganathan N, Kotiyal S (2012) Design of testable reversible sequential circuits. IEEE Trans Very Large Scale Integr (VLSI) Syst 21(7):1201–1209. https://doi.org/10.1109/TVLSI.2012.220968810.1109/TVLSI.2012.220968810.1109/TVLSI.2012.220968810.1109/TVLSI.2012.2209688
Tougaw P, Lent C (1994) Logical devices implemented using quantum cellular automata. J Appl Phys 75(3):1818–1825
Tóth G, Lent C (1999) Quasiadiabatics witching formetal-islandquantum-dot cellular automata. J Appl Phys 85:2977–2984. https://doi.org/10.1063/1.369063
Vetteth A, Walus K, Dimitrov V, Jullien G (2002) quantum-dot cellular automata carry-lookahead adder and barrel shifter. In: IEEE emerging telecommunications technologies conference, pp 2–4
Wang L, Xie G (2018) Novel designs of full adder in quantum-dot cellular automata technology. J Supercomput 74(9):4798–4816. https://doi.org/10.1007/s11227-018-2481-8
Wang W, Walus K, Jullien G (2003) Quantum-dot cellular automata adders. In: 2003 Third IEEE conference on nanotechnology, 2003. IEEE-NANO 2003, vol 1, pp 461–464
Zahmatkesh M, Tabrizchi S, Mohammadyan S, Navi K, Bagherzadeh N (2019) Robust coplanar full adder based on novel inverter in quantum cellular automata. Int J Theor Phys 58(2):639–655. https://doi.org/10.1007/s10773-018-3961-6
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Mousavi, H.A., Keshavarzian, P. & Molahosseini, A.S. A novel fast and small XOR-base full-adder in quantum-dot cellular automata. Appl Nanosci 10, 4037–4048 (2020). https://doi.org/10.1007/s13204-020-01511-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13204-020-01511-x