CHAPTER 3 QCA INTRODUCTION

Size: px
Start display at page:

Download "CHAPTER 3 QCA INTRODUCTION"

Transcription

1 24 CHAPTER 3 QCA INTRODUCTION Quantum dot cellular automata provide a novel electronics paradigm for information processing and communication. It has been recognized as one of the revolutionary nanoscale computing devices. A major advantage of QCA over other nanoelectronic architectural styles is that the same cells that are used for making logic gates can be used to build wires carrying logic signals. The QCA allows operating frequencies in range of THz and device integration densities about 900 times more than the current end of CMOS scaling limits, which is not possible in current CMOS technologies. It has been predicted as one of the future nanotechnologies in Semiconductor Industries Association s International Roadmap for Semiconductors (ITRS).Logical operations and data movement are accomplished via Coulombic interaction between neighbouring QCA cells rather than current flow. The QCA design involves diverse new paradigms such as memoryin-motion and processing-by-wire. Memory-in-motion is an instance of the more general paradigm of processing-by-wire. Processing-by-wire (PBW) is the QCA capability by which information manipulation can be accomplished, while transmission and communication of signals take place. PBW capabilities can be observed in the so-called inverter chain as well as in the arrangement of the cells in an MV.

2 25 Quantum dots are nanostructures created from standard semi conductive materials such as InAs/GaAs. These structures can be modeled as 3-dimensional quantum wells. As a result, they exhibit energy quantization effects even at distances several hundred times larger than the material system lattice constant. A quantum dot can indeed be visualized as a well. Electrons, once trapped inside the dot, do not alone possess the energy required to escape. We can use quantum physics to our advantage because the smaller a quantum dot is physically, the higher the potential energy necessary for an electron to escape. The Figure 3.1 below shows an example of a quantum dot given by Konard walus et al (2004). Figure 3.1 Example quantum dot pyramid created with InAs/GaAs 3.1 QCA CELL The fundamental unit in QCA circuits is a QCA cell which consists of four quantum dots which are arranged in a square pattern as shown in Figure 3.2. Zhang et al (2004) have stated the cell is charged with two excess electrons which can be allowed to tunnel between the different quantum dots by a clocking mechanism. These electrons tend to occupy the antipodal sites as a result of their mutual electrostatic repulsion. The columbic repulsion is

3 26 responsible for the transfer of information from one cell to an adjacent cell. Thus, there exist two equivalent energetically minimal arrangements of the two electrons in the QCA cell as shown in Figure 3.2. These two arrangements are denoted as cell polarization P= +1and P= -1.By using cell polarization P =+1 to represent logic 1 and P =-1 to represent logic 0, binary information is encoded in the charge configuration of the QCA cell. Also there are special purpose rotated cells. The regular cell and the rotated cell don't interact with each other when they are aligned, so rotated cells can be used for coplanar wire crossings. Figure 3.2 Basic QCA cell and two possible polarizations In QCA design, the cells are arranged systematically to implement the desired gate and interconnect structures. The QCA designs are typically analyzed using detailed cell to cell interactions. The bounding box shown around the cell is used only to identify one cell from another; they do not represent any physical system. Because the electrons are quantum mechanical particles they are able to tunnel between the dots in a cell. The electrons in cells placed adjacent to each other will interact. As a result, the polarization of one cell will be directly affected by the polarization of its neighbouring cells. This interaction is shown in Figure 3.3 with the corresponding non-linear cell-to-cell response function.

4 27 Figure 3.3 Non-linear response functions of one cell onto its neighbour The first cell acts as a driver and its polarization is varied from -1 to 1. The graph shows the resulting polarization of its neighbour. Konard walus (2004) stated that the driver cell will force an almost complete polarization in its neighbour, even if its own polarization is not saturated. This interaction forces neighbouring cells to synchronize their polarization. Therefore, an array of QCA cells acts as a wire and is able to transmit information from one end to another; i.e. all the cells in the wire will switch their polarizations to follow that of the input or driver cell. The electrostatic energy of two cells (cell a and cell b, with respective polarizations P a and P b ), are given by the Equation (3.1). The total energy of the two cells is calculated by the sum of the electrostatic energy between each of the four quantum-dots of cell a, (with charge q a i and location r a i ) and each of the four quantum-dots of cell b, (with charge q b j and location r a j ); both i and j range from 1 to 4, as there are 4 quantum-dots in each cell. E a,b 4 4 a b 1 qi q j 4 πε (3.1) r r a b i= 1 j= 1 i j E = E E (3.2) a,b a,b kink pa pb pa = pb

5 QCA LOGIC DEVICES Walus et al (2004) have given the details of QCA logic devices. The QCA logic primitives include a QCA wire, QCA inverter, and QCA majority gate as described below QCA Wire The wire is a horizontal row of QCA cells and a binary signal propagates from input to output because of the electrostatic interactions between adjacent cells. If the cell is charged with two extra electrons, the electrons will be located diagonally. This kind of location is due to columbic repulsion forces which do not allow them to locate in other arrangements. When the electron in one cell is located in a special diagonal (logic 1), this polarization induces the electrons in the neighbour QCA to be located with the same polarization. The wires constructed using the two types of cells such as regular cells and rotated cells as shown in Figure 3.4 and Figure 3.5. In 45 wire, the propagation of the binary signal alternates between the two polarizations. Figure 3.4 QCA wire (90 ) Figure 3.5 QCA wire (45 )

6 29 Figure 3.6 Wire crossing Figure 3.7 QCA Inverter Finally, QCA wires possess the unique property that they able to cross in the plane without the damage of the value being transmitted on either wire as shown in Figure 3.6. This property holds only if the QCA wires are of different orientations QCA Inverter The coulombic interaction between adjacent cells allows to implement logic circuits by simply changing the cell placement in the layout. In particular the inverter can be realized as shown in Figure 3.7 which is usually formed by placing the cells with only their corners touching. The electrostatic interaction is inverted, because the quantum-dots corresponding to different polarizations are misaligned between the cells. That is, the binary information stored in cell 1 is transferred to cells 2 to 6. The electron pair in cell 7 interacts with its neighbouring cells 5 and 6 to increase the columbic interaction and switching to the state with opposite polarization. The QCA inverter can be implemented in two ways such as positioning and rotation. Figure 3.7 shows one way to position QCA cells to invert the output from input logic level. This is known as fork inverter. The output cell is affected by both end cells of the fork to insure reliable operations. In inverter, the 45 displacement in the two lines of merging cells produces complement action of the input signal. Unlike conventional CMOS

7 30 in which it is the simplest block, the inverter consumes a substantial area in QCA QCA Majority Gate The fundamental QCA logic device is a three input majority gate. It consists of five cells: a central logic cell, three input cells labelled A, B and C and an output cell. The QCA majority gate performs a three-input logic function. The logic function of the majority gate is M (A, B, C) = AB+BC+CA. (3.3) Figure 3.8 QCA majority gate layout and symbol A layout of a QCA majority gate is shown in Figure 3.8. The tendency of the majority device cell (central cell) to move to a ground state ensures that it takes on the polarization of the majority of its neighbours. The device cell will tend to follow the majority polarization because it represents the lowest energy state. By fixing the polarization of one input to the QCA majority gate as logic 1 or logic 0, an AND gate or OR gate will be obtained, respectively, as follows: M(A,B,0) = AB (3.4) M(A,B,1) = A+B (3.5) Thus, we can base all QCA logic circuits on three-input majority gates. In order to achieve efficient QCA design, majority gate-based design techniques

