You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

20 December 2022

Multi-Layered QCA Content-Addressable Memory Cell Using Low-Power Electronic Interaction for AI-Based Data Learning and Retrieval in Quantum Computing Environment

,
and
1
Department of Convergence Science, Kongju National University, Gongju 32588, Republic of Korea
2
Department of Electrical Engineering, College of Engineering, Jouf University, Sakaka 72388, Saudi Arabia
*
Authors to whom correspondence should be addressed.
This article belongs to the Section Electronic Sensors

Abstract

In this study, we propose a quantum structure of an associative memory cell for effective data learning based on artificial intelligence. For effective learning of related data, content-based retrieval and storage rather than memory address is essential. A content-addressable memory (CAM), which is an efficient memory cell structure for this purpose, in a quantum computing environment, is designed based on quantum-dot cellular automata (QCA). A CAM cell is composed of a memory unit that stores information, a match unit that performs a search, and a structure, using an XOR gate or an XNOR gate in the match unit, that shows good performance. In this study, we designed an XNOR gate with a multilayer structure based on electron interactions and proposed a QCA-based CAM cell using it. The area and time efficiency are verified through a simulation using QCADesigner, and the quantum cost of the proposed XOR gate and CAM cell were reduced by at least 70% and 15%, respectively, when compared to the latest research. In addition, we physically proved the potential energy owing to the interaction between the electrons inside the QCA cell. We also proposed an additional CAM circuit targeting the reduction in energy dissipation that overcomes the best available designs. The simulation and calculation of power dissipation are performed by QCADesigner-E and it is confirmed that more than 27% is reduced.

1. Introduction

Unlike RAM, in which data are transferred according to memory addresses, content-addressable memory (CAM) is an associative memory that returns the location of a search term or related data by searching the entire memory space when a user provides a search term [1]. While RAM performs sequential memory operations that depend on addresses, CAM operates in parallel based on all the data stored in the memory and the content to be retrieved. Therefore, it is a special memory used in search applications requiring very high speed, and is effectively used in big data, AI-based data learning, and neural networks [2,3].
Recently, as data capacity and the demand for high-speed search operations have increased, systems that require AI-based data learning, such as machine learning and deep learning are also rapidly increasing, the essential memory structure in these systems is CAM. CAM is an essential memory form used in various fields, such as machine learning, information expression, signal processing, and pattern recognition [4]. Therefore, it is very valuable to be designed in a quantum computing environment. However, it has a slightly more complicated structure than existing memory structures, such as RAM and ROM; therefore, a sensitive approach for efficient circuit design is required.
A complementary metal-oxide semiconductor (CMOS), a modern circuit design technology, has several limitations, such as current leakage due to quantum tunneling of the circuit, high-heat generation, and power consumption [5]. Quantum-dot cellular automata (QCA) is attracting attention as a next-generation technology to replace CMOS owing to several advantages, such as the size of the circuit as well as the problems mentioned above. Various quantum simulations are being tested in an upcoming quantum computing environment, and QCA is one of the most popular quantum modeling techniques [6,7]. Based on QCA, studies are being conducted to design various digital circuits as quantum circuits depending on the presence or absence of memory. This includes combinational circuits, such as XOR gates [8,9,10,11,12,13,14,15], multiplexers [16,17,18,19], adder/subtractors [20,21,22,23], multipliers [24,25], divider [26,27,28], and sequential circuits, such as D flip-flops [29,30,31,32], shift registers [33,34,35,36], RAM [37,38,39,40,41,42,43], and CAM [44,45,46,47].
Unlike RAM, which searches for information using an address, CAM is a storage device that searches for information using internally stored information. A CAM cell consists of a memory unit that stores information and a match unit that determines whether the search is successful [44]. The circuit of match unit of conventional QCA CAM cells is designed using a 5-input minority [45], 5-input majority [46], and an XOR gate [47]. However, in this study, the most structurally concise XNOR gate is used.
The existing QCA XOR gates are mostly designed based on majority vote gates, requiring a large number of cells, area, and relatively wasting space. To solve these problems, circuits using an electron interaction-based design, a method of designing a gate by inducing the operation of the circuit based on the interaction between electrons inside the QCA cell have been implemented [13,14,15]. However, the existing XOR gates are designed with a planar structure, and thus have poor space efficiency. Therefore, in this paper, we propose a multi-layered XNOR gate based on electron interaction and to design the matching unit of the CAM cell using it. The contributions of this study can be summarized as follows:
  • An XOR/XNOR gate with a multi-layer structure based on the electron interactions is proposed;
  • Based on the proposed XNOR gate, a CAM cell is designed and expanded to a 1 × 2 CAM to check the modularity and expandability;
  • A memory cell targeting the optimization of area and time complexity is proposed and verified through circuit simulation;
  • The accuracy of the designed cell is mathematically verified using physical proof;
  • An additional circuit targeting the optimization of power consumption is proposed;
  • An associative memory structure that can be efficiently used for data learning and retrieval based on artificial intelligence, such as neural networks, machine learning, and deep learning is designed.
