Abstract
Quantum-dot cellular automata (QCA) is a nanoscale technology to design digital circuits in nano-measure which acts based on electron’s interaction. The technology of collecting, processing and distributing information is growing rapidly, but the growth in demand for advanced methods in data processing has always been greater than the speed of growth of these technologies. Hence, computer networks play an important role in providing a resource sharing and facilitating user communications. The circuit-switched network is one of the main components for sending input signals between different users within the network. In this paper, a minimal and optimal design of the circuit-switched network is presented at a single level in QCA. The proposed design is studied and compared with existing designs in terms of fault tolerant under stuck-at 0 and 1. There is also a physical analysis for the proposed circuit-switched network.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Recently, CMOS technology has been used to design digital circuits. CMOS technology is faced with leakage current and increasing power consumption challenges because of increasing size of the designed circuits. Today, QCA shows good attributes such as high speed, small size and low consuming power. QCA is a nanotechnology to design the circuit of the digital systems which based on electrons interaction, and it is used to design the circuits in nanoscales [1,2,3]. Computer networks are so important because they simplify the communications between different users to share the resources. The shared resources can be hardware, software and information. Switch is one of the main and important ingredients in computer networks which have enough potential to change the communication’s method. Using switch makes the users to able to send the information with network at the same time; however, sending speed of the information do not effect on availability of the other users. Circuit switching of the network is one of the main parts to send input signals between different users in network. In this paper, new structure for the multiplexer is used to present a single level design for circuit switching of the network. These efforts are done to compare this structure with the existing ones to be minimized and optimized over the number of the cells, delay and complexity. Also, the proposed design has been analyzed for the tolerance of stuck-at 0 and 1, which is optimal compared to existing designs. The proposed design is also analyzed in the form of physical analysis.
2 Review of quantum-dot cellular automata
Quantum-dot cellular automata are a technology which can run at high frequency, low consuming power and nano-measured size. This technology can be used instead of CMOS technology. The smallest unit in quantum-dot cellular automata is quantum cell which contains four quantum dots. Figure 1a, b shows two cells with 90° and 45° which are in quantum-dot cellular automata [4].
There are two free electrons in each quantum cell. Due to the existence of a coulomb repulsive force between electrons, they have to be farthest away. Therefore, there will be two stable states of electrons sets in quantum cell. These states are shown as − 1 and + 1. Figure 2a, b, respectively, shows these states [4,5,6].
Wires transfer information in quantum-dot cellular automata like any other technologies. Quantum wires are made with quantum cells in quantum-dot cellular automata. There are two types of quantum-dot cellular automata wires which are 45° and 90° that are, respectively, shown in Fig. 3a, b [4,5,6,7].
There are different ways to transfer the current in crossover circuits in quantum-dot cellular automata. These methods are crossing the 45° and 90° wires from each other, designing multilayer and using clock functionality. The 45° and 90° wires can transfer current from each other without interference. Multilayer designing is one of the layouts in quantum-dot cellular automata which crossover sections are designed in different layers. Other type is that wires with two different clock zones transfer the current without interference, as shown in Fig. 4a–c [5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23].
Fundamental gates are the majority and inverter gates in quantum-dot cellular automata. Majority gates have two types: three-input and five-input. The voter cell transfers the majority of the input to the output in majority gates. Figure 5a, b, respectively, shows the three-input and five-input majority gates [24,25,26].
Inverter gate transfers the inverse of the input to the output. Figure 6a, b, respectively, shows the oblique and pair inverter gates in quantum-dot cellular automata [24,25,26,27].
Clocking scheme is used to sync the information in designing of the complicated structures in quantum-dot cellular automata. Clock cycle of the quantum-dot cellular automata contains four phases: switch, hold, release and relax. At switch phase, the movement of electrons inside of the cell is slowly decreased. At hold phase, the electrons are stable inside of the cell. At release phase, the speed of the electrons is being increasing. At relax phase, the electrons move freely inside of the cell. Figure 7 shows the phases of the clock cycle in quantum-dot cellular automata [28,29,30].
3 Related work
In this section, the presented structure by Jadav Chandra Das [31] has been studied which is the design of circuit-switched network in single layer. It has presented a new crossbar switch to design circuit switching network. The crossbar switch contains two multiplexers which includes control signal, two inputs A and B and two outputs C and D. The crossbar switch uses two test vectors 010 and 101 for experiment, and the results show that it is 90% fault tolerant in the face of stuck-at 0 and 1. In the following, a new crossbar switch, including transmitter and receiver, is designed which transmitter includes three multiplexers, two control signals, two input lines A and B and one output line. Transmitter and receiver get connected together to design circuit switching network.
4 Designing of the suggested circuit-switched network
Circuit switching network is one of the main parts to send input signals between different users in the network. Circuit switching network contains two parts: transmitter and receiver. A crossbar switch is needed to guide the input signals to the output in circuit switching network.
4.1 Crossbar switch circuit design
Crossbar switch’s duty is to change the input path from one output line to another output line. The multiplexer structure presented by Mr. Mazaher Naji [32] is used to design crossbar switch circuit. The multiplexer contains 12 cells and 1 delay at clock zone. The control signal’s S duty is to guide input to the output line. For control signal S = 0, the input A will be seen at output line. If signal control is S = 1, the input B will be seen at output line. Figure 8a, b shows, respectively, the structure and results of the simulation for the multiplexer [32].
The crossbar switch circuit in this paper contains two 2 × 1 multiplexers, and it is controlled by control signal S. The crossbar switch includes inputs A and B and outputs C and D. If control signal is S = 0, the inputs A and B are seen, respectively, in outputs C and D line. But if the control signal is S = 1, the inputs A and B get transferred to the outputs D and C. Table 1 shows the truth table of the suggested crossbar switch circuit.
Figure 9a, b shows, respectively, designing and implementing of the crossbar switch circuit and its simulation’s results. The suggested crossbar switch circuit’s delay is two clock zones, and it contains 52 quantum cells.
The suggested crossbar switch circuit has been analyzed for fault tolerant under stuck-at 0 and 1, and the results are shown in Table 2. The crossbar switch circuit that presented by Jadav Chandra Das and Debashis De [31] uses two test vectors 010 and 101 for the experiment, and its fault tolerant is 90%. The suggested crossbar switch circuit in this paper uses two test vectors 101 and 110 for the experiment, and the fault tolerant of it is 95%. If we use three test vectors 001, 101 and 110, the suggested crossbar switch’s fault tolerant is 100%.
4.2 Transmitter designing
A crossbar switch circuit and a 2 × 1 multiplexer are used to design transmitter circuit. The outputs of the crossbar switch circuit are as 2 × 1 multiplexer inputs. The transmitter includes two input lines A and B and one output line Tout. S0 and S are, respectively, the control signals of the crossbar switch circuit and 2 × 1 multiplexer. If the control signals S0 and S have the same values, the input A will be seen at output line Tout. But if the control signals S0 and S do not have same values, the input B gets transferred to the output line Tout. Table 3 shows the truth table of the transmitter circuit.
Figure 10a, b shows, respectively, the designing and implementing of the transmitter circuit in quantum-dot cellular automata and the results of the simulation. The transmitter circuit delay is one clock cycle, and it contains 101 quantum cells.
Table 4(a)–(c) shows the result of the fault tolerant under stuck-at 0 and 1. As shown in Table 4(a) and (b), if the stuck-at 0 and 1 occurs on S0 and S, all components of the S0 and S have fault and the fault is recognizable. As shown in Table 4(c), if stuck-at 0 and 1 occurs simultaneously on S0 and S and if S0 and S have unequal values, a fault occurs and that fault is recognizable.
4.3 Receiver circuit designing
A 1 × 2 demultiplexer and a crossbar switch circuit are used to design receiver circuit. The output of the 1 × 2 demultiplexer is as input of the crossbar switch circuit. Receiver circuit contains one input line I and two output lines C and D. S and S0 are, respectively, the control signals of the 1 × 2 demultiplexer and crossbar switch circuit. The input I will be seen in output line C when the control signals S and S0 have same values. But if control signals S and S0 do not have same values, the input I transferred to the output line D. Table 5 shows the truth table of the receiver circuit.
Figure 11a, b shows, respectively, designing and implementing of the receiver circuit in quantum-dot cellular automata and the results of the simulation. Receiver circuit delay is 6 clock zones and contains 88 quantum cells.
The receiver circuit’s fault tolerant under stuck-at 0 or 1 has been analyzed, and its result is shown in Table 6(a)–(c). As shown in table 6(a) and (b), if stuck-at 0 and 1 occurs on S and S0, all of the fault components occur for S and S0 and the fault is diagnosable. Based on the results of Table 6(c), if stuck-at 0 and 1 occurs simultaneously on S0 and S and if S0 and S have unequal values, a fault occurs and that fault is recognizable.
4.4 Circuit-switched network designing
Transmitter and receiver circuits get connected to each other to design the suggested circuit-switched network. In fact, output of the transmitter circuit is connected to the demultiplexer input of the receiver circuit. Therefore, circuit switching network contains two transmitter users A and B and two receiver users C and D which are connected with a unique channel. The proposed circuit includes four control signals S1, S2, S3 and S4. Control signals S1 and S2 are, respectively, crossbar switch and 2 × 1 multiplexer inputs in transmitter, and control signals S3 and S4 are, respectively, 1 × 2 demultiplexer and crossbar switch inputs in receiver. Table 7 shows suggested switching circuit of communication path.
The suggested design is simulated by QCA designer 2.0.3 software using coherence vector specifications. Table 8 shows the parameters of the simulation.
Figure 12a, b shows designing and implementing of the suggested circuit switching network in quantum-dot cellular automata and the results of the simulation. Circuit switching network’s delay is two clock cycles and contains 207 quantum cells.
The fault tolerant of suggested circuit switching network is analyzed under stuck-at 0 or 1, and the simulation results are shown in Tables 9(a)–(h), 10, 11 and 12.
In Table 9(a), if stuck-at 0 or 1 occurs on control signals S1 or S2 for input 0000, respectively, one of the fault situations 1000 or 0100 will happen. Therefore, the faulty path will be B → C. The other input analysis method is same.
In Table 9(b), if stuck-at 0 or 1 occurs on control signals S3 or S4 for input 0010, respectively, one of the fault situations 0000 or 0011 will happen. Therefore, the faulty path will be A → C. The other input analysis method is same.
In Table 9(c), if stuck-at 0 or 1 occurs simultaneously on each control signals S1 and S2 for 1100 input, one of the fault situations 0000 or 1100 will happen. Therefore, the faulty path is our favor and there is no fault. But if stuck-at 0 or 1 occurs simultaneously on each control signals S1 and S2 for 0101 input, one of the fault situations 0001 or 1101 will happen. Therefore, the faulty path is A → D. The other input analysis method is same.
In Table 9(d), if stuck-at 0 or 1 occurs simultaneously on each control signals S1 and S3 for 1011 input, one of two situations 0001 or 1011 will happen. Therefore, the output paths will be one of B → C or A → D, which B → C has no fault and A → D path has fault. But if stuck-at 0 or 1 occurs simultaneously on each control signals S1 and S3 for 1101 input, one of two fault situations 0101 or 1111 will happen. Therefore, the output paths will be B → D or A → C, which they have faults. The other input analysis method is same.
In Table 9(e), if stuck-at 0 or 1 occurs simultaneously on each control signals S1 and S4 for input 0100, one of two situations 0100 or 1101 will happen. Therefore, the output path will be one of B → C or A → D, which B → C path has no fault and A → D path has fault. But if stuck-at 0 or 1 occurs simultaneously on each control signal S1 and S4 for input 1000, one of two fault situations 0000 or 1001 will happen. Therefore, the output paths are A → C and B → D, which they have faults. The other input analysis method is same.
In Table 9(f), if stuck-at 0 or 1 occurs simultaneously on each control signals S2 and S3 for input 0110, one of two situations 0110 or 0000 will happen. Therefore, the output paths will be B → D or A → C, which B → D path has no fault and A → C has fault. But if stuck-at 0 or 1 occurs simultaneously on each control signals S2 and S3 for input 1010, one of two fault situations 1000 or 1110 will happen. Therefore, the output path will be B → C or A → D, which both of them have fault. The other input analysis method is same.
In Table 9(g), if stuck-at 0 or 1 occurs simultaneously on each control signals S2 and S4 for input 0010, one of the fault situations 0010 or 0111 will happen. Therefore, the output path is one of A → D or B → C, which A → D path has no fault and B → C path has fault. But if stuck-at 0 or 1 occurs simultaneously in each control signals S2 and S4 for input 0011, one of the fault situations 0010 or 0111 will happen. Therefore, the output fault path is A → D or B → C, which both of them have fault. The other input analysis method is same.
In Table 9(h), if stuck-at 0 or 1 occurs simultaneously on each two control signals S3 and S4 for input 1100, one of two situations 1100 or 1111 will happen. Therefore, the output path will be A → C, which is without fault. But if stuck-at 0 or 1 occurs simultaneously on each two control signals S3 and S4 for input 0001, one of two situations 0000 or 0011 will happen. Therefore, the output path is A → C which has fault. The other input analysis method is same.
Table 10 shows two situation of the fault tolerant analysis because the occurrence of stuck-at 0 or 1 on control signals S1, S2 and S3 causes the results as same as the occurrence of stuck-at 0 or 1 on control signals S1, S2 and S4. If stuck-at 0 or 1 occurs simultaneously on control signals S1, S2 and S3 for input 0010, one of two situations 0000 or 1110 will happen. Therefore, the output path is one of A → C and A → D paths, which A → C path has fault and A → D has no fault. So if stuck-at 0 or 1 occurs simultaneously on control signals S1, S2 and S4 for input 0010, one of two situations 0010 or 1111 will happen. Therefore, the output path is one of A → D and A → C paths, which A → D path has no fault and A → C has fault.
Table 11 shows two situations of the fault tolerant analysis because occurrence of stuck-at 0 or 1 on control signals S1, S3 and S4 have the result as same as occurrence of stuck-at 0 or 1 on control signals S2, S3 and S4. If stuck-at 0 or 1 occurs simultaneously on control signal S1, S3 and S4 for input 0110, one of two situations 0100 or 1111 will happen. Therefore, one of B → C and A → C is output path, which both of them have fault. So if stuck-at 0 or 1 occurs simultaneously on control signal S2, S3 and S4 for input 0110, one of two situations 0000 or 0111 will happen. Therefore, the output path will be one of A → C or B → C, which both of them have fault.
In Table 12, if stuck-at 0 or 1 occurs simultaneously on four control signals S1, S2, S3 and S4, for all possible input components, one of two situations 0000 or 1111 will happen which output path will be A → C. The A → C path has no fault for inputs 0000, 0011, 1100 and 1111 and has fault for other inputs.
5 Calculation of kink’s energy for proposed circuit-switched network
A cell polarization of the quantum-dot cellular automata is determined by coulomb interaction between cells. According to Eq. 1, the difference between electrostatic energies of two polarized neighbor cells is named kink energy [33].
Figure 13 shows the effect region on the output cells of the suggested circuit switching network.
The difference of kink energy is calculated between two neighbor cells i and j, which the cell i is taken constant in one situation and the cell j gets polarized in both of the situations. Equation 2 shows the kink energy calculation between two neighbor cells [33].
Figure 14a, b shows numbered quantum points for the quantum cells, as well as the polarization of output cells D and C.
At first, the electrostatic energy of each cell and its effect on output is calculated by Eq. 3 to compute kink energy [33, 34].
The calculated kink energy for suggested circuit switching network is equal with sum of electrostatic energies of all cells. The results of the calculations are shown, respectively, in Tables 13(a), (b) and 14(a), (b) for polarized situation of the output cells C and D. It is considered that the quantum cell’s size is taken 18 × 18 nm and the distance between two neighbor cells is taken 2 nm.
Each output cell has stable situation which they have less kink energy. Based on Table 13(a) and (b), output cell C has less kink energy in the first situation, and therefore, the first situation is more stable. Also, the results of Table 14(a) and (b) show that the output cell D has lower kink energy in first situation, and therefore, the first situation is more stable.
6 Evaluation results and conclusion
The main purpose of the paper is presenting a fault tolerant circuit-switched network with the lowest cells, delay and complexity. Also, the operation of presented circuit is analyzed physically. The designed circuit switching networks by we and Jadav Chandra Das are compared and analyzed in details in Tables 15, 16 and 17, and in general in Table 18.
As shown in Table 15, the presented crossbar switch has 75% less delay and 85% less cell number than Jadav Chandra Das’s design [31]. Also, the presented crossbar switch’s fault tolerant has 5% more than Jadav Chandra Das’s crossbar switch with two test vector. The presented crossbar switch has 100% fault tolerant with three test vector.
As shown in Table 16, the presented transmitter circuit has 58% less delay and 41% less cell number. The fault tolerant of transmitter circuit presented in part 4-2 is analyzed, and the results show that it has 100% fault tolerant.
As shown in Table 17, the presented receiver circuit has 58% less delay and 46% less cell number than Jadav Chandra Das’s design. The fault tolerant of receiver circuit presented in part 4-3 is analyzed, and the results show that it has 100% fault tolerant.
As shown in Table 18, the suggested circuit switching network has 78% less delay and 45% less cell number than Jadav Chandra Das’s design. The fault tolerant of suggested circuit switching network is analyzed, and the results show that it has 100% fault tolerant.
References
Ahmadpour, S., Mosleh, M., Heikalabad, S.R.: Robust QCA full-adders using an efficient fault-tolerant five-input majority gate. Int. J. Circ. Theor. App. 47(7), 1037–1056 (2019)
Norouzi, A., Heikalabad, S.R.: Design of reversible parity generator and checker for the implementation of nano-communication systems in quantum-dot cellular automata. Photonic Netw. Commun. (2019). https://doi.org/10.1007/s11107-019-00850-2
Nejad, M.Y., Mosleh, M., Heikalabad, S.R.: An LSB-based quantum audio watermarking using MSB as arbiter. Int. J. Theor. Phys. (2019). https://doi.org/10.1007/s10773-019-04251-z
Lent, C., Tougaw, P.: A device architecture for computing with quantum dots. Proc. IEEE 85(4), 541–557 (1997)
Lent, C.S., Tougaw, P.D., Porod, W.: Bistable saturation in coupled quantum dots for quantum cellular automata. Appl. Phys. Lett. 62(7), 714–716 (1993)
Roohi, A., DeMara, R.F., Khoshavi, N.: Design and evaluation of anultra-area-efficientfault-tolerant QCA full adder. Microelectron. J. 46(6), 531–542 (2015)
Milad, B., Mahya, S., Alireza, A., Keivan, N., Nader, B.: A 3D universal structure based on molecular-QCA and CNT technologies. J. Mol. Struct. 1119(5), 86–95 (2016). https://doi.org/10.1016/j.molstruc.2016.04.025
Mohammad, M., Majid, M., Saeid, G.: An efficient design of full adder in quantum-dot cellular automata (QCA) technology. Microelectron. J. 50, 35–43 (2016). https://doi.org/10.1016/j.mejo.2016.02.004
Heikalabad, S.R., Navin, A.H., Hosseinzadeh, M.: Midpoint memory: a special memory structure for data-oriented models implementation. J. Circuits Syst. Comput. 24(5), 1550063 (2015)
Heikalabad, S.R., Navin, A.H., Hosseinzadeh, M.: Content addressable memory cell in quantum-dot cellular automata. Microelectron. Eng. 163, 140–150 (2016)
Karkaj, E.T., Heikalabad, S.R.: Binary to gray and gray to binary converter in quantum-dot cellular automata. Opt. Int. J. Light Electron. Opt. (2017). https://doi.org/10.1016/j.ijleo.2016.11.087
Karkaj, E.T., Heikalabad, S.R.: A testable parity conservative gate in quantum-dot cellular automata. Superlattices Microstruct. (2016). https://doi.org/10.1016/j.spmi.2016.08.054
Gadim, M.R., Navimipour, N.J.: A new three-level fault tolerance arithmetic and logic unit based on quantum dot cellular automata. Microsyst. Technol. (2017). https://doi.org/10.1007/s00542-017-3502-x
Heikalabad, S.R., Asfestani, M.N., Hosseinzadeh, M.: A full adder structure without crosswiring in quantum-dot cellular automata with energy dissipation analysis. J. Supercomput. (2017). https://doi.org/10.1007/s11227-017-2206-4
Barughi, Y.Z., Heikalabad, S.R.: A three-layer full adder/subtractor structure in quantum-dot cellular automata. Int. J. Theor. Phys. 56, 2848 (2017). https://doi.org/10.1007/s10773-017-3453-0
Rad, S.K., Heikalabad, S.R.: Reversible flip-flops in quantum-dot cellular automata. Int. J. Theor. Phys. 56, 2990 (2017). https://doi.org/10.1007/s10773-017-3466-8
Sadoghifar, A., Heikalabad, S.R.: A content-addressable memory structure using quantum cells in nanotechnology with energy dissipation analysis. Phys. B Condens. Matter 537, 202–206 (2018). https://doi.org/10.1016/j.physb.2018.02.024
Asfestani, M.N., Heikalabad, S.R.: A unique structure for the multiplexer in quantum dot cellular automata to create a revolution. Phys. B Condens. Matter 512, 91–99 (2017). https://doi.org/10.1016/j.physb.2017.02.028
Babaie, S., Sadoghifar, A., Bahar, A.N.: Design of an efficient multilayer arithmetic logic unit in quantum-dot cellular automata (QCA). IEEE Trans. Circuits Syst. II Express Briefs 66, 963–967 (2018)
Salimzadeh, F., Heikalabad, S.R.: Design of a novel reversible structure for full adder/subtractor in quantum-dot cellular automata. Phys. B Phys. Condens. Matter (2018). https://doi.org/10.1016/j.physb.2018.12.028
Heikalabad, S.R., Gadim, M.R.: Design of improved arithmetic logic unit in quantum-dot cellular automata. Int. J. Theor. Phys. 57(6), 1733–1747 (2018). https://doi.org/10.1007/s10773-018-3699-1
Kamrani, S., Heikalabad, S.R.: A unique reversible gate in quantum-dot cellular automata for implementation of four flip-flops without garbage outputs. Int. J. Theor. Phys. 57(11), 3340–3358 (2018). https://doi.org/10.1007/s10773-018-3847-7
Ahmadpour, S.S., Mosleh, M., Heikalabad, S.R.: A revolution in nanostructure designs by proposing a novel QCA full-adder based on optimized 3-input XOR. Phys. B 550, 383–392 (2018). https://doi.org/10.1016/j.physb.2018.09.029
Mariam, Z., Keivan, N.: Ultra-area-efficient reversible multiplier. Microelectron. J. 43(6), 377–385 (2012). https://doi.org/10.1016/j.mejo.2012.02.004
Basu, S.: Realization of combinational multiplier using quantum cellular automata. Int. J. Comput. Appl. 99(19), 1–6 (2014)
Cho, H., Swartzlander Jr., E.E.: Adder and multiplier design in quantum-dot cellular automata. IEEE Trans. Comput. 58(6), 721–727 (2009). https://doi.org/10.1109/TC.2009.21
Dharmendra, K., Debasis, M.: Design of a practical fault-tolerant adder in QCA. Microelectron. J. 53, 90–104 (2016). https://doi.org/10.1016/j.mejo.2016.04.004
Trailokya, N., Ashutosh, K., Anand, M.: An optimal design of full adder based on 5-input majority gate in coplanar quantum-dot cellular automata. Opt. Int. J. Light Electron Opt. 127(20), 8576–8591 (2016). https://doi.org/10.1016/j.ijleo.2016.06.034
Firdous, A.G., Hossein, K., Saeid, A., Shaahin, A., Keivan, N.: Towards single layer quantum-dot cellular automata adders based on explicit interaction of cells. J. Comput. Sci. 16, 8–15 (2016). https://doi.org/10.1016/j.jocs.2016.02.005
Kianpour, M., Sabbaghi-Nadooshan, R., Navi, K.: A novel design of 8-bit adder/subtractor by quantum-dot cellular automata. J Comput Syst Sci. 80(7), 1404–1414 (2014). https://doi.org/10.1016/j.jcss.2014.04.012
Das, J.C., De, D.: Circuit switching with quantum-dot cellular automata. Nano Commun. Netw. (2017). https://doi.org/10.1016/j.nancom.2017.09.002
Asfestani, M.N., Heikalabad, S.R.: A novel multiplexer-based structure for random access memory cell in quantum-dot cellular automata. Phys. B Condens. Matter 521, 162–167 (2017)
Sen, B., Sahu, Y., Mukherjee, R., Nath, R.K., Sikdar, B.K.: on the reliability of majority logic structure in quantum-dot cellular automata. Microelectron. J. 47, 7–18 (2016)
Hosseinzadeh, H., Heikalabad, S.R.: A novel fault tolerant majority gate in quantum-dot cellular automata to create a revolution in design of fault tolerant nanostructures, with physical verification. Microelectron. Eng. 192, 52–60 (2018). https://doi.org/10.1016/j.mee.2018.01.019
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
Heikalabad, S.R., Kamrani, H. Design and implementation of circuit-switched network based on nanoscale quantum-dot cellular automata. Photon Netw Commun 38, 356–377 (2019). https://doi.org/10.1007/s11107-019-00864-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-019-00864-w