8 31 are required. The truth table of majority gate is shown below. The majority gate output M (A, B, C) reflects the majority of inputs. Table 3.1 Truth table of Majority gate A B C M (A,B,C) Nand-Nor-Inverter (NNI) Pijush Kanti Bhattacharjee (2010) has done research on NNI gate. The NNI gate is a universal gate. It can be employed for realizing logical functions and requires less overhead, for setting the variables while realizing the basic logic gates. NNI gate ensures very less space comparing to that of the other gates like MV, AOI and inverter (NOT) gate. The conventional AND and OR gates can be realized with the majority gate by fixing an input as 0 and 1 respectively. The MG cannot realize the logical NOT operation. The functionality complete set is {MG, NOT}. Therefore, the designers have to use separate QCA cell arrangement for realization of the logical NOT. Thus to implement MG with NOT function the resulting gate is called Nand-Nor-Inverter gate as shown in Figure 3.11.

9 32 Figure 3.9 QCA NNI gate and Symbol The truth table of NNI gate is shown below. The output of NNI gate depends on the input B expect that all the inputs are equal. If all the inputs are equal then the output is complement of inputs. The gate computes the logic function as, NNI (A, B, C) = M (A', B, C') = A'B+BC'+C'A'. (3.6) Table 3.2 Truth table of NNI gate A B C NNI(A,B,C) AND-OR-Inverter (AOI) Mariam Momenzadeh et al (2005) have proposed a complex QCA gate. It is a 7 cell gate with 5 input cells, one device cell and one output cell. The gate can be built from the original 5-cell MV by adding two extra inputs (cells A and C); these two inputs have an inverting effect on the centre cell as

10 33 it can be seen from the layout of the inverter in Figure 3.7 that cells in a diagonal orientation tend to exhibit an inverting function. It is an universal QCA gate with embedded AND, OR and INV functions, and with better usability for synthesis. The logic function realized by the AOI gate is: F = DE + (D + E) (A' C' + A'B + BC'), (3.7) = Maj (D, E, Maj (A', B, C')). where Maj is the 3-input majority function. Figure 3.10 AOI gate lay out and Symbol Figure 3.11 AOI gate in terms of MV The AOI gate is logically equivalent to a concatenation of two majority voters (MV) with 2 complemented inputs (A and C) as shown in Figure The layout of AOI gate consists of two nested MVs. MV1 performs the function MV1= (A', B, C'). The horizontal input B has the strongest influence on the center cell in a MV. Hence, in the AOI gate, the cell B is placed further away than A and C. The second majority voter is MV2 = Maj (D, E, MV1). In the AOI gate, the distances d1, d2 and d3 as shown in Figure 3.10 to be considered for proper operation of input and output binary wires.

11 34 The stable configuration of AOI the distances are fixed with d1= d3= d4=25nm and d2=35nm Fanout In a fanout, one signal comes in and several copies of input go out. Each output reflects the input. The FANOUT is just the opposite of a majority gate. In standard electronic, circuits a FANOUT is just a connection of several metal wires. Figure 3.12 QCA Fanout Crossover Design Walus et al (2004) have given two crossover options. There are coplanar crossings and multilayer crossovers. Crossing of two wires in one plane is achieved by placing a binary wire (90 ) and inverter chain (45 ) as shown in Figure 3.6. The two signals are able to cross each other without interference since the wires of different orientation do not have any switch effect on each other.this is known as coplanar crossings. The Coplanar crossings use only one layer, but require two cell types (regular and rotated). The regular cell and the rotated cell do not interact with each other when they are properly aligned, so rotated cells can be used for coplanar wire crossings. This feature allows the coplanar crossover to transmit information independently along the two different cell wires. One

12 35 wire comprised of regular cells and other comprised of rotated cells as shown in Figure In the coplanar crossing, rotated cells are used when two wires cross. By choosing the connection point from rotated cells, either an original or an inverse of the input is available. If the effect of the vertical wire consisting of the rotated cells could be ignored, then the information in horizontal wire progress across the gap. Figure 3.13 Coplanar crossover Figure 3.14 Multi layer crossover Multilayer crossovers are used for wire crossings. They use more than one layer of cells like bridge. The signals are transferred from one layer to another layer using these multilayer QCA cells. To do this, it requires a vertical interconnect. By stacking cells one on top of another, the signal can be transmitted to another layer where the signal is again transmitted horizontally. The vertical separation between cells can be tuned to match the E kink of the horizontal cells. Unlike present CMOS integrated circuits, where metal layers are used to connect discontinuous sections of a circuit and cannot perform any intelligent functions, the extra layers of QCA can be used as active components of the circuit. Hence the multilayer circuits can potentially consume much less area as compared to coplanar circuits. On the other hand, a multilayer crossover is quite straightforward from the design perspective and the signal connection is steadier. The multilayer crossovers use more than one layer of cells like multiple metal layers in a conventional IC.

13 QCA Clocking In VLSI systems, timing is controlled through a reference signal (i.e., a clock) and is mostly required for sequential circuits. Timing in QCA is accomplished by clocking in four distinct and periodic phases and is needed for both combinational and sequential circuits. Clocking provides control of information flow and true power gain in QCA. Signal energy lost to the environment is restored by the clock. For QCA, the clock signals are generated through an electric field, which is applied to the cells to either raise or lower the tunneling barrier between dots within a QCA cell. When the barrier is low, the cells are in a non-polarized state; when the barrier is high, the cells are not allowed to change state. Adiabatic switching is achieved by lowering the barrier, removing the previous input, applying the current input and then raising the barrier. If transitions are gradual, the QCA system will remain close to the ground state. Clocking of QCA circuits has been explained by Heumpil Cho et al (2007). It requires a completely different approach than CMOS. The cells are not powered from any other external source apart from the clock. In order to pump information down a circuit in a controllable manner four clocking zones are available as shown in Figure Each of clocking signal is phase shifted by 90degrees with respect to one before. Figure 3.15 QCA clocking zones Figure 3.16 The four phases of clock

14 37 The QCA clocks control the potential barrier between the dots. The change in potential barrier allows to control the rate at which the electrons quantum mechanically tunnel between the dots in the QCA cell and therefore, the switching of its polarization. When the clock signal is high the potential barriers between the dots are low and electrons effectively spread out in the cell and no net polarization exists (P = 0).As the clock signal is switched low, the potential barriers between the dots are raised high and the electrons are localized such that a polarization is developed based on the interaction of their neighbours. When clock is high cell is unlatched and when clock is low cell is latched. Cells can be grouped into zones so that the field influencing all the cells in the zones will be the same. A zone cycles through 4 phases. Kyosun Kim et al (2007) have explained about the 4 phases. In the Switch phase, the tunneling barriers in a zone are raised. While this occurs, the electrons within the cell can be influenced by the Columbic charges of neighbouring zones. Zones in the Hold phase have a high tunneling barrier and will not change state, but influence other adjacent zones. The Release and Relax phases decrease the tunneling barrier so that the zone will not influence other zones. The clock signals act to pump information in the circuit as a result of the successive latching and unlatching in cells connected to different clock phases. For example, a wire, which is clocked from left to right with increasing clocking zones, will carry information in the same direction; i.e., from left to right. Walus et al (2003) stated that the different part of the wire is connected to the different clock signals. Figure 3.17 shows a wire connected to different clock zones. Each group of cells connected to a particular clocking zone can be described schematically as a D-latch. The decreasing