The remainder of the paper is organized as follows. In Section 2, the basic background of QCA and the previously proposed XOR gates and CAM cells are discussed. Section 3 describes the proposed QCA XOR/XNOR gate and the QCA CAM cell and shows a 1 × 2 CAM circuit designed for expansion. We show physical proof of the XNOR gate proposed in Section 4 and compare and analyze the performance of area and latency with the previously proposed circuits along with the power analysis and simulation results of the proposed circuits. Finally, Section 5 summarizes the study and provides conclusions.

3. Proposed CAM Cell

Although the required area of the QCA XOR gate has been improved by designing it using electron interaction, it is designed as a single-layer structure, which results in a spatial limitation. Therefore, this paper proposes a QCA XOR gate with an improved space efficiency using a multi-layer structure and an electron interaction design technique. Figure 9 shows the proposed XOR/XNOR circuit designed with a two-layer structure and based on the electronic interaction to increase the space efficiency compared to the existing circuits. In addition, the proposed circuit can implement an XNOR gate without using an inverter by changing the polarization of the fixed cells in the second layer from −1 to 1 as shown in Figure 9c.
Figure 9. Proposed XOR/XNOR gates: (a) Layer 1-common structure; (b) Layer 2-XOR structure; (c) Layer 2-XNOR structure.
Figure 10 shows the logic diagram of the CAM cell used in this study. The circuit that determines the output value M in the match unit of Figure 7 is arranged as in Equation (1) and can be designed using a 2-input XNOR and a 2-input OR gate.
M = A + S · A + S · K = A · S + A · S + K = A S + K
Figure 10. Logic diagram of XNOR-based CAM cell.
Figure 11 shows each layer of the QCA CAM cell separately based on the logic diagram of Figure 10. The position of the cells can be identified using the index written on the row and column of each figure. The AND/OR gates used in the circuit are multi-layer structures given in Figure 4. The XNOR gate suggested in Figure 9 is used in the match unit. For signal stability, two redundant cells are inserted into Layer2 (b,10) and Layer3 (c,11).
Figure 11. Proposed QCA CAM cell: (a) All layer; (b) Layer 1; (c) Layer 2; (d) Layer 3.
Figure 12 shows the circuit expanded to a 1 × 2 CAM using the proposed QCA CAM cell. In the two CAM cells, the operation of the memory unit is controlled according to the same R/W input, and each cell of the different inputs K, I, and A, has a different input. M0 and M1, the outputs of the match unit of each cell, are AND operation performed. When both cells of the 1 × 2 CAM are successfully searched, the resulting value of Match output is 1.
Figure 12. Proposed 1 × 2 CAM circuit.

4. Physical Proof and Performance Analysis

4.1. Physical Proof of the Proposed XNOR Gate