15 38 shades of gray represent increasing clocking zones. Since the cells in one clock zone get latched and stay latched until the next groups of cells get latched, they can be considered a D-latch. This is not a regular D-latch because a group of cells connected to C1 will only transmit information to cells connected to C2, never C0 nor C3. Figure 3.18 shows the D-latches with the appropriate clock zone to obtain a schematic representation of the QCA wire. Figure 3.17 Clocked QCA wire A low value of the clock means that the cells are latched. When the clock signal is high, the cells are relaxed, and have no polarization. In between, the cells are either latching or relaxing when the clock is decreasing /increasing respectively. The minimum size of the clocking zone is determined by the minimum feature size of the technology used to support clocking. Large clocking zones can be problematic because signals travelling down long QCA wires have increased probability of error from outside influences. These include thermal effects, which can potentially flip the state of a cell. Small clocking zones allow the designer the ability to create more complicated and dense circuits. 3.3 QCADESIGNER QCA logic and circuit designers require a rapid and accurate simulation and design layout tool to determine the functionality of QCA circuits. QCADesigner gives the designer the ability to quickly layout a QCA

16 39 design by providing an extensive set of Computer Aided Design (CAD) tools. As well, several simulation engines facilitate rapid and accurate simulation. It is the first publicly available design and simulation tool for QCA, developed at the ATIPS Laboratory, at the University of Calgary. QCADesigner is capable of simulating complex QCA circuits on most standard platforms. One of the most important design specifications is that other developers should be able to easily integrate their own utilities into QCADesigner. This is accomplished by providing a standardized method of representing information within the software. As well, simulation engines can easily be integrated into QCADesigner using a standardized calling scheme and data types. The QCADesigner has three distinct simulation engines. Each of the three engines has a different and important set of benefits and drawbacks. Additionally, each simulation engine can perform an exhaustive verification of the system or a set of user-selected vectors Digital Simulation Engine The digital simulation engine is a binary logic simulator within QCADesigner. This engine considers each cell to be in one of three states: null, logical one, or logical zero. With these three states and the appropriate clocking zone information for each cell, a design can be quickly simulated to ensure that for a given set of inputs, the correct set of outputs will be produced. This allows the logic designer to determine if the structure that has been laid out in QCADesigner corresponds to the desired logic function. The simulator functions by first assigning values to the inputs of the design. Then, for each change in the clock, only cells about to switch are considered. Cells in the release and relax states are given a null value. Any cells about to switch are processed by assigning them values based on the QCA interaction rules and the polarization of cells in their neighbourhood.

17 40 After all switching cells have been processed, their values are examined to ensure that none are null which ensures that the system will operate on all cells. Upon completing this check, the clock cycle is finished and the next cycle begins. This simulation will continue until all input combinations are exhausted and the last input vector has traversed the system. Since each cell can only receive input/output from its immediate neighbours in this engine, most QCA structures are able to be handled. The advantage of this simulator is that a designer can quickly see if the logic functionality of a system corresponds to what is desired. Since no physical information outside of cell locations and orientation is needed by the simulator, it should remain an integral part of QCADesigner throughout its lifetime Nonlinear Approximation Simulation Engine The nonlinear approximation simulation engine is built on a nonlinear approximation to the cell-to-cell response function. It has been shown that two cells have a nonlinear cell-to-cell response function shown in Figure 3.3. This approximation excludes the quantum mechanical correlations between cells. The system is assumed to switch adiabatically, always remaining very close to the ground state. The polarization state of each of the cells is computed using P i = E k i, j 2γ j P k E i, j 1 + P j 2 γ j j (3.8) where P i is the polarization state of the cell, and P j is the polarization state of the neighbouring cells. E k i, j is the kink energy between cells, i and j represents the energy cost of oppositely polarized cells, γ is the tunnelling potential and

18 41 is used to clock the circuit, as described by Walus (2004). Since experimentally determined switching times are not available, the simulation does not include any timing information. Using this response function the simulation engine calculates the state of each cell with respect to other cells within a predetermined effective radius. This calculation is iterated until the entire system converges within a predetermined tolerance. Once the circuit has converged, the output is recorded and new input values are set. It is believed that although this approximation is sufficient to verify the logical functionality of a design, it cannot be extended to include valid dynamic simulation; but, as a result of its simplicity this simulation engine is able to simulate a large number of cells very rapidly and, therefore, provides a good, in process, check of a design. For a more accurate simulation the twostate simulation engine is required Two-State Simulation Engine (Bistable simulation Engine) To facilitate more accurate simulations we require a more advanced simulation engine. The two-state model assumes that the cell is a simple twostate system and it was proposed by Walus (2004). For this two-state system, it has been shown that the following Hamiltonian (H i ) can be constructed. H i 1 k P j E i, j γ i 2 = (3.9) j 1 k γi P j E i, j 2 where E k i, j is the kink energy between cell i and j. This kink energy is associated with the energy cost of two cells having opposite polarization. P j is the polarization of cell. γ is the tunneling energy of electrons within the cell. The summation is over all cells within an effective radius of cell i, and can be set prior to the simulation. Using the time-independent Schrödinger equation

19 42 we are able to find the stationary states of the cell in the environment described by this Hamiltonian. QCADesigner uses the Jacobi algorithm to find the eigenvalues and eigenvectors of the Hamiltonian with H i Ψi = E i Ψi (3.10) where H i is the Hamiltonian given in Equation (3.9). Ψi is the state vector of the cell. E i is the energy associated with the state. The algorithm sorts each of the states, Ψi, according to their respective energy, in ascending order. The first state in the sorted list is that which has the lowest energy. Our assumption is that the system remains very close to the ground state during computation. As a result, the state with the lowest energy is chosen and the cell polarization is set accordingly. The two state simulation engine computes the polarization of each cell in the design until the entire system has converged to a preset tolerance. Once the system has converged, the output values are recorded, new input values are set and the simulation is reiterated. This method is less efficient in comparison to the nonlinear approximation, and as a result leads to longer simulation times. The advantage of this method is that the model on which it is based is far more accurate. Before the simulation starts, the simulation parameters need to be defined. All the simulations presented in this thesis use the bistable simulation engine. All parameters use the default values provided by QCADesigner. The following parameters are used for a bistable approximation:

20 43 Table 3.3 Truth table of simulation parameters Parameters Values Cell Size 20 nm Number Of Samples Convergence Tolerance Radius of Effect 65nm Relative Permittivity 12.9 Clock High 9.8e-22J Clock Low 3.8e-23J Clock Amplitude Factor 2 Layer Separation 11.5nm Maximum Iteration Per Sample The definition of simulation parameters are given below: Convergence Tolerance During each sample, each cell is converged by the simulation engine. The sample will complete when the polarization of each cell has changed by less than this number; i.e. loop while any design cell has (old polarization - new polarization) > convergence tolerance. Radius of Effect Because the interaction effect of one cell onto another decays inversely with the fifth power of the distance between cells, need not to consider each cell as affecting every other cell. This number determines how far each cell will look to find its neighbours. The next-to-nearest neighbours are included in this radius.

21 44 Figure 3.18 Radius effect of the cell. Figure 3.19 Clock signal Note that with multilayer capability the radius of effect is extended into the third dimension. Therefore in order to include cells in adjacent layers, make sure that the layer separation is less than the radius of effect. Relative Permittivity The relative permittivity of the material is essential for simulation. For GaAs/AlGaAs it is roughly 12.9 which is the default value. This is only used in calculating the kink energy. Clock Signal The clock signal in QCADesigner is calculated as a hard-saturating cosine as shown below. The clock signal is tied directly to the tunneling energy in the Hamiltonian. Clock High/Clock Low Clock low and high values are the saturation energies for the clock signal. When the clock is high the cell is unlatched. When it is low the cell is latched.

22 45 Clock Shift The clock shift is used to add a positive or negative offset to the clock as shown in the Figure Clock Amplitude Factor Clock amplitude factor is multiplied by (Clock High - Clock Low) and reflects the amplitude of the underlying cosine. Layer Separation When simulating multilayer QCA circuits, this determines the physical separation between the different cell layers in (nm). Maximum Iterations per Sample If the design does not converge in this number of iterations, then the simulation will move on to the next sample point. 3.4 QCADESIGNER WINDOW QCADesigner is the QCA layout editor and simulator. The main layout design window of QCADesigner is presented in Figure Figure 3.20 QCADesigner layout editor window

23 46 The physical layout editing facilities include: Drawing QCA cells individually or in arrays, optionally aligned to a grid with a default spacing (20 nm) equal to the default cell size (18 nm) plus the default inter cell spacing (2 nm). Setting clock signal for each QCA cell, this is required to have synchronous circuits working properly. Multi-layer QCA layout design, which is required to have multi layer signal crossing. Drawing QCA cells with 90 degrees rotation, which is required to have in plane signal crossing. Figure 3.21 QCA cell style conventions used to visually distinguish the cells on the Main Cell Layer from the cell used in via and crossover connections Graphical marking of special cells (on via and crossover layers), according to the Convention presented in Figure Although cell in via and crossover structures may look different in the layout, they are regular QCA cells and no distinction is made during simulation. Cells acting as vertical via interconnections between layers are represented by a square with a circle inside, and cells in crossover layers are represented by a square with a cross inside, the normal cells are represented as a square with four little circles inside and the arrangement of those circles depend on the rotation of the cell.

24 47 Grouping the input/output signals in buses, to simplify signal name handling, simulation input vectors definition, and simulation results inspection (see Figure 3.22). Figure 3.22 Grouping the QCA layout signals using buses in QCADesigner As layouts become more complex, the designer may wish to group inputs and outputs logically into buses. A bus is simply a named collection of inputs or of outputs. Once the design contains inputs and/or outputs, the designer can group them into buses using the bus layout dialog. The simulation can be performed with an exhaustive set of input vectors, or alternatively with a user-defined set of input vectors (Figure 3.23). Figure 3.23 QCADesigner simulation inputs window

25 48 Figure 3.24 QCADesigner simulation results window There are two integrated simulation engines available with QCADesigner: the Coherence Vector Simulation Engine, which is slower, but provides more accurate results, than the Bistable Simulation Engine. Simulation results are presented as waveforms, optionally grouped in buses as shown in Figure CONCLUSION The relevant QCA background for this research is presented in this Chapter 3, where the theoretical basis of Quantum Cellular Automata is discussed. The basic logic elements of this technology and its operation are explained here. A detailed explanation of the software tool QCADesigner is presented in this Chapter. The different types of simulation engines and the corresponding simulation parameters are defined here.

BINARY TO GRAY CODE CONVERTER IMPLEMENTATION USING QCA

BINARY TO GRAY CODE CONVERTER IMPLEMENTATION USING QCA BINARY TO GRAY CODE CONVERTER IMPLEMENTATION USING QCA Neha Guleria Department of Electronics and Communication Uttarakhand Technical University Dehradun, India Abstract Quantum dot Cellular Automata (QCA)

More information

Five-Input Complex Gate with an Inverter Using QCA

Five-Input Complex Gate with an Inverter Using QCA Five-Input Complex Gate with an Inverter Using QCA Tina Suratkar 1 Assistant Professor, Department of Electronics & Telecommunication Engineering, St.Vincent Pallotti College Of Engineering and Technology,

More information

Analysis And Design Of Priority Encoder Circuit Using Quantum Dot Cellular Automata

Analysis And Design Of Priority Encoder Circuit Using Quantum Dot Cellular Automata Analysis And Design Of Priority Encoder Circuit Using Quantum Dot Cellular Automata P. Ilanchezhian Associate Professor, Department of IT, Sona College of Technology, Salem Dr. R. M. S. Parvathi Principal,

More information

Design of Optimized Quantum-dot Cellular Automata RS Flip Flops

Design of Optimized Quantum-dot Cellular Automata RS Flip Flops Int. J. Nanosci. Nanotechnol., Vol. 13, No. 1, March. 2017, pp. 53-58 Design of Optimized Quantum-dot Cellular Automata RS Flip Flops A. Rezaei* 1 Electrical Engineering Department, Kermanshah University

More information

IMPLEMENTATION OF PROGRAMMABLE LOGIC DEVICES IN QUANTUM CELLULAR AUTOMATA TECHNOLOGY

IMPLEMENTATION OF PROGRAMMABLE LOGIC DEVICES IN QUANTUM CELLULAR AUTOMATA TECHNOLOGY IMPLEMENTATION OF PROGRAMMABLE LOGIC DEVICES IN QUANTUM CELLULAR AUTOMATA TECHNOLOGY Dr.E.N.Ganesh Professor ECE Department REC Chennai, INDIA Email : enganesh50@yahoo.co.in Abstract Quantum cellular automata

More information

DESIGN OF QCA FULL ADDER CIRCUIT USING CORNER APPROACH INVERTER

DESIGN OF QCA FULL ADDER CIRCUIT USING CORNER APPROACH INVERTER Research Manuscript Title DESIGN OF QCA FULL ADDER CIRCUIT USING CORNER APPROACH INVERTER R.Rathi Devi 1, PG student/ece Department, Vivekanandha College of Engineering for Women rathidevi24@gmail.com

More information

STUDY AND IMPLEMENTATION OF MUX BASED FPGA IN QCA TECHNOLOGY

STUDY AND IMPLEMENTATION OF MUX BASED FPGA IN QCA TECHNOLOGY STUDY AND IMPLEMENTATION OF MUX BASED FPGA IN QCA TECHNOLOGY E.N.Ganesh 1 / V.Krishnan 2 1. Professor, Rajalakshmi Engineering College 2. UG Student, Rajalakshmi Engineering College ABSTRACT This paper

More information

Quantum-Dot Cellular Automata (QCA)

Quantum-Dot Cellular Automata (QCA) Quantum-Dot Cellular Automata (QCA) Quantum dots are nanostructures [nano-: one billionth part of] created from standard semiconductive material. A quantum dot can be visualized as a well. Electrons, once

More information

Radiation Effects in Nano Inverter Gate