Physical proof is used to mathematically verify the operation of a circuit in QCA. It is a proof method used to assume the polarization of a cell, when its polarization is not determined as +1 or −1 and to determine the polarization of the cell through potential energy in each state [48]. First, the polarization of the targeted cell for which the state to be obtained is assumed. The potential energy interacting with the electrons of the cell whose neighboring state is then determined and calculated. Then the sum of potential energies is calculated. This is implemented when the polarization of the target cell is either +1 or −1. By comparing the values of potential energy, the polarization with the lower value is determined as the polarization of the targeted cell.
Equation (2) is a formula for calculating the potential energy owing to the interaction between electrons.   U is the potential energy, k is Coulomb’s constant, q1 and q2 are the sizes of the electric charges of each electron, and r is the distance between the two electrons. At this time, k, q1, and q2 are constants, calculating the numerator of Equation (2) as given in Equation (3). In addition, the potential energy of the electron configuration of the cell is expressed as the sum ( U T ) of the potential energies of the two electrons in the cell as in Equation (4) [48]:
U = k q 1 q 2 r
k q 1 q 2 = 9 × 10 9 × 1.6 2 × 10 38 = 23.04 × 10 29
U T = i = 1 2 U i
Before providing physical proof, this study makes the following assumptions: First, it is assumed that all cells are square with a side length of 18 nm and a cell-to-cell distance of 2 nm. Second, it is assumed that the quantum dots of the QCA cell are located at the vertices of the cell, and the electrons are also located at the center of each quantum dot. Third, the maximum electron-to-electron interaction distance is assumed to be 80 nm.
Figure 13 shows the number of electrons and cell locations assumed for the physical proof of the proposed XNOR gate. There are four cells with unknown polarizations that are numbered from 1 to 4 and it is required to find the polarization corresponding to each cell. Figure 13a,b are the first-layer structures of the proposed XNOR gate, and Figure 13c is the second-layer structure.
Figure 13. Location of electrons and cells for physical proof of the proposed XNOR gate: (a) Layer 1: cell 1 = −1 (b) Layer 1: cell 1 = +1; (c) Layer 2.
The positions of electrons inside the input cell are assumed to be e1 to e4, and as the fixed cells have a polarization of +1, the electrons inside are located at e5 to e8, respectively. The electrons inside the cell to be obtained are denoted by X and Y, respectively, and the use of physical proof is carried out in the order of cell 1 to 4.
E e 1 X = 23.04 × 10 29 2.00 × 10 9 = 1.152 × 10 19 E e 2 X = 23.04 × 10 29 26.91 × 10 9 = 8.563 × 10 21 E e 3 X = 23.04 × 10 29 20.00 × 10 9 = 1.152 × 10 20 E e 4 X = 23.04 × 10 29 42.05 × 10 9 = 5.480 × 10 21 E e 5 X = 23.04 × 10 29 21.36 × 10 9 = 1.079 × 10 20 E e 6 X = 23.04 × 10 29 21.36 × 10 9 = 1.079 × 10 20 E e 7 X = 23.04 × 10 29 41.67 × 10 9 = 5.529 × 10 21 E e 8 X = 23.04 × 10 29 61.81 × 10 9 = 3.728 × 10 21
E e 1 Y = 23.04 × 10 29 26.91 × 10 9 = 8.563 × 10 21 E e 2 Y = 23.04 × 10 29 38.00 × 10 9 = 6.063 × 10 21 E e 3 Y = 23.04 × 10 29 18.11 × 10 9 = 1.272 × 10 20 E e 4 Y = 23.04 × 10 29 20.00 × 10 9 = 1.152 × 10 20 E e 5 Y = 23.04 × 10 29 21.36 × 10 9 = 1.079 × 10 20 E e 6 Y = 23.04 × 10 29 21.36 × 10 9 = 1.079 × 10 20 E e 7 Y = 23.04 × 10 29 31.88 × 10 9 = 7.227 × 10 21 E e 8 Y = 23.04 × 10 29 56.36 × 10 9 = 4.088 × 10 21
First, the potential energy of cell 1 = −1 is analyzed. In (a) and (b) of Figure 13, the values of the potential energy are calculated with each adjacent electron in X and Y from e1 to e8 as given in (5) and (6). U X and U Y denote the potential energies of X and Y, respectively:
U X = i = 1   8 E e i X = 1.716 × 10 19
U Y = i = 1   8 E e i Y = 7.176 × 10 20
For example, E e 1 X refers to the potential energy of e1 and X when interacting with each other. Therefore, the potential energy when cell 1 has a polarization of −1 is equal to (7) because it is the sum of U X and U Y :
U T = U X + U Y = 1.716 × 10 19 + 7.176 × 10 20 = 2.433 × 10 19
Similarly, in (b) and (c) of Figure 13, the potential energy when cell 1 has +1 polarization, the result can be obtained by Equation (8):
U T = U X + U Y = 8.139 × 10 20 + 1.773 × 10 19 = 2.587 × 10 19
A comparison of Equations (7) and (8) shows that the potential energy when the polarization (P) of cell 1 = −1, is smaller than the potential energy when it is +1; therefore, the polarization of cell 1 is determined to be −1. After that, the state of cell 1, in which the polarization is determined, is added. Physical proof of cell 2 is also performed and the result is shown in Equation (9):
                                P = 1 :     U T = U X + U Y = 1.041 × 10 19 + 7.074 × 10 20 = 1.749 × 10 19 P = + 1 :     U T = U X + U Y = 1.934 × 10 19 + 8.183 × 10 20 = 2.752 × 10 19