Radiation Effects in Nano Inverter Gate Nanoscience and Nanotechnology 2012, 2(6): 159-163 DOI: 10.5923/j.nn.20120206.02 Radiation Effects in Nano Inverter Gate Nooshin Mahdavi Sama Technical and Vocational Training College, Islamic Azad University,

More information

Design and Optimization of Parity Generator and Parity Checker Based On Quantum-dot Cellular Automata Santanu Santra, Utpal Roy

Design and Optimization of Parity Generator and Parity Checker Based On Quantum-dot Cellular Automata Santanu Santra, Utpal Roy Design and Optimization of Parity Generator and Parity Checker Based On Quantum-dot Cellular Automata Santanu Santra, Utpal Roy Abstract Quantum-dot Cellular Automata (QCA) is one of the most substitute

More information

DESIGN OF AREA-DELAY EFFICIENT ADDER BASED CIRCUITS IN QUANTUM DOT CELLULAR AUTOMATA

DESIGN OF AREA-DELAY EFFICIENT ADDER BASED CIRCUITS IN QUANTUM DOT CELLULAR AUTOMATA International Journal on Intelligent Electronic System, Vol.9 No.2 July 2015 1 DESIGN OF AREA-DELAY EFFICIENT ADDER BASED CIRCUITS IN QUANTUM DOT CELLULAR AUTOMATA Aruna S 1, Senthil Kumar K 2 1 PG scholar

More information

Double Feynman Gate (F2G) in Quantumdot Cellular Automata (QCA)

Double Feynman Gate (F2G) in Quantumdot Cellular Automata (QCA) Double Feynman Gate (F2G) in Quantumdot Cellular Automata (QCA) Ali Newaz Bahar E-mail: bahar_mitdu@yahoo.com Sajjad Waheed E-mail: sajad302@yahoo.com Md. Ashraf Uddin Department of Computer Science and

More information

DESİGN AND ANALYSİS OF FULL ADDER CİRCUİT USİNG NANOTECHNOLOGY BASED QUANTUM DOT CELLULAR AUTOMATA (QCA)

DESİGN AND ANALYSİS OF FULL ADDER CİRCUİT USİNG NANOTECHNOLOGY BASED QUANTUM DOT CELLULAR AUTOMATA (QCA) DESİGN AND ANALYSİS OF FULL ADDER CİRCUİT USİNG NANOTECHNOLOGY BASED QUANTUM DOT CELLULAR AUTOMATA (QCA) Rashmi Chawla 1, Priya Yadav 2 1 Assistant Professor, 2 PG Scholar, Dept of ECE, YMCA University

More information

I. INTRODUCTION. CMOS Technology: An Introduction to QCA Technology As an. T. Srinivasa Padmaja, C. M. Sri Priya

I. INTRODUCTION. CMOS Technology: An Introduction to QCA Technology As an. T. Srinivasa Padmaja, C. M. Sri Priya International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 5 ISSN : 2456-3307 Design and Implementation of Carry Look Ahead Adder

More information

Serial Parallel Multiplier Design in Quantum-dot Cellular Automata

Serial Parallel Multiplier Design in Quantum-dot Cellular Automata Serial Parallel Multiplier Design in Quantum-dot Cellular Automata Heumpil Cho and Earl E. Swartzlander, Jr. Application Specific Processor Group Department of Electrical and Computer Engineering The University

More information

Designing Cellular Automata Structures using Quantum-dot Cellular Automata

Designing Cellular Automata Structures using Quantum-dot Cellular Automata Designing Cellular Automata Structures using Quantum-dot Cellular Automata Mayur Bubna, Subhra Mazumdar, Sudip Roy and Rajib Mall Department of Computer Sc. & Engineering Indian Institute of Technology,

More information

A Novel Design for Quantum-dot Cellular Automata Cells and Full Adders

A Novel Design for Quantum-dot Cellular Automata Cells and Full Adders A Novel Design for Quantum-dot Cellular Automata Cells and Full Adders Mostafa Rahimi Azghadi *, O. Kavehei, K. Navi Department of Electrical and Computer Engineering, Shahid Beheshti University, Tehran,

More information

A Novel Design and Implementation of New Double Feynman and Six-correction logic (DFSCL) gates in Quantum-dot Cellular Automata (QCA)

A Novel Design and Implementation of New Double Feynman and Six-correction logic (DFSCL) gates in Quantum-dot Cellular Automata (QCA) A Novel Design and Implementation of New Double Feynman and Six-correction logic (DFSCL) gates in Quantum-dot Cellular Automata (QCA) Dr. Sajjad Waheed Sharmin Aktar Ali Newaz Bahar Department of Information

More information

A NOVEL PRESENTATION OF PERES GATE (PG) IN QUANTUM-DOT CELLULAR AUTOMATA(QCA)

A NOVEL PRESENTATION OF PERES GATE (PG) IN QUANTUM-DOT CELLULAR AUTOMATA(QCA) A NOVEL PRESENTATION OF PERES GATE (PG) IN QUANTUM-DOT ELLULAR AUTOMATA(QA) Angona Sarker Ali Newaz Bahar Provash Kumar Biswas Monir Morshed Department of Information and ommunication Technology, Mawlana

More information

Wire-Crossing Technique on Quantum-Dot Cellular Automata

Wire-Crossing Technique on Quantum-Dot Cellular Automata Wire-Crossing Technique on Quantum-Dot Cellular Automata Sang-Ho Shin 1, Jun-Cheol Jeon 2 and Kee-Young Yoo * 1 School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea

More information

arxiv: v1 [cs.et] 13 Jul 2016

arxiv: v1 [cs.et] 13 Jul 2016 Processing In-memory realization using Quantum Dot Cellular Automata arxiv:1607.05065v1 [cs.et] 13 Jul 2016 P.P. Chougule, 1 B. Sen, 2 and T.D. Dongale 1 1 Computational Electronics and Nanoscience Research

More information

International Journal of Combined Research & Development (IJCRD) eissn: x;pissn: Volume: 7; Issue: 7; July -2018

International Journal of Combined Research & Development (IJCRD) eissn: x;pissn: Volume: 7; Issue: 7; July -2018 XOR Gate Design Using Reversible Logic in QCA and Verilog Code Yeshwanth GR BE Final Year Department of ECE, The Oxford College of Engineering Bommanahalli, Hosur Road, Bangalore -560068 yeshwath.g13@gmail.com

More information

Two Bit Arithmetic Logic Unit (ALU) in QCA Namit Gupta 1, K.K. Choudhary 2 and Sumant Katiyal 3 1

Two Bit Arithmetic Logic Unit (ALU) in QCA Namit Gupta 1, K.K. Choudhary 2 and Sumant Katiyal 3 1 Two Bit Arithmetic Logic Unit (ALU) in QCA Namit Gupta 1, K.K. Choudhary 2 and Sumant Katiyal 3 1 Department of Electronics, SVITS, Baroli, Sanwer Road, Indore, India namitg@hotmail.com 2 Department of

More information

Reliability Modeling of Nanoelectronic Circuits

Reliability Modeling of Nanoelectronic Circuits Reliability odeling of Nanoelectronic Circuits Jie Han, Erin Taylor, Jianbo Gao and José Fortes Department of Electrical and Computer Engineering, University of Florida Gainesville, Florida 6-600, USA.

More information

NOVEL QCA CONTROL GATE AND NEW DESIGNING OF MEMORY ON THE BASIS OF QUANTUM DOT CELLULAR AUTOMATA WITH MINIMUM QCA BLOCKS

NOVEL QCA CONTROL GATE AND NEW DESIGNING OF MEMORY ON THE BASIS OF QUANTUM DOT CELLULAR AUTOMATA WITH MINIMUM QCA BLOCKS Indian J.Sci.Res. 2(1) : 96-100, 2014 ISSN : 2250-0138 (Online) ISSN: 0976-2876(Print) NOVEL QCA CONTROL GATE AND NEW DESIGNING OF MEMORY ON THE BASIS OF QUANTUM DOT CELLULAR AUTOMATA WITH MINIMUM QCA

More information

DESIGN OF AREA DELAY EFFICIENT BINARY ADDERS IN QUANTUM-DOT CELLULAR AUTOMATA

DESIGN OF AREA DELAY EFFICIENT BINARY ADDERS IN QUANTUM-DOT CELLULAR AUTOMATA DESIGN OF AREA DELAY EFFICIENT BINARY ADDERS IN QUANTUM-DOT CELLULAR AUTOMATA 1 Shrinidhi P D, 2 Vijay kumar K 1 M.Tech, VLSI&ES 2 Asst.prof. Department of Electronics and Communication 1,2 KVGCE Sullia,

More information

A Novel Design and Implementation of 8-3 Encoder Using Quantum-dot Cellular Automata (QCA) Technology

A Novel Design and Implementation of 8-3 Encoder Using Quantum-dot Cellular Automata (QCA) Technology A Novel Design and Implementation of 8-3 Encoder Using Quantum-dot Cellular Automata (QCA) Technology Md. Sofeoul-Al-Mamun Mohammad Badrul Alam Miah Fuyad Al Masud Department of Information and Communication

More information

Design of A Efficient Hybrid Adder Using Qca

Design of A Efficient Hybrid Adder Using Qca International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 PP30-34 Design of A Efficient Hybrid Adder Using Qca 1, Ravi chander, 2, PMurali Krishna 1, PG Scholar,

More information

Novel Bit Adder Using Arithmetic Logic Unit of QCA Technology

Novel Bit Adder Using Arithmetic Logic Unit of QCA Technology Novel Bit Adder Using Arithmetic Logic Unit of QCA Technology Uppoju Shiva Jyothi M.Tech (ES & VLSI Design), Malla Reddy Engineering College For Women, Secunderabad. Abstract: Quantum cellular automata

More information

Quasiadiabatic switching for metal-island quantum-dot cellular automata

Quasiadiabatic switching for metal-island quantum-dot cellular automata JOURNAL OF APPLIED PHYSICS VOLUME 85, NUMBER 5 1 MARCH 1999 Quasiadiabatic switching for metal-island quantum-dot cellular automata Géza Tóth and Craig S. Lent a) Department of Electrical Engineering,

More information

DELAY EFFICIENT BINARY ADDERS IN QCA K. Ayyanna 1, Syed Younus Basha 2, P. Vasanthi 3, A. Sreenivasulu 4

DELAY EFFICIENT BINARY ADDERS IN QCA K. Ayyanna 1, Syed Younus Basha 2, P. Vasanthi 3, A. Sreenivasulu 4 DELAY EFFICIENT BINARY ADDERS IN QCA K. Ayyanna 1, Syed Younus Basha 2, P. Vasanthi 3, A. Sreenivasulu 4 1 Assistant Professor, Department of ECE, Brindavan Institute of Technology & Science, A.P, India

More information

DESIGN OF REVERSIBLE ARITHMETIC AND LOGIC UNIT USING REVERSIBLE UNIVERSAL GATE

DESIGN OF REVERSIBLE ARITHMETIC AND LOGIC UNIT USING REVERSIBLE UNIVERSAL GATE DESIGN OF REVERSIBLE ARITHMETIC AND LOGIC UNIT USING REVERSIBLE UNIVERSAL GATE R.AARTHI, K.PRASANNA* Department of Electronics and Communication Engineering, Arasu Engineering College, Kumbakonam 612501.

More information

Design of an Optimal Decimal Adder in Quantum Dot Cellular Automata

Design of an Optimal Decimal Adder in Quantum Dot Cellular Automata International Journal of Nanotechnology and Applications ISSN 0973-631X Volume 11, Number 3 (2017), pp. 197-211 Research India Publications http://www.ripublication.com Design of an Optimal Decimal Adder

More information

International Journal of Advanced Research in ISSN: Engineering Technology & Science

International Journal of Advanced Research in ISSN: Engineering Technology & Science E n International Journal of Advanced Research in ISSN: 2349-2819 Engineering Technology & Science Email: editor@ijarets.org September-2016 Volume 3, Issue-9 A NOVEL RAM CELL DESIGN IN QUANTUM-DOT CELLULAR

More information

Available online at ScienceDirect. Procedia Computer Science 70 (2015 ) Bengal , India

Available online at   ScienceDirect. Procedia Computer Science 70 (2015 ) Bengal , India Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 70 (2015 ) 153 159 4 th International Conference on Eco-friendly Computing and Communication Systems (ICECCS) Design of

More information

Implementation of Quantum dot Cellular Automata based Novel Full Adder and Full Subtractor

Implementation of Quantum dot Cellular Automata based Novel Full Adder and Full Subtractor Implementation of Quantum dot Cellular Automata based Novel Full Adder and Full Subtractor Peer Zahoor Ahmad 1, Firdous Ahmad 2, b, Syed Muzaffar Ahmad 3, Dr. Rafiq Ahmad Khan 4 1 Department of Computer

More information

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html

More information

Design of Sequential Circuits Using MV Gates in Nanotechnology

Design of Sequential Circuits Using MV Gates in Nanotechnology 2015 IJSRSET Volume 1 Issue 2 Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Engineering and Technology Design of Sequential Circuits Using MV Gates in Nanotechnology Bahram Dehghan 1,

More information

Logic. Combinational. inputs. outputs. the result. system can

Logic. Combinational. inputs. outputs. the result. system can Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends

More information

Design of Arithmetic Logic Unit (ALU) using Modified QCA Adder

Design of Arithmetic Logic Unit (ALU) using Modified QCA Adder Design of Arithmetic Logic Unit (ALU) using Modified QCA Adder M.S.Navya Deepthi M.Tech (VLSI), Department of ECE, BVC College of Engineering, Rajahmundry. Abstract: Quantum cellular automata (QCA) is

More information

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).

More information

DESIGN OF PARITY GENERATOR AND PARITY CHECKER USING QUANTUM DOT AUTOMATA

DESIGN OF PARITY GENERATOR AND PARITY CHECKER USING QUANTUM DOT AUTOMATA Volume 118 No. 24 2018 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ DESIGN OF PARITY GENERATOR AND PARITY CHECKER USING QUANTUM DOT AUTOMATA MummadiSwathi

More information

Efficient Quantum Dot Cellular Automata (QCA) Implementation of Code Converters