As shown in Equation (9), when the polarization of cell 2 is −1, the potential energy is lower, and thus the polarization of cell 2 is determined to be −1. In the same way, by using physical proof and adding the polarization of the cells determined in the previous step, the polarization of cell 3 can be calculated. The polarization of cell 4 can also be obtained based on the polarization of cell 3. By analyzing the polarization of cells 1, 2, 3, and 4 determined by using physical proof, cell 1 has the result of an OR operation of A and B, and cells 2, 3, and 4 have the result of an XNOR operation of A and B.

4.2. Simulation and Analysis

All circuits introduced in this study are simulated using QCADesigner 2.0.3 [49]. Bistable approximation and a coherence vector simulation engine are used and the factors are set as listed in Table 3. Figure 14 shows the simulation results for the proposed XOR/XNOR gate. From Figure 14a, it is observed that the operation of XOR gate and the operation of XNOR gate in Figure 14b are normally performed.
Table 3. Simulation parameters.
Figure 14. Simulation result: (a) XOR gate, (b) XNOR gate.
Figure 15 shows the simulation result of the CAM cell. This shows that the proposed circuit works well and has sufficient signal stability.
Figure 15. Simulation result of proposed CAM cell.
In the tables below, we compare and analyze the performance of existing circuits and the circuit proposed in this study. The total number of cells and space used for a circuit design are expressed as cell count and area, respectively. The time in clock cycle units used from the input cell to the final output cell is also compared and expressed as latency. At this time, one clock cycle consists of four clocks. In addition, cost is compared and calculated by the product of area and the square of latency as shown in Equation (10) [50]. When comparing the performance of circuit designs, latency is often used as an arithmetic expression that further emphasizes its importance. For cost, the decimal values are rounded up to negligible values. Table 4 compares the performance of the proposed XOR gate and conventional circuits:
C o s t = A r e a × L a t e n c y 2
Table 4. Comparison of XOR gates.
The circuit with the best performance among the previously proposed gates is the XOR gate using electron interaction as proposed by Chabi et al., which takes a single unit of clock time and requires only a space of 11,564 nm2 [14]. The proposed XOR gate has the same required latency as the existing XOR gate with the best performance and reduces the required area by more than 70%, by using an electron interaction-based multi-layer structure.
Table 5 compares the performance of the proposed QCA circuit of the CAM cell and the circuits previously designed with the best performance. Compared to the existing circuits, the proposed CAM cell reduced the required area by at least 15% and up to 91% and shortened the required latency by up to 74%. Consequently, a large performance improvement is obtained at an overall cost.
Table 5. Comparison of QCA CAMs.
Table 6 confirms the modularity and expandability of the circuit by extending the 1-bit CAM cell compared in Table 5 to the 2-bit, and confirms the area and clock consumed for the additional wiring required for the connection between the CAM cells. For expansion, all circuits are designed with the same three-layer structure and the connection part is designed in a manner similar to the expansion circuit shown in Figure 12. As given in Table 5, the proposed CAM performed 5% better than the circuit proposed in [47], but as a result of expanding the circuit to 1 × 2 CAM, it showed a superior performance by more than 15%. This shows the high modularity and expandability of the proposed CAM cell and shows that it is more cost-effective as the circuit expanded.
Table 6. Comparison of QCA 1 × 2 CAMs.
Table 7 shows the energy dissipation values estimated by QCADesigner-E (rounded up to the second decimal place) [51]. The energy loss rate is determined by the size of the circuit, the density of cells, the number of inputs/outputs and the number of crossovers of the wiring and other design factors. Therefore, the multi-layer structure has a relatively large energy loss rate. The circuit proposed in Figure 11 is designed with an optimization priority given to area and latency. However, it does not significantly contribute in reducing the energy loss due to the multi-layered structure and redundant cells. Therefore, the multi-layered K input cell is moved from Layer2 to Layer1 and the redundant cells are eliminated in order to reduce the energy dissipation of the proposed circuit as shown in Figure 16. Furthermore, one additional cell is inserted before the M output cell to reduce the density of cells. This results in an energy dissipation reduction of 34% when compared to our first design. The proposed design has achieved an approximate energy dissipation reduction of 27% when compared to the best comparable available design in [45]. The circuit in [44] has only two inputs and one output, and the circuit in [47] does not have an output O. Therefore, they cannot be compared on equal terms regarding energy dissipation due to the equal comparison limitation of circuits when the number of inputs and outputs is different.
Table 7. Energy dissipation comparison of QCA CAM cells.
Figure 16. Energy Optimized QCA CAM cell: (a) All layer; (b) Layer 1; (c) Layer 2; (d) Layer 3.