Efficient Quantum Dot Cellular Automata (QCA) Implementation of Code Converters Efficient Quantum ot Cellular Automata (QCA) mplementation of Converters J. qbal, F. A. Khanday *, N. A. Shah epartment of Electronics and nstrumentation Technology, University of Kashmir, Srinagar 190006,

More information

Synchronous Sequential Logic

Synchronous Sequential Logic 1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in

More information

Quantum-dot cellular automata

Quantum-dot cellular automata Quantum-dot cellular automata G. L. Snider, a) A. O. Orlov, I. Amlani, X. Zuo, G. H. Bernstein, C. S. Lent, J. L. Merz, and W. Porod Department of Electrical Engineering, University of Notre Dame, Notre

More information

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary

More information

Design of a Controllable Adder-Subtractor circuit using Quantum Dot Cellular Automata

Design of a Controllable Adder-Subtractor circuit using Quantum Dot Cellular Automata IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 12, Issue 4 Ver. III (Jul. Aug. 2017), PP 44-59 www.iosrjournals.org Design of a Controllable

More information

ROBUSTNESS AND POWER DISSIPATION IN QUANTUM-DOT CELLULAR AUTOMATA. A Dissertation. Submitted to the Graduate School. of the University of Notre Dame

ROBUSTNESS AND POWER DISSIPATION IN QUANTUM-DOT CELLULAR AUTOMATA. A Dissertation. Submitted to the Graduate School. of the University of Notre Dame ROBUSTNESS AND POWER DISSIPATION IN QUANTUM-DOT CELLULAR AUTOMATA A Dissertation Submitted to the Graduate School of the University of Notre Dame in Partial Fulfillment of the Requirements for the Degree

More information

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

Computers also need devices capable of Storing data and information Performing mathematical operations on such data Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable

More information

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of EE 2449 Experiment 11 Jack Levine and Nancy Warter-Perez CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 11 SEQUENTIAL CIRCUITS

More information

Basic Logic Gate Realization using Quantum Dot Cellular Automata based Reversible Universal Gate

Basic Logic Gate Realization using Quantum Dot Cellular Automata based Reversible Universal Gate Basic Logic Gate Realization using Quantum Dot Cellular Automata based Reversible Universal Gate Saroj Kumar Chandra Department Of Computer Science & Engineering, Chouksey Engineering College, Bilaspur

More information

Chapter 7 Logic Circuits

Chapter 7 Logic Circuits Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary

More information

Chapter 1: Logic systems

Chapter 1: Logic systems Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR

More information

Matrix multiplication using quantum-dot cellular automata to implement conventional microelectronics

Matrix multiplication using quantum-dot cellular automata to implement conventional microelectronics Matrix multiplication using quantum-dot cellular automata to implement conventional microelectronics Joshua D Wood 1,3 and P Douglas Tougaw 2 1 Student Member, IEEE, Department of Electrical and Computer

More information

Synchronous Sequential Circuit

Synchronous Sequential Circuit Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait

More information

Testability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.

Testability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors. Testability Lecture 6: Logic Simulation Shaahin Hessabi Department of Computer Engineering Sharif University of Technology Adapted from the presentation prepared by book authors Slide 1 of 27 Outline What

More information

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)

More information

!"#$%&'()*"+,-./*($-"#+"0+'*"12%3+ (#3+4"#&'*"12%3+5'6+6)17-$%1$/)%8*

!#$%&'()*+,-./*($-#+0+'*12%3+ (#3+4#&'*12%3+5'6+6)17-$%1$/)%8* Università di Pisa!"$%&'()*"+,-./*($-"+"0+'*"12%3+ (3+4"&'*"12%3+5'6+6)17-$%1$/)%8* $%&'()*% I(8,4-(J1&-%9(0&/1/&14(,9155K0&6%4J,L(%&1MN51--4%&(',)0&6%4J,-(',)O151'%J2&(',L(%&() P&(Q14=(-R9(:(=, +$%,-..'/*0*'%

More information

Digital Integrated Circuits A Design Perspective

Digital Integrated Circuits A Design Perspective Semiconductor Memories Adapted from Chapter 12 of Digital Integrated Circuits A Design Perspective Jan M. Rabaey et al. Copyright 2003 Prentice Hall/Pearson Outline Memory Classification Memory Architectures

More information

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of

More information

Name: Answers. Mean: 38, Standard Deviation: 15. ESE370 Fall 2012

Name: Answers. Mean: 38, Standard Deviation: 15. ESE370 Fall 2012 University of Pennsylvania Department of Electrical and System Engineering Circuit-Level Modeling, Design, and Optimization for Digital Systems ESE370, Fall 2012 Final Friday, December 14 Problem weightings

More information

Week-I. Combinational Logic & Circuits

Week-I. Combinational Logic & Circuits Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and

More information

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100

More information

New Symmetric and Planar Designs of Reversible Full- Adders/Subtractors in Quantum-Dot Cellular Automata

New Symmetric and Planar Designs of Reversible Full- Adders/Subtractors in Quantum-Dot Cellular Automata 1 New Symmetric and Planar Designs of Reversible Full- Adders/Subtractors in Quantum-Dot Cellular Automata Moein Sarvaghad-Moghaddam 1, Ali A. Orouji 1,* 1 Department of Electrical and Computer Engineering,

More information

CHAPTER 7. Exercises 17/ / /2 2 0

CHAPTER 7. Exercises 17/ / /2 2 0 CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2

More information

COMBINATIONAL LOGIC FUNCTIONS

COMBINATIONAL LOGIC FUNCTIONS COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present

More information

Design of Multiplexer Based 64-Bit SRAM using QCA

Design of Multiplexer Based 64-Bit SRAM using QCA AUSTRALIAN JOURNAL OF BASIC AND APPLIED SCIENCES ISSN:1991-8178 EISSN: 2309-8414 Journal home page: www.ajbasweb.com Design of Multiplexer Based 64-Bit SRAM using QCA 1 K. Pandiammal and 2 D. Meganathan

More information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes

More information

Digital Integrated Circuits A Design Perspective. Semiconductor. Memories. Memories

Digital Integrated Circuits A Design Perspective. Semiconductor. Memories. Memories Digital Integrated Circuits A Design Perspective Semiconductor Chapter Overview Memory Classification Memory Architectures The Memory Core Periphery Reliability Case Studies Semiconductor Memory Classification

More information

ECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview

ECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview 407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation

More information

Realization of Single Qubit Operations Using. Coherence Vector Formalism in. Quantum Cellular Automata

Realization of Single Qubit Operations Using. Coherence Vector Formalism in. Quantum Cellular Automata Adv. Studies Theor. Phys., Vol. 6, 01, no. 14, 697-70 Realization of Single Qubit Operations Using Coherence Vector Formalism in Quantum Cellular Automata G. Pavan 1, N. Chandrasekar and Narra Sunil Kumar

More information

An Efficient design of Binary comparators in Quantum Dot Cellular Automata

An Efficient design of Binary comparators in Quantum Dot Cellular Automata An Efficient design of Binary comparators in Quantum Dot Cellular Automata Dammalapati Dileep 1, Vallabhaneni Ramesh Babu 2 1 PG Scholar, Dept of ECE (VLSI &Amp; ES), V.K.R., V.N.B., & A.G.K. College of

More information

MODULAR CIRCUITS CHAPTER 7

MODULAR CIRCUITS CHAPTER 7 CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,

More information

Simulation of Logic Primitives and Dynamic D-latch with Verilog-XL

Simulation of Logic Primitives and Dynamic D-latch with Verilog-XL Simulation of Logic Primitives and Dynamic D-latch with Verilog-XL November 30, 2011 Robert D Angelo Tufts University Electrical and Computer Engineering EE-103 Lab 3: Part I&II Professor: Dr. Valencia

More information

Area-Time Optimal Adder with Relative Placement Generator

Area-Time Optimal Adder with Relative Placement Generator Area-Time Optimal Adder with Relative Placement Generator Abstract: This paper presents the design of a generator, for the production of area-time-optimal adders. A unique feature of this generator is

More information

CORRELATION AND COHERENCE IN QUANTUM-DOT CELLULAR AUTOMATA. A Dissertation. Submitted to the Graduate School. of the University of Notre Dame

CORRELATION AND COHERENCE IN QUANTUM-DOT CELLULAR AUTOMATA. A Dissertation. Submitted to the Graduate School. of the University of Notre Dame CORRELATION AND COHERENCE IN QUANTUM-DOT CELLULAR AUTOMATA A Dissertation Submitted to the Graduate School of the University of Notre Dame in Partial Fulfillment of the Requirements for the Degree of Doctor

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter

More information

FAULT MODELS AND YIELD ANALYSIS FOR QCA-BASED PLAS 1

FAULT MODELS AND YIELD ANALYSIS FOR QCA-BASED PLAS 1 FAULT MODELS AND YIELD ANALYSIS FOR QCA-BASED PLAS Michael Crocker, X. Sharon Hu, and Michael Niemier Department of Computer Science and Engineering University of Notre Dame Notre Dame, IN 46556, USA Email:

More information

ISSN:

ISSN: 1306 DESIGN OF CARRY-LOOK-AHEAD ADDER USING REVERSIBLE LOGIC IMPLEMENTATION IN QCA SUBHASHEE BASU 1, ADITI BAL 2, SUPRIYA SENGUPTA 3 1, 2, 3 St Thomas College of Engineering and Technology,4 Diamond Harbour

More information

The ternary quantum-dot cell and ternary logic

The ternary quantum-dot cell and ternary logic Lebar Bajec I, Zimic N and Mraz M 26 Nanotechnology 7 937 c 26 IOP Publishing Ltd The ternary quantum-dot cell and ternary logic I Lebar Bajec, N Zimic and M Mraz University of Ljubljana, Faculty of Computer

More information

Building blocks for nanodevices

Building blocks for nanodevices Building blocks for nanodevices Two-dimensional electron gas (2DEG) Quantum wires and quantum point contacts Electron phase coherence Single-Electron tunneling devices - Coulomb blockage Quantum dots (introduction)

More information

Logic Design. Chapter 2: Introduction to Logic Circuits

Logic Design. Chapter 2: Introduction to Logic Circuits Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic

More information

6. Finite State Machines

6. Finite State Machines 6. Finite State Machines 6.4x Computation Structures Part Digital Circuits Copyright 25 MIT EECS 6.4 Computation Structures L6: Finite State Machines, Slide # Our New Machine Clock State Registers k Current

More information

Design a Collector with More Reliability against Defects during Manufacturing in Nanometer Technology, QCA

Design a Collector with More Reliability against Defects during Manufacturing in Nanometer Technology, QCA Journal of Software Engineering and pplications, 2013, 6, 304-312 http://dx.doi.org/10.4236/jsea.2013.66038 Published Online June 2013 (http://www.scirp.org/journal/jsea) Design a Collector with More Reliability

More information

A NML-HDL Snake Clock Based QCA Architecture

A NML-HDL Snake Clock Based QCA Architecture International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 A NML-HDL Snake Clock Based QCA Architecture 1 Mr. M. B. Kachare, 2 Dr. P. H. Zope 1 ME I st (Dig. Electronics),

More information

DIGITAL LOGIC CIRCUITS

DIGITAL LOGIC CIRCUITS DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,

More information

High Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family

High Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 11, Issue 04 (April 2015), PP.72-77 High Speed Time Efficient Reversible ALU Based

More information

Semiconductor Memories

Semiconductor Memories Semiconductor References: Adapted from: Digital Integrated Circuits: A Design Perspective, J. Rabaey UCB Principles of CMOS VLSI Design: A Systems Perspective, 2nd Ed., N. H. E. Weste and K. Eshraghian

More information

CSE370: Introduction to Digital Design

CSE370: Introduction to Digital Design CSE370: Introduction to Digital Design Course staff Gaetano Borriello, Brian DeRenzi, Firat Kiyak Course web www.cs.washington.edu/370/ Make sure to subscribe to class mailing list (cse370@cs) Course text

More information

Latches. October 13, 2003 Latches 1

Latches. October 13, 2003 Latches 1 Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory

More information

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life... Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there

More information

Every time has a value associated with it, not just some times. A variable can take on any value within a range

Every time has a value associated with it, not just some times. A variable can take on any value within a range Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»

More information

Quantum Cellular Automata Final Project Report. Apoorv Khurasia Pulkit Gambhir

Quantum Cellular Automata Final Project Report. Apoorv Khurasia Pulkit Gambhir Quantum Cellular Automata Final Project Report Apoorv Khurasia Pulkit Gambhir May 22, 2006 Abstract Our project involved the study of next generation paradigms of computation. In particular, our area of

More information

Dynamic behavior of quantum cellular automata

Dynamic behavior of quantum cellular automata Dynamic behavior of quantum cellular automata P. Douglas Tougaw Craig S. Lent a) Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana 46556 Received 2 November 1995; accepted

More information

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

ESE 570: Digital Integrated Circuits and VLSI Fundamentals ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 17: March 23, 2017 Energy and Power Optimization, Design Space Exploration, Synchronous MOS Logic Lecture Outline! Energy and Power Optimization

More information

The Design Procedure. Output Equation Determination - Derive output equations from the state table

The Design Procedure. Output Equation Determination - Derive output equations from the state table The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types

More information

Sample Test Paper - I

Sample Test Paper - I Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:

More information

Analysis of flip flop design using nanoelectronic single electron transistor

Analysis of flip flop design using nanoelectronic single electron transistor Int. J. Nanoelectronics and Materials 10 (2017) 21-28 Analysis of flip flop design using nanoelectronic single electron transistor S.Rajasekaran*, G.Sundari Faculty of Electronics Engineering, Sathyabama

More information

!"#"$#%&'(&)(*+,'#+-(."//+/,0( 1+#&-,#&'(1$#%&'(%'(2%/%$&'3&'3 %'4+/,#&0(."//4#

!#$#%&'(&)(*+,'#+-(.//+/,0( 1+#&-,#&'(1$#%&'(%'(2%/%$&'3&'3 %'4+/,#&0(.//4# Università di Pisa!""$%&'(&)(*+,'+-(."//+/,0( 1+&-,&'(1$%&'(%'(2%/%$&'3&'3 %'4+/,&0(."//4 $%&'(()*+,+)% 4)6%?&)@0/&'A)./*0*/0?)%A0BBC./D'?@%E)'/0FGB0&&?'/),%+./D'?@%&),%+H0B0,'@-/),%E)'/)+ I/)J0?5)&KA)L)5%

More information