5. Conclusions

In this study, we designed a space-efficient XOR gate using a multi-layer structure in a QCA environment. Based on this design, a CAM cell is also proposed. The proposed XOR gate developed using electron interaction requires only a small area. By changing the state of the fixed cells in the second layer, an XNOR gate can be implemented without using an inverter. In addition, a multilayered CAM cell is designed using the proposed XOR/XNOR structure and extended to 1 × 2 CAM. The operation is verified using physical proof and simulation to demonstrate the modularity and scalability of the circuit. It also shows how to minimize the energy dissipation in the circuits designed with a multi-layer structure. By comparing the proposed designs with existing circuits, the overall performance is improved by optimizing the energy dissipation and space efficiency while maintaining the same latency, and it is confirmed that the circuit performance improved as the circuit expanded. The proposed research reduces the quantum cost by 70% and 15% when compared to the existing XOR gates and CAM cells, respectively. Moreover, it reduces energy dissipation by more than 27% when compared to the best existing design. In the energy loss comparison, it is difficult to compare circuits with different numbers of inputs and outputs on an equal basis, and there are clearly limitations in the trade-off between quantum cost and energy dissipation. Therefore, continuous research into how to overcome these issues is needed. The expanded N × N CAM circuit using the proposed circuit is expected to be used efficiently as a memory circuit for data learning and retrieval based on artificial intelligence, such as neural networks, machine learning, and deep learning in a quantum computing environment.

Author Contributions

Conceptualization, J.-C.J.; methodology, J.-C.J.; software, A.A.; validation, J.-C.J.; formal analysis, A.A.; investigation, H.-I.K.; resources, A.A.; data curation, J.-C.J.; writing—original draft preparation, J.-C.J.; writing—review and editing, A.A. and H.-I.K.; visualization, J.-C.J.; project administration, A.A. and H.-I.K.; funding acquisition, A.A. and H.-I.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the Deanship of Scientific Research at Jouf University under grant No (DSR-2021-02-03100). This research was supported by the Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant by the Korean Government through MSIT (Research on AI-based Cryptanalysis and Security Evaluation) under Grant 2020-0-00126.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Verleysen, M.; Sirletti, B.; Vandemeulebroecke, A.M.; Jespers, P.G.A. Neural Networks for High-Storage Content-Addressable Memory: VLSI Circuit and Learning Algorithm. IEEE J. Solid-State Circuits 1989, 24, 562–569. [Google Scholar] [CrossRef][Green Version]
  2. Liu, J.; Gong, M.; He, H. Deep associative neural network for associative memory based on unsupervised representation learning. Neural Netw. 2019, 113, 41–53. [Google Scholar] [CrossRef] [PubMed]
  3. Sharma, S.; Chandra, S.; Fiete, I.R. Content Addressable Memory Without Catastrophic Forgetting by Heteroassociation with a Fixed Scaffold. In Proceedings of the 39th International Conference on Machine Learning, Baltimore, MA, USA, 17–23 July 2022. [Google Scholar]
  4. Bates, R. Don’t Forget About Associative Memories. The Gradient, 7 November 2020. [Google Scholar]
  5. Haron, N.Z.; Hamdioui, S. Why is CMOS scaling coming to an END? In Proceedings of the 3rd International Design and Test Workshop, Monastir, Tunisia, 20–22 December 2008; pp. 98–103. [Google Scholar]
  6. Lent, C.S.; Tougaw, P.D.; Porod, W.; Bernstein, G.H. Quantum cellular automata. Nanotechnology 1993, 4, 49–57. [Google Scholar] [CrossRef]
  7. Hashemi, S.; Farazkish, R.; Navi, K. New quantum dot cellular automata cell arrangements. J. Comput. Theor. Nanosci. 2013, 10, 798–809. [Google Scholar] [CrossRef]
  8. Angizi, S.; Alkaldy, E.; Bagherzadeh, N.; Navi, K. Novel robust single layer wire crossing approach for exclusive OR sum of products logic design with quantum-dot cellular automata. J. Low Power Electron. 2014, 10, 259–271. [Google Scholar] [CrossRef]
  9. Beigh, M.R.; Mustafa, M.; Ahmad, F. Performance evaluation of efficient XOR structures in quantum-dot cellular automata (QCA). Circuits Syst. 2013, 4, 147–156. [Google Scholar] [CrossRef]
  10. Ajitha, D.; Ramanaiah, K.V.; Sumalatha, V. An efficient design of XOR gate and its applications using QCA. I-Manag. J. Electron. Eng. 2015, 5, 22–29. [Google Scholar] [CrossRef]
  11. Mustafa, M.; Beigh, M.R. Design and implementation of quantum cellular automata based novel parity generator and checker circuits with minimum complexity and cell count. Indian J. Pure Appl. Phys. 2013, 51, 60–66. [Google Scholar]
  12. Khosroshahy, M.B.; Moaiyeri, M.H.; Angizi, S.; Bagherzadeh, N.; Navi, K. Quantum-dot cellular automata circuits with reduced external fixed inputs. Microprocess. Microsyst. 2017, 50, 154–163. [Google Scholar] [CrossRef]
  13. Poorhosseini, M.; Hejazi, A.R. A fault-tolerant and efficient XOR structure for modular design of complex QCA circuits. J. Circuits Syst. Comput. 2017, 27, 1850115. [Google Scholar] [CrossRef]
  14. Chabi, A.M.; Roohi, A.; Khademolhosseini, H.; Sheikhfaal, S.; Angizi, S.; Navi, K.; DeMara, R.F. Towards ultra-efficient QCA reversible circuits. Microprocess. Microsyst. 2017, 49, 127–138. [Google Scholar] [CrossRef]
  15. Safoev, N.; Jeon, J.C. A novel controllable inverter and adder/subtractor in quantum-dot cellular automata using cell interaction based XOR gate. Microelectron. Eng. 2020, 222, 111197. [Google Scholar] [CrossRef]
  16. Chabi, A.M.; Sayedsalehi, S.; Angizi, S.; Navi, K. Efficient QCA exclusive-or and multiplexer circuits based on a nano electronic compatible designing approach. Int. Sch. Res. Not. 2014, 2014, 463967. [Google Scholar]
  17. Almatrood, A.; George, A.K.; Singh, H. Low-Power Multiplexer Structures Targeting Efficient QCA Nanotechnology Circuit Designs. Electronics 2021, 10, 1885. [Google Scholar] [CrossRef]
  18. Jeon, J.C. Designing nanotechnology QCA–multiplexer using majority function-based NAND for quantum computing. J. Supercomput. 2021, 77, 1562–1578. [Google Scholar] [CrossRef]
  19. Seyedi, S.; Navimpipour, N.J. An efficient structure for designing a nano-scale fault-tolerant 2:1 multiplexer based on quantum-dot cellular automata. Optik 2022, 251, 168409. [Google Scholar] [CrossRef]
  20. Kianpour, M.; Sabbaghi-Nadooshan, R.; Navi, K. A novel design of 8-bit adder/subtractor by quantum-dot cellular automata. J. Comput. Syst. Sci. 2014, 80, 1404–1414. [Google Scholar] [CrossRef]
  21. Shahidinejad, A.; Selamat, A. Design of first adder/subtractor using quantum-dot cellular automata. Adv. Mater. Res. 2012, 403, 3392–3397. [Google Scholar] [CrossRef]
  22. Safoev, N.; Jeon, J.C. Design of high-performance QCA incrementer/decrementer circuit based on adder/subtractor methodology. Microprocess. Microsyst. 2020, 72, 102927. [Google Scholar] [CrossRef]
  23. Erniyazov, S.; Jeon, J.C. Carry save adder and carry look ahead adder using inverter chain based coplanar QCA full adder for low energy dissipation. Microelectron. Eng. 2019, 211, 37–43. [Google Scholar] [CrossRef]
  24. Chudasama, A.; Sasamal, T.N.; Yadav, J. An efficient design of Vedic multiplier using ripple carry adder in Quantum-dot Cellular Automata. Comput. Electr. Eng. 2018, 65, 527–542. [Google Scholar] [CrossRef]
  25. Safoev, N.; Jeon, J.C. Design and Evaluation of Cell Interaction Based Vedic Multiplier Using Quantum-Dot Cellular Automata. Electronics 2020, 9, 1036. [Google Scholar] [CrossRef]
  26. Mohammadi, M.; Gorgin, S.; Mohammadi, M. Design of non-restoring divider in quantum-dot cellular automata technology. IET Circuits Devices Syst. 2017, 11, 135–141. [Google Scholar] [CrossRef]
  27. Almatrood, A.F.; Singh, H. QCA circuit design of n-bit non-restoring binary array divider. J. Eng. 2018, 2018, 348–353. [Google Scholar] [CrossRef]
  28. Kim, H.I.; Jeon, J.C. Non-Restoring Array Divider Using Optimized CAS Cells Based on Quantum-Dot Cellular Automata with Minimized Latency and Power Dissipation for Quantum Computing. Nanomaterials 2022, 12, 540. [Google Scholar] [CrossRef] [PubMed]
  29. Roshan, M.G.; Gholami, M. Novel D Latches and D Flip-Flops with Set and Reset Ability in QCA Nanotechnology Using Minimum Cells and Area. Int. J. Theor. Phys. 2018, 57, 3223–3241. [Google Scholar] [CrossRef]
  30. Sasamal, T.N.; Singh, A.K.; Ghanekar, U. Design of QCA-Based D Flip Flop and Memory Cell Using Rotated Majority Gate, Smart Innovations in Communication and Computational Sciences. Adcances Intell. Syst. Comput. 2019, 670, 233–247. [Google Scholar]
  31. Jeon, J.C. Low Complexity QCA Universal Shift Register Design Using Multiplexer and D Flip-Flop Based on Electronic Correlations. J. Supercomput. 2019, 76, 6438–6452. [Google Scholar] [CrossRef]
  32. Senthilnathan, S.; Kumaravel, S. Power-efficient implementation of pseudo-random number generator using quantum dot cellular automata-based D flip flop. Comput. Electr. Eng. 2020, 85, 106658. [Google Scholar] [CrossRef]
  33. Kaviya, M.; Bavithra, S.; Soorya, M.; Sowndarya, S.; Senthilnathan, S. Design of Linear Feedback Shift Register in Quantum Dot Cellular Automata. Int. J. Inf. Comput. Sci. 2019, 6, 2019. [Google Scholar]
  34. Roshan, M.G.; Gholami, M. 4-Bit serial shift register with reset ability and 4-bit LFSR in QCA technology using minimum number of cells and delay. Comput. Electr. Eng. 2019, 78, 449–462. [Google Scholar] [CrossRef]
  35. Fan, S.; Khamesinia, M.S. An Efficient Design of Parallel and Serial Shift Registers Based on Quantum-Dot Cellular Automata. Int. J. Theor. Phys. 2021, 60, 2400–2411. [Google Scholar] [CrossRef]
  36. Kim, H.I.; Jeon, J.C. Quantum LFSR Structure for Random Number Generation Using QCA Multilayered Shift Register for Cryptographic Purposes. Sensors 2022, 22, 3541. [Google Scholar] [CrossRef] [PubMed]
  37. Sandhu, A.; Gupta, S. A Majority Gate Based RAM Cell design with Least Feature Size in QCA. Gazi Univ. J. Sci. 2019, 32, 1150–1165. [Google Scholar] [CrossRef]
  38. Heydari, M.; Xiaohu, Z.; Lai, K.K.; Afro, S. A Cost-Aware Efficient RAM Structure Based on Quantum-Dot Cellular Automata Nanotechnology. Int. J. Theor. Phys. 2019, 58, 3961–3972. [Google Scholar] [CrossRef]
  39. Abdullah-Al-Shafi, M.; Bahar, A.N. A New Structure for Random Access Memory Using Quantum-Dot Cellular Automata. Sens. Lett. 2019, 17, 595–600. [Google Scholar] [CrossRef]
  40. Majeed, A.H.; Alkaldy, E.; Zainal, M.S.; Navi, K.; Nor, D. Optimal design of RAM cell using novel 2:1 multiplexer in QCA technology. Circuit World 2019, 46, 147–158. [Google Scholar] [CrossRef]
  41. Abdullah-Al-Shafi, M.; Ziaur, R. Analysis and modeling of sequential circuits in QCA nano computing: RAM and SISO register study. Solid State Electron. Lett. 2019, 1, 73–83. [Google Scholar] [CrossRef]
  42. Song, Z.; Xie, G.; Cheng, X.; Wang, L.; Zhang, Y. An Ultra-Low Cost Multilayer RAM in Quantum-Dot Cellular Automata. IEEE Trans. Circuits Syst. II Express Briefs 2020, 67, 3397–3401. [Google Scholar] [CrossRef]
  43. Ahmadpour, S.S.; Mohammad, M.; Heikalabad, S.R. Efficient designs of quantum-dot cellular automata multiplexer and RAM with physical proof along with power analysis. J. Supercomput. 2022, 78, 1672–1695. [Google Scholar] [CrossRef]
  44. Sardinha, L.H.B.; Silva, D.S.; Vieira, M.A.M.; Vieira, L.F.M.; Neto, O.P.V. TCAM/CAM-QCA:(Ternary) Content Addressable Memory using Quantum-dot Cellular Automata. Microelectron. J. 2015, 46, 563–571. [Google Scholar] [CrossRef]
  45. Heikalabad, S.R.; Navin, A.H.; Hosseinzadeh, M. Content addressable memory cell in quantum-dot cellular automata. Microelectron. Eng. 2016, 163, 140–150. [Google Scholar] [CrossRef]
  46. Khosroshahy, M.B.; Moaiyeri, M.H.; Navi, K. Design and evaluation of a 5-input majority gate-based content-addressable memory cell in quantum-dot cellular automata, In Proceedings of the 19th International Symposium on Computer Architecture and Digital Systems, Kish Island, Iran, 21–22 December 2017.
  47. Sadoghifar, A.; Heikalabad, S.R. A Content-Addressable Memory structure using quantum cells in nanotechnology with energy dissipation analysis. Phys. B Condens. Matter 2018, 537, 202–206. [Google Scholar] [CrossRef]
  48. Navi, K.; Sayedsalehi, S.; Farazkish, R.; Azghadi, M.R. Five-Input Majority Gate, a New Device for Quantum-Dot Cellular Automata. J. Comput. Theor. Nanosci. 2010, 7, 1546–1553. [Google Scholar] [CrossRef]
  49. Walus, K.; Dysart, T.J.; Jullien, G.A.; Budiman, R.A. QCADesigner: A rapid design and simulation tool for quantum-dot cellular automata. IEEE Trans. Nanotechnol. 2004, 3, 26–31. [Google Scholar] [CrossRef]
  50. Thompson, C.D. Area-time complexity for VLSI. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Pittsburgh, AR, USA, 30 April 1997. [Google Scholar]
  51. QCADesigner-E. Available online: https://github.com/FSillT/QCADesigner-E (accessed on 9 November 2022).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.