A Project Report On
Parity Preserving adder-subtractor using novel reversible gate
Submitted to JNTU University for the partial fulfillment of the
Requirement for the award of degree of
MASTER OF TECHNOLOGY
IN
VLSI
Submitted By
E. LAVANYA 15D01D5718
Under the Guidance of
Ms. K. Pujitha
SMGOIH
DeshmukhiHyderabad
2017
ST. MARY’S GROUP OF INSTITUTIONS
DESHMUKHI
Department of Electronics and Communication Engineering
CERTIFICATE
This is to certify that the project report titled Parity Preserving adder-subtractor using novel reversible gate is being submitted by E. LAVANYA bearing Roll No. 15D01D5718 in Master of Technology in Very-Large-Scale Integration (M.Tech 2nd year-VLSI) during the academic year 2015-2017 is a record bonafide work carried out by them. The results embodied in this report have not been submitted to any other University for the award of any degree
HEAD OF DEPARTMENT
MR Ravi Kiran
DECLARATION
I therefore proclaim that outcomes embodied in this paper entitled “Parity Preserving Adder-Subtractor using novel reversible gate” has been completed by me amid the year 2015-17 for the satisfaction of honor of M.Tech (VLSI) from JNTU HYDERABAD. I have not presented the same to other college or association for the honor of whatever other degree.
By
E. LAVANYA
(15D01D5718)
ACKNOWLEDGEMENT
My Sincere gratitude and thanks to Almighty God, Our parents and other family members without whose uncontained support, We could not have made this career in M.Tech.
I wish to express my gratitude to Dr. M.Srinivas, Principal of SMGOIH and Prof. Ravi kiran, Mtech Incharge for their valuable suggestions and advices throughout the M.tech VLSI course. I also extend my thanks to other Faculties for their Cooperation during my Third Sem. Course. We wish to place on our record our deep sense of gratitude to our project guide, Prof Ravi Kiran for his constant motivation and valuable help through the project work.
Finally, I would like to thank my friends for their cooperation to complete this project.
E. LAVANYA
Abstract
The reversible consistent circuits, due to their managed control utilization in correlation with their partners with parallel circuits, have turned into a noteworthy issue of study. A reversible circuit with meet equality of information sources and yields is considered as an equality saving circuit. In such circuits, any blame affecting just a single coherent flag is discernible at the principle yields. Another 5 × 5 equality safeguarding reversible piece called RRH is proposed which would work as a half snake/subtractor and a full viper/subtractor. The result of examinations demonstrates this proposed piece beats its partners as for the number of consistent sources of info and trash yields, quantum cost and circuit measurements.
Tools:
Modelsim 6.4b
Xilinx ISE 10.1
Languages:
VHDL/Verilog HDL
CONTENTS
INDEX PG.NO
CHAPTER 1. INTRODUCTION11
1.1 Evolution Towards Project Idea11
CHAPTER 2. LITERATURE REVIEW13
2.1 Fault Analysis in AES-CBC Algorithm Using Hamming
Code for Space Applications13
2.2 A Secure Implementation of Nonlinear AES S-Box and
Fault Analysis in AESCM Algorithm Using Hamming Code
for Space Applications15
CHAPTER 3. EXISTING SYSTEM17
3.1 Adder
3.1.1 Half Adder17
3.1.2 Full Adder17
3.2Subtractors
3.2.1Half subtractor18
3.2.2Full subtractor19
3.3Adder-subtractor20
CHAPTER 4. PROPOSED SYSTEM21
CHAPTER 5. PROJECT DESCRIPTION23
5.1 Design Constraints and Definitions
5.1.1 Minimizing the quantity of Ancillary (consistent) Inputs23
5.1.2 Minimizing the quantity of Garbage Outputs23
5.1.3 Minimizing the Gate Count23
5.1.4 Fault Tolerance23
5.1.5 Parity Preservation23
5.2 Reversible logic gates24
5.2.1 Fredkin gate25
5.2.2 Peres gate26
5.2.3 Toffoli Gate27
5.2.4 Feynman Gate28
5.2.5 Parity Preserving Half Adder/Subtractors 29
5.3 Parity Preserving Full Adder/Subtractors30
5.4 Parity preserving 8-bit Parallel Adder/Subtractor31
CHAPTER 6. TOOLS34
6.1 XILINX ISE 13.1
6.1.1 Simulation34
6.1.2 Synthesis34
6.1.3 Procedure34
6.2 XILINX Snapshots35
CHAPTER 7. LANGUAGES45
7.1 MODELING TECHNIQUES
7.1.1 Data Flow45
7.1.2 Behavioral46
7.1.3 Structural Modeling46
7.2 MODULES47
7.3 STRUCTURAL DESIGN WITH GATE AND DELAY OPERATOR48
7.4 STRUCTURAL DESIGN WITH ASSIGNMENT STATEMENTS50
7.5 STRUCTURAL DESIGN52
7.6 BEHAVIORAL DESIGN WITH INITIAL AND ALWAYS BLOCKS52
7.7 STRUCTURAL DATA TYPES: WIRE AND REG55
7.8 BEHAVIORAL DATA TYPES: INTEGER, REAL, AND TIME55
7.9 NUMBER SYNTAX56
7.10 BEHAVIORAL DESIGN WITH BLOCKING AND
NON-BLOCKING STATEMENTS57
7.11 ARRAYS, VECTORS, AND MEMORIES58
7.12 OPERATORS60
CHAPTER 8. SIMULATION RESULTS62
CHAPTER 9 ADVANTAGES63
CHAPTER 10. APPLICATIONS64
CHAPTER 11. FUTURE SCOPE65
CHAPTER 12. CONCLUSION66
CHAPTER 13. REFERENCES67
LIST OF FIGURES
Fig NoNAMEPG.NO
3.1Half Adder17
3.2Full Adder18
3.3Half Subtractor19
3.4Full Subtractor19
3.5Adder – Subtractor20
4.1Parity preserving reversible logic gates22
5.1 Fredkin Gate25
5.2Fredkin Used as D Latch26
5.3Peres Gate27
5.4Toffoli Gate27
5.5Feynman gate28
5.6 Parity Preserving Half Adder/Subtractors30
5.7Parity Preserving Full Adder/Subtractors31
5.8 Parity preserving 8-bit Parallel Adder/Subtractor31
LIST OF TABLES
TBL NoNAMEPG.NO
3.1 Truth Table of Half Adder17
3.2 Truth Table of Full Adder18
3.3 Truth Table of Half Subtractor19
3.4 Truth Table of Full Subtractor19
5.1 Truth table of Fredkin gate26
5.2 Truth table of Peres gate27
5.3 Truth table of Toffoli gate28
5.4Truth table of Feynman gate29
CHAPTER 1
INTRODUCTION
1.1 EVOLUTION TOWARDS PROJECT IDEA
In the present specialized world, warm contemplations, unwavering quality issues and productivity have turned out to be real concerns. These days, inquire about is being done to outline a framework with elite, speed and low power dispersal or in a perfect world no warmth age. As power utilization is a noteworthy requirement in outlining of VLSI circuits so we have to change to that processing world where no data misfortune exists in light of the fact that as indicated by Landauer’s standard, on all of calculation, regular advanced frameworks scatter KTln2 measure of vitality, where K is Boltzmann’s consistent and T is the temperature at which the calculation is performed. Bennett demonstrated that this vitality scattering would not happen if a similar number of data bits are produced, i.e. no data misfortune exists. Display irreversible advancements scatter a ton of warmth as far as bit misfortune which lessens life of the circuit. Every single consistent activity in the present traditional PCs are irreversible. It implies extraction of contribution from the individual yield isn’t conceivable. Then again, reversible calculation has a striking component of exceptional coordinated mapping amongst sources of info and yields which decreases the significant issue of energy scattering with no data misfortune. A Reversible rationale is portrayed by: Equal number of inputs and outputs.
There exists one to one mapping between the respective inputs and outputs.
Loops and fan out are not allowed. In classical computers, only NOT gate performs reversible operation since it has an equal number of inputs and outputs with their unique one to one mapping.
Some reversible gates have already been proposed in literature like the controlled-not (CNOT) (proposed by Feynman), Toffoli and Fredkin gates, IG Gate and MIG gate. Reversible gates have various applications in the designing of adders, subtractions, multipliers etc, same like classical computers. The main focus of this paper is to design a circuit that can work as adder as well as subtractors simultaneously with minimum numbers of garbage outputs, constant inputs and area.
The reversible logic design algorithms will be considered in the Literature Traditional design methods use, among other criteria, the number of gates as a complexity measure (sometimes taken with some specific weights reflecting the area of the gate). From the point
of view of reversible logic we have one more factor which is more important than the number of gates used, namely the number of garbage outputs. Since reversible design methods use reversible gates, where the number of inputs is equal to the number of outputs, the total number of outputs of such a network will be equal to the number of inputs. The existing methods use the analogy of copying information from the input of the network, therefore introducing garbage outputs information that we do not need for the computation. In some cases, garbage is unavoidable. For example, a single output function of n variables will require at least n-1 garbage outputs, since reversibility necessitates an equal number of outputs and inputs.
CHAPTER 2
LITERATURE REVIEW
The writing overview concentrates towards AES, especially to use under low power utilization, high security, better execution and enhanced effectiveness. The usage practicality in VLSI condition is likewise examined and broke down top to bottom.
2.1 Fault Analysis in AES-CBC Algorithm Using Hamming Code for Space Applications
National institute of standard and technology (2001) presented computer security. Two FIPS publications already prove the modes of operation for two particular block cipher algorithms. Four of these modes are equivalent to the ECB, CBC, CFB, and OFB modes with the Triple DES algorithm (TDEA) as the underlying block cipher. For any given key, the block cipher algorithm of the mode consists of two function that are inverses of each other. Francois-Xavier Standaert, Gael Rouvroy, Jean-Jacques Quisquater, and JeanDidier Legat presented (2004) discussed about the Efficient Implementation of Rijndael Encryption in Reconfigurable Equipment. It tended to different methodologies for effective FPGA usage of the Advanced Encryption Standard calculation.
In execution of square figures, a few systems can create compelling outlines. Inalienable limitations of FPGAs were considered keeping in mind the end goal to characterize a productive system. Inside these structures, the creators proposed algorithmic enhancements for the substitution box, and furthermore productive blends between the dissemination layer and the key expansion. 25 Farhadian.A and Aref.M.R (2009) displayed proficient strategy for streamlining and approximating the s-boxes in view of energy capacities. In this paper figure calculations, control works over limited fields and extraordinary reversal capacities have an essential part in the S-box configuration structure. Another orderly proficient technique is acquainted with tomb dissect such S-boxes. This strategy is extremely basic and does not require any heuristic endeavor and can be considered as a brisk paradigm to locate some straightforward approximations. Utilizing this new strategy, approximations can be acquired for cutting edge encryption standard (AES) like S-boxes, for example, AES, Camellia, and Shark et cetera. At last as an utilization of this strategy, a straightforward direct estimation for AES S-box is introduced. Akashi Satoh, Sumio Morioka, Kohji Takano, and Seiji Munetoh (2011) exhibited a Compact Rijndael Hardware Architecture with S-Box Optimization. Encryption and decoding information ways are consolidated and every single math segment are reused. A to a great degree little size of 5.4 K doors is acquired for a 128-piece key Rijndael circuit utilizing a 0.11-µm CMOS standard. Keeping in mind the end goal to limit the hard-product estimate, the request of the number-crunching capacities were changed, and the encryption-unscrambling information ways are proficiently joined regarding cell library.
Rationale improvement procedures, for example, figuring were connected to the math segments, and entryway tallies were diminished. Ashkan Masoomi and Roozbeh Hamzehiyan (2012) introduced another approach for identifying and rectifying blunders in satellite correspondences in light of Hamming Error Correcting Code 6. A novel model to identify and amend Single Event Upsets in on-board executions of the AES calculation depended on hamming mistake revising code. Single Even Upset (SEU) shortcomings happen in the on-board amid encryption because of radiation. A portion of the AES modes like ECB, CBC, OFB, CFB and CTR exhibitions have been broke down. From that, CTR mode has been suggested as the ideal decision for satellite applications. 26 Ramesh Babu, George Abraham and Kiransinh Borasia (2012) presented a Review on Securing Distributed Systems Using Symmetric Key Cryptography 66. It was used to evaluate the importance of Symmetric Key Cryptography for Security in Distributed Systems. Two symmetric key cryptographic algorithms DES and AES were commonly used.
These two algorithms were evaluated on the parameters such as key size, block size, number of iterations. From the literatures reviewed of various implementations and analysis of both the algorithms, it can be concluded that AES algorithm has over-shadowed the DES algorithm in many areas. Karri, R., Wu, K., Mishra, P., and Kim, Y. (2002) Concurrent Error Detection Schemes for Fault-Based Side-Channel Cryptanalysis of Symmetric Block Ciphers. They presented algorithm level, round level, and operation level CED (Concurrent Error Detection) architectures for symmetric block ciphers. The algorithm was independent and can be applied to almost any symmetric block cipher. The proposed scheme introduced moderate area overhead and interconnects complexity to achieve permanent as well as transient fault tolerance. This approach assumes that the key RAM, comparator, or both encryption and decryption modules simultaneously are not under attack or faulty.
2.2 A Secure Implementation of Nonlinear AES S-Box and Fault Analysis in AESCM Algorithm Using Hamming Code for Space Applications.
Ross Anderson, Eli Biham, Lars Knudsen (1999) presented a Proposal for the Advanced Encryption Standard. Its design is highly conservative, yet still allows a very efficient implementation. With a 128-bit block size and a 256-bit key, it is as fast as DES on the market leading Intel Pentium/MMX platforms yet we believe it to be more secure than three-key triple-DES. The linear transformations were just bit 27 permutations, which were applied as rotations of the 32-bitwords in the bit slice implementation. The authors also considered replacing the XOR operations by seemingly more complex operations, such as additions. Finally cognate algorithms with the same structure as Serpent but with block sizes of 64, 256 and 512 bits. A.J.Elbirt, W.Yip, B.Chetwynd, C.Paar (2000) presented an FPGA implementation and performance evaluation of the AES block cipher candidate algorithm finalists.
Reprogrammable gadgets, for example, Field Programmable Gate Arrays (FPGAs) are exceptionally alluring choices for equipment usage of encryption calculations as they give cryptographic calculation spryness, physical security, and conceivably considerably higher execution than programming arrangements. The usage of every calculation will be contrasted in an exertion with decide the most appropriate contender for equipment execution inside financially accessible FPGAs. An outline technique was set up which thusly prompted the structural prerequisites for an objective FPGA. The best speed-enhanced usage were distinguished for each AES finalist in both non-criticism and input modes. Pawel Chodowiec, Kris Gaj, Peter Bellows and Brian Schott (2001) exhibited Experimental Testing of the Gigabit IPSec-Compliant Implementations of Rijndael and Triple DES Using SLAAC-1V FPGA Accelerator Board. Full usage of the new Advanced Encryption Standard, Rijndael, and the more established American government standard, Triple DES, were produced and tentatively tried utilizing the SLAAC-1V FPGA quickening agent board, in view of Xilinx Virtex 1000 gadgets. Demonstration of a capability to enhance our circuit to handle the encryption and decryption throughputs of over 1 Gbit/s regardless of the chosen algorithm. For Rijndael in the basic iterative architecture, the results for encryption and decryption are different, with decryption slower than encryption by about 13% in experimental testing. The IPSec-compliant encryption/decryption units of the new Advanced Encryption Standard – Rijndael and 28 the older encryption standard Triple DES have been developed and tested experimentally. Khoa Vu, David Zier (2003) presented FPGA Implementation AES for CCM Mode encryption using Xilinx Spartan-II. In this paper discusses a possible FPGA implementation of the AES algorithm specifically for the use in CCM Mode Encryption. It investigates the possibility of creating an off-chip AES system for CCM so that the process can be speed up. The AES implementation on the FPGA is a viable solution for improving the speed and processing power of CCM Mode Encryption. A much larger FPGA or ASIC would be preferred, for both encryption and decryption could be implemented as well as some pipelining of processes.
In spite of the fact that the outline was executed, it was proposed to be interfaced with a microcontroller/microchip running the CCM Mode Encryption. Xinmiao Zhang and Keshab K. Parhi (2004) exhibited rapid VLSI designs for the AES calculation. A novel rapid design for the equipment usage of the Advanced Encryption Standard (AES) calculation. Composite field math is utilized to diminish the region necessities, and diverse usage for the reversal in subfield GF (2^4) are thought about. Keeping in mind the end goal to investigate the upside of sub-pipelining further, the SubBytes/InvSubBytes is executed by combinational rationale to stay away from the unbreakable deferral of LUTs in the customary plans. Completely Sub-pipelined encryptor/decryptors utilizing other key lengths can be executed by including more duplicates of round units and changing the key extension unit marginally. Expected throughput is somewhat lower than the encryptor-just usage.
CHAPTER 3
EXISTING SYSTEM
Adders
Half adder
A half adder adds two one-bit binary numbers A and B. It has two yields, S and C (the esteem hypothetically carried on to the following expansion); the last entirety is 2C + S. The most straightforward half viper configuration, imagined on the right, consolidates a XOR entryway for S and an AND door for C. Half adders can’t be utilized compositely, given their inadequacy for a carry-in bit.
Table 3.1 Truth Table of Half Adder
Fig 3.1 Half Adder
Full Adder
A full snake includes double numbers and records for values conveyed in and out. A one-piece full snake includes three one-piece numbers, regularly composed as A, B, and Cin; An and B are the operands, and Cin is a bit conveyed (in principle from a past expansion)
Table 3.2 Truth Table of Full Adder
Fig 3.2 Full Adder
Subtractors
Half subtractor
The half-subtractor is a combinational circuit which is used to perform subtraction of two bits. It has two inputs, X (minuend) and Y (subtrahend) and two outputs D (difference) and B (borrow).
Table and Fig 3.3 Half Subtractor
Full subtractor
The full-subtractor is a combinational circuit which is utilized to perform subtraction of three bits. It has three sources of info, X (minuend) and Y (subtrahend) and Z (subtrahend) and two yields D (distinction) and B (get).
Table 3.4 Full Subtractor
Fig 3.4 Full Subtractor
Adder-subtractor
In advanced circuits, an adder– subtractor is a circuit that is equipped for including or subtracting numbers (specifically, twofold). The following is a circuit that does including or subtracting depending a control flag. It is likewise conceivable to build a circuit that performs both expansion and subtraction in the meantime.
Fig 3.5 Adder-subtractor
M: controller, including when M=0 and Subtracting when M=1. Including: A+B. Sub: A-B. V: flood signal, indicate that a flood happened when V=1.
CHAPTER 4
PROPOSED SYSTEM
Current VLSI circuit configuration is represented by low power utilization prerequisites of ICs. Reversible rationale has gotten incredible significance in light of no data bit misfortune amid calculation which brings about low influence dissemination. In addition, there is a need to change over the reversible circuits into blame tolerant reversible circuits to identify the event of mistakes. Equality protecting property can be utilized for this. Another 5*5 equality saving reversible entryway is proposed in this paper, named as P2RG. The most huge part of this work is that it can work both as a full viper and a full subtractor by utilizing one P2RG and Fredkin entryway as it were. Proposed configuration is better as far as door check, waste yields, consistent sources of info and zone than the current comparability. Along these lines, this paper gives the underlying limit to outline more mind boggling frameworks which will have the capacity to execute more confounded tasks utilizing equality saving reversible rationale.
Another 5*5 equality protecting reversible entryway, P2RG is presented.
?This entryway is one through which implies one of its sources of info is additionally a yield.
?That Proposed door is all inclusive since it can perform NOR task. At the point when input B= 1 and D= 0 at that point yield Q performs NOR activity i.e. (A+C) . As it is realized that NAND and NOR entryways are widespread doors so it can be reasoned that it can be misused to understand any discretionary Boolean capacity. Truth table of this door is appeared in Table 1, where A, B, C, D and E are the data sources and P, Q, R, S and T are the yields. It can be seen from the table that all the info and yield vectors are extraordinarily related. The equality saving property is speedily confirmed from the table by contrasting the equality of the contribution with the equality of the yield that is (A ? B ? C ? D ? E) and (P ? Q ? R ? S ? T). Case: from reality table of P2RG i.e Table 1, for the sources of info 00010 particular yields are 01011. As per the condition 1: 0 ? 0 ? 0 ? 1 ? 0 = 1 = 0 ? 1 ? 0 ? 1 ? 1 Like the above case, equality safeguarding property can be effortlessly checked for the rest of the contributions with their yields moreover.
Fig 4.1 Parity preserving reversible logic gates
It is a n-input n-yield rationale work in which there is a balanced correspondence between the sources of info and the yields. In light of this bijective mapping the information vector can be exceptionally decided from the yield vector. This keeps the loss of data which is the underlying driver of energy scattering in irreversible rationale circuits.
CHAPTER 5
PROJECT DESCRIPTION
5.1 Design Constraints and Definitions
5.1.1 Minimizing the quantity of Ancillary (consistent) Inputs
An additional, helper bit or settled quit express that is added to the essential contributions to request to accomplish the particular usefulness however they should be limited for limiting assistant stockpiling.
5.1.2 Minimizing the quantity of Garbage Outputs
Yields that are not utilized further, required just to make the capacity reversible (which results to limit territory and power).
5.1.3 Minimizing the Gate Count
Number of gates that are used to realize the system is gate count.
5.1.4 Fault Tolerance
Any physical gadget while performing the traditional or quantum calculation is subjected to mistake either because of commotion in the earth or blame in the gadget. It can be recognized by blame tolerant figuring. Despite the fact that reversibility can recuperate bit misfortune, however, it can’t identify bit blunders in the circuit. Late computerized circuit planning is currently concentrating on the blame tolerant reversible circuits.
5.1.5 Parity Preservation
It can be utilized for the adaptation to non-critical failure calculation. Blames in the circuit can be identified by contrasting the equality of sources of info and yields. The possibility of the equality protecting property in the outline of reversible rationale circuits was given by Parhami. It is realized that reversible entryways have an equivalent number of information sources and yields. Subsequently, for equality safeguarding, this is adequate to demonstrate that equality of information sources and yields ought to be equivalent. For instance, inequality safeguarding, 4*4 reversible entryway must fulfil the condition which is given underneath:
A ? B ? C ? D = P ? Q ? R ? S
Where A, B, C and D are gate inputs and P, Q, R and S are gate outputs.
5.2 Reversible logic gates
Reversible circuit/door can produce exceptional yield vector from each information vector, and the other way around, i.e., there is a balanced correspondence between the info and yield vectors. In this way, the quantity of yields in a reversible door or circuit has the same as the number of information sources, and normally utilized conventional NOT entryway is the main reversible entryway. All the more formally, a reversible rationale entryway is a k-input, k-yield (indicated k*k) gadget that maps every conceivable info design into an extraordinary yield design. While building reversible circuits with the assistance of reversible doors, a few limitations ought to be entirely kept up
Fan-out isn’t allowed.
Loops are not allowed. In reversible rationale, we have one more factor, which is more critical than the number of doors utilized, in particular, the number of trash yields.
The unutilized yields from a reversible entryway/circuit are called “trash”. In spite of the fact that each amalgamation strategy connects with them delivering less number of waste yields, yet now and again junk yields are unavoidable. For instance, a solitary yield capacity of n factors will require in any event n-1 rubbish yields, since the reversibility requires an equivalent number of yields and sources of info. Reversible rationale forces numerous plan imperatives that should be either guaranteed or improved for executing a specific Boolean capacity.
Firstly, in reversible rationale circuit, the number of information sources must be equivalent to the number of yields.
Secondly, for each information design, there must be a one of a kind yield design.
Thirdly, each yield will be utilized just once, that is, no fan out is permitted.
Finally, the subsequent circuit must be non-cyclic.
A Parity Preserving Reversible Logic Gates BehroozParhami recommended that reversible equipment calculation, that is, performing rationale flag changes in a way that permits the first info signs to be recouped from the created yields, is useful in differing territories, for example, quantum figuring, low power plan, nanotechnology, optical data handling, and bioinformatics. In an equality safeguarding reversible rationale entryways, the yield equality will coordinate with the info equality (i.e. ex-or’s of yields is equivalent to the ex-or’s of information). There exist a few equality safeguarding reversible rationale entryways in writing Fredkin door, Feynman twofold doors are few among them. In this paper Fredkin entryway, Feynman twofold door and Modified Islam doors are utilized. By utilizing these equalities saving reversible rationale entryways it is anything but difficult to configuration blame tolerant circuits. Fredkin Gate (FRG): Fredkin Gate (FRG) is a 3*3 entryway appeared in Figure. It has A, B and C input vector and yield vector as P=A, Q=A’B AC and R=A’C AB.
5.2.1 Fredkin gate
Fredkin door is a moderate entryway (Figure). Hamming weight of the info vector is same as the hamming weight of the yield vector. It has 3 entryway information sources and 3 door outputs (3*3). It has a quantum cost* five. Fredkin door is utilized as the defer component in the channel outline.
Fig 5.1 Fredkin gate
Table 5.1: Truth table of Fredkin gate
Fig 5.2: Fredkin used as D latch
5.2.2 Peres gate
Fig demonstrates a 3*3 Peres door. The information vector is I (A, B, C) and the yield vector is O (P, Q, R). The yield is characterized by P = A, Q = A? B and R=AB? C. Quantum cost of a Peres door is 4. In the proposed plan Peres door is utilized as a result of its least quantum cost. A full-snake utilizing two Peres entryways is as appeared in fig. The quantum acknowledgment of this demonstrates its quantum cost is 8two Peres entryways are utilized.
Fig 5.3: Peres gate
Table 5.2: Truth table of Peres gate
5.2.3 Toffoli Gate
Fig demonstrates a 3*3 Toffoli entryway. The info vector is I (A, B, C) and the yield vector is O (P,Q,R). The yields are characterized by P=A, Q=B, R=AB?C. Quantum cost of a Toffoli entryway is 5.
Fig 5.4: Toffoli gate
Table 5.3: Truth table of Toffoli gate
5.2.4 Feynman Gate
Feynman door is a 2*2 one through the reversible entryway as appeared in fig.2. The information vector is I(A, B) and the yield vector is O(P, Q). The yields are characterized by P=A, Q=A?B. Quantum cost of a Feynman door is 1. Feynman Gate (FG)can be utilized as a replicating entryway. Since a fan-out isn’t permitted in reversible rationale, this entryway is helpful for duplication of the required yields.
Fig 5.5: Feynman gate
Table 5.4: Truth table of Feynman gate
In this machine subordinate time, we anticipate that PCs will do some sort of number juggling activity like expansion, subtraction. In this area, the primary commitment of the paper is exhibited. It demonstrates how the thought functions. The thought behind the outlining of P2RG entryway is to develop a combinational circuit that can function as a full viper and additionally full subtractor on a solitary unit. We require just a control door to control the method of task for the expansion/subtraction.
5.2.5 Parity Preserving Half Adder/Subtractors
The equality protecting half viper/subtractor is acknowledged utilizing one P2RG door and one Fredkin entryway as appeared in Fig. Half snake and subtractor are the fundamental building piece to configuration full viper and subtractor. We require two sources of info i.e. An and B to plan a half viper/subtractor. No past convey or get is required in this. Along these lines, this outline has two data sources An and B and a control line Ctrl which will control method of activity, i.e. at the point when Ctrl is at rationale 0, the circuit will go about as a half viper and when ctrl is at rationale 1, the circuit will go about as a half subtractor. It will give three steady data sources and four junk bits g1 to g4. Boolean articulations to understand the usefulness of half snake and half subtractor are given underneath.
Sum/Difference = A ? B
Carry = A&B
Borrow = (~A) & B
Fig 5.6: Parity Preserving Half Adder/Subtractors
5.3 Parity Preserving Full Adder/Subtractors
Numerous snake plans utilizing reversible doors by a few creators have been examined. The proposed configuration will function as snake and also subtractor on a solitary unit. The equality safeguarding full snake/subtractor is acknowledged utilizing one P2RG door and one Fredkin entryway. In Fig.4, the circuit has three information sources A, B, Cin and a control line Ctrl which will control method of task. On the off chance that Ctrl= 0, it will fill in as a full viper else it would work as a full subtractor. It has 2 steady sources of info, C is set to 0 and E can be set to either 0 or 1. The fundamental Boolean articulations for total/contrast, convey and acquire are given beneath for full viper and subtractor:
(Sum/Difference = (A ? B ? Cin))
(Carry = ((A ? B).Cin) ? AB))
(Borrow = ((A) .B) ? (((A ? B) ).Cin))
Proposed circuit is streamlined as far as number of consistent data sources and refuse yields. Fig.4 demonstrates the usage of equality protecting full viper/subtractor in which g1, g2, g3 and g4 are rubbish yields.
Fig 5.7: Parity Preserving Full Adder/Subtractors
5.4 Parity preserving 8-bit Parallel Adder/Subtractor
A n-bit parallel snake/subtractor will require a chain of (n-1) full adders/subtractor and one half viper/subtractor. In this way 8-bit equality safeguarding parallel viper/subtractor is composed by utilizing one equality protecting half snake/subtractor (P2RG HAS) and seven equality saving full snake/subtractor (P2RG FAS). It has two 8-bit numbers which are A0 to A7 and B0 to B7 as sources of info and a control line ctrl which will control the method of activity. At the point when ctrl line is set at rationale 0, the circuit will perform 8-bit expansion activity and when ctrl line is set at rationale 1, the circuit will perform 8-bit subtraction. The Carry/Borrow got after expansion/subtraction is spoken to by C1/B1 to C7/B7.Output convey/obtain of each square, i.e. C1/B1 to C7/B7 will be the third contribution for the following piece. The yields, Sum/Difference and Carry/Borrow are appeared in the Fig.5 as S0/D0 to S7/D7 and C8/B8 separately. Fig.5 demonstrates the equality protecting 8-bit parallel viper/subtractor.
Fig 5.8: Parity preserving 8-bit Parallel Adder/Subtractor
Feynman door works in duplicate mode and supplement mode. In above circuit the Feynman door is inferred in duplicate mode. The two sources of info have been encouraged to isolate Feynman door and convey in contribution to a different Feynman entryway FG3 .the yield of all over three Feynman entryways is being nourished to FG4 whose yield line is SUM or contrast line. For the do MUX doors have been utilized by giving total of An and B as one contribution to MUX entryway.
The proposed equality safeguarding reversible half-subtractor circuit is appeared in Fig11.this circuit is made out of F2G and MUX doors .the quantum cost of F2G is 2 and MUX is 4. along these lines, the quantum cost of this circuit is 6. The proposed circuit requires two consistent sources of info and produces two rubbish yields. Proposed equality safeguarding reversible half-subtractor circuit can be utilized as a part of developing deficiency tolerant reversible circuits in which there would be no need of equality bit for mistake recognition.
The proposed equality protecting reversible full-subtractor circuit is appeared in fig. this circuit is made out of 3 F2G door and 1 MUX entryway. It produces 4 junk yields and requires just a single steady information. The quantum cost of F2G is 2 AND MUX is 4. Thus, the Quantum cost of this circuit is 10. Proposed equality safeguarding reversible full-subtractor circuit can be utilized for planning deficiency tolerant reversible frameworks which is the important prerequisite of nanotechnology based frameworks
The proposed equality safeguarding reversible full-subtractor circuit has appeared in fig. this circuit is made out of 3 F2G entryway and 1 MUX door. It produces 4 refuse yields and requires just a single steady info. The quantum cost of F2G is 2 AND MUX is 4. In this way, the Quantum cost of this circuit is 10. Proposed equality protecting reversible full-subtractor circuit can be utilized for planning flaw tolerant reversible frameworks which are the important prerequisite of nanotechnology-based frameworks.
The proposed configuration work independently as a unit which comprises both snake and subtractor, as indicated by the control rationale input it can act viper or subtractor. The underneath area covers Full viper/subtractor and Parallel snake/subtractor configuration required for the development of Carrying skip snake/subtractor. B. Blame Tolerant Full Adder/Subtractor with engendering (FT_FAS_P) Figure 4 demonstrates the blame tolerant full viper/subtractor (with proliferate). It can be planned utilizing Two Modified Islam Gate (MIG), One Fredkin Gate (FRG) and One Feynman Double Gate (F2G). C.
Blame Tolerant 4-bit Parallel Adder/Subtractor The essential building square of Parallel viper/subtractor is full snake/subtractor. Figure 5 demonstrates the 4-bit blame tolerant Parallel viper/subtractor. It can be composed utilizing four blame tolerant full snake/subtractor. D. Blame Tolerant 4-bit Carry Skip Adder/Subtractor In the convey skip snake, the delay is lessened because of the convey calculation. In the full snake/subtractor activity, if either Input is a legitimate one, the cell will spread the convey/acquire contribution to its convey/get yield. Subsequently, the nth full viper/subtractor convey/get input (C/B)n, will engender to its convey/acquire yield, (C/B)n+1 when Pn= A B.
Furthermore, the numerous full adders/subtractors, influencing a square to can produce a block engenders flag P to bypass the approaching convey/get around to the piece’s convey/acquire yield flag. The figure demonstrates the proposed four piece blame tolerant convey skip snake/subtractor square. It is immediately dictated by each square, that whether the pieces convey/get input is spread to its convey yield. On the off chance that the piece proliferate P is one, the square convey/acquire input Cin is engendered as the piece convey/get yield Cout.
CHAPTER 6
TOOLS
6.1 XILINX ISE 13.1:
Xilinx is the most critical apparatus and in this device, we can perform both reenactment and combination.
6.1.1 Simulation:
In this procedure we will check our expected yield to get the recreation procedure initially we need to actualize the best module (mix of all modules) and after that, in the reproduction conduct we can reenact the outcomes.
6.1.2 Synthesis:
Blend process characterizes changing over Verilog code into entryway level which makes a net rundown
6.1.3 Procedure:
Click project navigator
Create new project
Selection of FPGA
Create new source
Select source type (Verilog module)
Coding
Declaration of inputs and output
Sources for implementation
Synthesize – XST
Check syntax
View design summary
View RTL schematic
View technology schematic
Sources for behavioral simulation
Create new source
Select source type (Verilog text fixture)
Write test bench code
Xilinx ISE simulator
Behavioral check syntax
Simulate behavioral model
6.2 Xilinx snapshots:
1.To create new project in xilinx we should open the filemenu,click on new project then it will open the dialogbox as below in that typethe filename click on next
2.Then it isplays one more dialogbox which will give us the specifications of the project,click on next
3.Then it again displays a dialogue box as shown below with the created project description and click finish to compelte the process of creating new project
4.Now project with specifyed name is created then create the verilog files in the project. To create filesr, right click on the project that will show options like as shown below
5.From the given options select new source then it diaplays dialogbox which is containing of list of fileformat now we want to create verlogfile so select veilog module,and give the name to the file. Then click on next
6.Then it will ask us to select inputs,outputs and inouts. We can specify our inputs and outputs here else we may also specify as part of programme depend upon the user requirement, click on next
7.It will again displays a dilagbox by fiving details of filename etc, click on next
8.It will open a white space in the project window containing filename the double click on the file name so that it will displays respective file window, where we should write the code
9.After completion writing code select the file name and click on synthesis which will check for errors, if there are any errors in syntax or design errors are checked and shown in the below of file window
10.After sucessful synthesis we should have to create tesh bench file with extension as test,for that again riht click on the file name as shown below,give filename
11.If there are list files then select file for which we are creating the test bench. Click on next
12.It again gives a testbench file in the project window, then give reqired inputs
13.select simulation from the view bar in the project window above the hiearchy window as follows.
4762572707514. Double click on Isim Simulator it will expand as follows click on behavioral check syntax and it will check for syntax errors in test bench file
15.click on simulate behavioral model, it will displays wave form for in response to the inputs given in the test bench file
16.That wave form window having option to zoom out, zoom in to analyze the wave form clearly in order to understand behavior of design
CHAPTER 7
LANGUAGES
Verilog HDL is one of the two most normal Hardware Description Languages (HDL) utilized by a coordinated circuit (IC) planners.. HDL’s enables the plan to be reenacted before in the outline cycle so as to redress mistakes or explore different avenues regarding diverse designs. Plans portrayed in HDL are innovation autonomous, simple to outline and investigate, and are generally more discernable than schematics, especially for substantial circuits.
Verilog is utilized to portray any advanced rationale circuit is an interconnection of ports. The displaying methods are
Structural
Behavioral
Dataflow.
7.1 MODELING TECHNIQUES
7.1.1 DATA FLOW:
In this model, we will portray the parts straightforwardly by the connection between them.
module and1_gate (input a, b, output c);
assign c=a & b;
endmoduleThe module which indicates the association between various components within it. The module name is an entryway which is having information sources and yields are proclaimed as in the bracket.
The dole out proclamation is a watchword which signifies plays out the activity indicated. At that point, it will store the incentive in the left-hand side operand. end module articulation indicates that finish of the module
7.1.2 BEHAVIORAL MODELING
Th This is the demonstrating procedure which is utilized to characterize the segment without knowing it. We can demonstrate the conduct. We will plan the segment by its conduct as it were. The underneath program models a circuit which is having the conduct as demonstrated as follows.
Module ha( input a,b, output c,d);
[email protected](a,b)
begin
if(a==0 &&b==0)
c=1;d=0
elseif(a==0 && b==1)
c=1;d=0;
elseif(a==1&&b==0)
c=0; d=1;
end
endmodule he dependably watchword demonstrates a free-running procedure. This demonstrates zero running test system. Once a dependable square has achieved its end, it is rescheduled (once more).
Parameters in the Parenthesis is called affectability list. The affectability list which shows when inputs are assessed then dependably piece will be executed.
The if-else articulation is comparative like as in C. At the point when the separate articulation is right comparing outcomes will be executed.
7.1.3 STRUCTURAL MODELING
This is utilized to outline complex modules utilizing straightforward submodule of it. The sub-modules or the parts which can be utilized as often as possible in the bigger projects. These methods will influence complex projects yet easy to outline.
Module ha(input a,b, output s,c);
Assign c=a&b;
Assign s=a^b;
End module
Module fa(input u,v,w, output x,y);
Wire s1,c1;
Ha n1(a,b,s1,c1);
Ha n2( s1,w,x,c2);
or(y,c1,c2);
endmoduleThe above module appears here is with the name half viper. The module can be called into another program module “fa”. To encourage this alternative we ought to compose both the projects in a solitary venture. At that point just we will compose the program in the basic model
7.2 MODULES
In Verilog, circuit parts are planned inside a module. Modules can contain both basic and behavioral explanations. Basic explanations speak to circuit parts like rationale doors, counters, and microchips. Behavioral level articulations are modifying proclamations that have no immediate mapping to circuit segments like circles, if-then explanations, and boost vectors which are utilized to practice a circuit. Beneath code demonstrates a case of a circuit and a test seat module. A module begins with the watchword module took after by a discretionary module name and a discretionary port rundown. The catchphrase end module closes a module.
`timescale 1ns / 1ps
//create a NAND gate out of an AND and an Invertor
module some_logic_component (c, a, b);
// declare port signals
output c;
input a, b;
// declare internal wire
wire d;
//instantiate structural logic gates
and a1(d, a, b); //d is output, a and b are inputs
not n1(c, d); //c is output, d is input
endmodule//test the NAND gate
moduletest_bench; //module with no ports
reg A, B;
wire C;
//instantiate your circuit
some_logic_component S1(C, A, B);
//Behavioral code block generates stimulus to test circuit
initial
begin
A = 1’b0; B = 1’b0;
#50 $display(“A = %b, B = %b, Nand output C = %b
“, A, B, C);
A = 1’b0; B = 1’b1;
#50 $display(“A = %b, B = %b, Nand output C = %b
“, A, B, C);
A = 1’b1; B = 1’b0;
#50 $display(“A = %b, B = %b, Nand output C = %b
“, A, B, C);
A = 1’b1; B = 1’b1;
#50 $display(“A = %b, B = %b, Nand output C = %b
“, A, B, C);
end
endmodule7.3 STRUCTURAL DESIGN WITH GATE AND DELAY OPERATOR
Verilog characterizes some essential rationale entryways as a component of the dialect. In Figure 1, module some_logic_component instantiates two entryway natives: the not door and the and door. The yield of the door is the primary parameter, and the sources of info are whatever remains of the parameters. These natives are versatile so you can get various information doors just by including contributions to the parameter list. For instance:
nand a1(out1, in1, in2); //2-input NAND gate
nand a2(out1, in1, in2, in3, in4, in5); //5-input NAND gate
As a matter, of course, the planning delay for the entryway natives is zero time. You can characterize the rising postponement, falling defer utilizing the #(rise, fall) defer administrator. What’s more, for tri-state doors you can likewise characterize the kill delay (progress to high impedance state Z) by utilizing the #(rise, fall, off) defer administrator. For instance
notif0 #(10,11,27) inv2(c,d,control) //rise=10, fall=11, off=27(not if control=0)
nor #(10,11) nor1(c,a,b); //rise=10, fall=11 (nor gate)
xnor #(10) xnor1(i,g,h); //rise=10, fall=10 (xnor gate)
Additionally, every one of the 3 postponements can be characterized to have least, run of the mill, and the greatest esteem utilizing a colon to isolate the qualities like 8:10:12 rather than 10 in the above cases. At runtime, the Verilog test system searches for to check whether the + mindelay, + typdelay, or + maxdelay alternative has been characterized with the goal that it will know which of the 3 time esteems to utilize. In VeriLogger these choices are set utilizing the Project ; Project Preferences menu. In the event that none of the choices are indicated then the run of the mill esteem is utilized.
// min: typ: max values defined for the (rise, fall) delays
or #(8:10:12, 10:11:13) or1(c,a,b);
The postpone administrator has one unpretentious symptom: it swallows limit input beats. Typically, the postpone administrator causes the yield reaction of an entryway to be deferred a specific measure of time. In any case, if the info beat width is shorter then the general postponement of the door then the change won’t appear on the yield. Here is a rundown of rationale natives characterized for Verilog
Table 6.2.1 list of logic primitives
Gate Parameter List Examples
nand nor and or xorxnorscalable, requires at least 2 inputs(output, input1, input2, ? , inputx) and a1(C,A,B);nand na1(out1,in1,in2,in3,in4);nor #(5) n1(D,A,B);//delay = 5 time unitsxor #(3,4,5) x1(E,A,B);//rise,fall,offdelaysnor #(3:4:5) n2(F,A,B);//min:typ:max of delays
not buf(output, input) not inv1(c,a);
notif0bufif0 control signal active low(output, input, control) notif0 inv2(c,a, control);
notif1bufif1 control signal active high(output, input, control) not inv1(c,a, control);
7.4 STRUCTURAL DESIGN WITH ASSIGNMENT STATEMENTS
On the off chance that you have a great deal of irregular rationale, the entryway natives of the past area are repetitive to utilize in light of the fact that all the inner wires must be announced and snared accurately. At times it is less demanding to simply portray a circuit utilizing a solitary Boolean condition. In Verilog, Boolean conditions which have comparable planning properties as the entryway natives are characterized utilizing a nonstop task proclamation. For instance, the accompanying code extract from Figure 1:
wire d;
and a1(d, a, b);
not n1(c, d);
can be replaced with one statement:
assign c = !(a && b); //notice that wire d was not used here
Assignments can likewise be made amid the affirmation of a wire. For this situation the appoint catchphrase is certainly thought to be there for instance:
wire d;
assign d = a || b; //continuous assignment
wire d = a || b; //implicit continuous assignment
As a matter of course, the planning delay for task articulations is zero time. You can characterize a proliferation defer utilizing the #delay administrator simply as we improved the situation the entryway natives. The accompanying cases have precisely the same.
wire c;
assign #5 c = a && b; //delay in the continuous assignment
wire #5 c = a && b; //delay in the implicit assignment
wire #5 c; //delay in the wire declaration
assign c = a && b;
To exhibit the beat gulping impact of the defers administrator, think about the accompanying situation. In the above cases, if input a changed an incentive at time 10 (and held its incentive for no less than 5-time units), at that point the yield c would change esteems at time 15. In the event that information a had an esteem beat that was shorter then the proliferation deferral of the task then the incentive on a would not be passed to the yield. The defer administrator can likewise utilize the full ascent, fall, and off deferrals and each postponement can have a base: a run of the mill: greatest esteem. The accompanying is a substantial line of code,and #(8:10:12, 10:11:13, 26:27:29) a1(c,a,b);/min:typ:max of (rise,fall,off)
7.5 STRUCTURAL DESIGN
As a matter of course the planning inside a module is controlled by the module itself. In any case, modules can be characterized to have parameterized postpones like the #(4,5) defer administrator utilized with entryway natives. In the module definition, utilize the parameter catchphrase to make postpone factors. Parameters can likewise be utilized to change other scalar qualities in the module. At the point when the module is instantiated then you can abrogate the defer esteems utilizing the #(parameter) documentation. For instance:
module some_logic_component (c, a, b);
… //some code
parameter and Delay = 2; //default delays
parameterinv Delay = 2;
and #andDelay a1(d, a, b); //using parameter delays
not #invDelay n1(c, d);
endmodulemoduletest_bench; //module with no ports
…
some_logic_component #(5,4) S3(E, A, B); //override andDelay=5, invDelay=4
some_logic_component #(5) S2(D, A, B); //override andDelay=5, invDelay=2
some_logic_component S1(C, A, B); //uses default delays
….
endmodule Modules additionally bolster an extraordinary sort of timing called determine squares which can be utilized as a part of conjunction with SDF analyzers. Indicate pieces additionally bolster nonstop setup and hold checking.
7.6 BEHAVIORAL DESIGN WITH INITIAL AND ALWAYS BLOCKS
Behavioral code is utilized to depict circuits at a more dynamic level then the basic level articulations we have contemplated. All Behavioral code happens inside either an underlying square or in a dependably piece. A module can contain a few introductory and dependably squares. These behavioral pieces contain proclamations that control reenactment time, information stream explanations (like assuming at that point and case articulations), and blocking and non-blocking proclamations.
An introductory piece executes once amid a reproduction. Starting squares are typically used to instate factors and to depict jolt waveforms which practice which drives the recreation.
A dependable square persistently rehashes its execution amid a reenactment. Continuously pieces, for the most part, contain behavioral code that models the genuine circuit activity.
Amid a recreation, each dependably and each underlying piece start to execute at time zero. Each piece executes simultaneously with each basic proclamation and the various behavioral squares. The accompanying illustration demonstrates a behavioral SRAM display. The underlying square sets the memory cells to zero at startup. The dependable square executes each time there is a change on the compose control line, the chip select line, or the address transport. As an activity, reorder this code into a Verilog document and compose a test seat to practice the model. On the off chance that you are utilizing VeriLogger Pro then you can draw a test bench.
//SRAM Model
modulesram(CSB,WRB,ABUS,DATABUS);
input CSB; // active low chip select
input WRB; // active low write control
input 11:0 ABUS; // 12-bit address bus
inout 7:0 DATABUS; // 8-bit data bus
//** internal signals
reg 7:0 DATABUS_driver;
wire 7:0 DATABUS = DATABUS_driver;
reg 7:0 ram0:4095; // memory cells
integeri;
initial //initialize all RAM cells to 0 at startup
begin
DATABUS_driver = 8’bzzzzzzzz;
for (i=0; i; 4095; i = i + 1)
rami = 0;
end
always @(CSB or WRB or ABUS)
begin
if (CSB == 1’b0)
begin
if (WRB == 1’b0) //Start: latch Data on rising edge of CSB or WRB
begin
DATABUS_driver;= #10 8’bzzzzzzzz;
@(posedge CSB or posedge WRB);
$display($time,” Writing %m ABUS=%b DATA=%b”,ABUS,DATABUS);
ramABUS = DATABUS;
end
if (WRB == 1’b1) //Reading from sram (data becomes valid after 10ns)
begin
#10 DATABUS_driver= ramABUS;
$display($time,” Reading %m ABUS=%b DATA=%b”,ABUS,DATABUS_driver);
end
end
else //sram unselected, stop driving bus after 10ns
begin
DATABUS_driver;= #10 8’bzzzzzzzz;
end
end
endmodule7.7 STRUCTURAL DATA TYPES: WIRE AND REG
Verilog underpins basic information writes called nets which show equipment associations between circuit parts. The two most normal auxiliary information composes are wire and reg. The wire nets act like genuine wires in circuits. The reg compose hold their qualities until the point when another esteem is put on them, much the same as an enlist equipment segment. The affirmations for wire and reg signals are inside a module yet outside any underlying or dependably square. The underlying condition of a reg is x obscure, and the underlying condition of a wire is z. Ports: Modules speak with each other through ports, the signs recorded in the parameter list at the highest point of the module. Ports can be of sort in, out, and inout. Here are 3 shortsighted tenets for coordinating the basic information compose to the kind of port:
Use reg as the yields of Behavioral squares. On the off chance that you us a wire then the esteem will never be seen by different pieces.
Use wire for all sources of info, inouts, and most yields of Structural components.
If you require an exceptional quality write task utilize extraordinary net watchword wand, wor, tir, triand, trior, trireg.
7.8 BEHAVIORAL DATA TYPES: INTEGER, REAL, AND TIME
The sorts in number and genuine are helpful information composes to use for tallying in social code pieces. These information composes act like their partners in other programming dialects. On the off chance that you in the long run intend to orchestrate your social code then you would most likely need to abstain from utilizing these information writes in light of the fact that they frequently combine extensive circuits. The information compose time can hold an extraordinary test system esteem called reenactment time which is extricated from the framework work $time. The time data can be utilized to enable you to investigate your recreations.
….. //code fragment from inside a module
integeri, y;
real a;
real b = 3.5;
real c = 4;
timesimulationTime;
initial
begin
y = 4;
i = 5 + y;
c = c + 3.5;
a = 5.3e4;
simulationTime = $time;
$display(“integer y = %d, i = %f
“, y, i);
$display(“reals c = %f, a = %e, b= %g
“, c, a, b);
$display(“time simulationTime = %t
“, simulationTime);
end
7.9 NUMBER SYNTAX
Numbers in Verilog are in the accompanying arrangement The size is constantly indicated as a decimal number. On the off chance that no is determined then the default measure is no less than 32bits and might be bigger relying upon the machine. Substantial base organizations are ‘b , ‘B , ‘h , ‘H ‘d , ‘D , ‘o , ‘O for double, hexadecimal, decimal, and octal. Numbers comprise of series of digits (0-9, A-F, a-f, x, X, z, Z). The X’s mean obscure, and the Z’s mean high impedance If no base configuration is indicated the number is thought to be a decimal number. A few cases of substantial numbers are:
2’b10 // 2 bit binary number
‘b10 // at least a 32-bit binary number
3 // at least a 32-bit decimal number
8’hAf // 8-bit hexadecimal
-16’d47 // negative decimal number
7.10 BEHAVIORAL DESIGN WITH BLOCKING AND NON-BLOCKING STATEMENTS
There are 2 sorts of task proclamations: blocking utilizing the = administrator, and non-blocking utilizing the <= administrator. Blocking assignments act like successive code explanations and execute when they are called. Non-blocking plan occasions to occur sooner or later. This can be befuddling in light of the fact that lines that show up after a non-blocking articulation execute in the meantime as the non-blocking explanation. Here are a few cases:
#5 x = 1’b0; // blocks for 5 time units, applies value to x, then next line goes
y = 1’b1; // blocks, sets y to 1 now, then next statement goes
y <= #3 1’b0; // evaluates now, schedules apply y=0 in 3 time units, and next line goes
#5 x ;= y; // waits for 5 time units, evaluates,
// schedules apply at end of current time, and next line goes
The following two code blocks are not equivalent:
// Section 1: Blocking statements execute sequentially
#5 a = b; // waits 5 time units, evaluates and applies value to a
c = d; // evaluates and applies value to c
// Section 2: Non-Blocking statements execute concurrently
#5 a ;= b; // waits 5 time units, evaluates, schedules apply for end of current time
c ;= d; // evaluate, schedules apply for end of current time
// At end of current time both a and c receive their values
7.11 ARRAYS, VECTORS, AND MEMORIES
Verilog underpins three comparable information structures called Arrays, Vectors, and Memories. Clusters are utilized to hold a few objects of a similar sort. Vectors are utilized to speak to multi-bit transports. Furthermore, Memories are varieties of vectors which are gotten to like equipment recollections. Read the accompanying cases to decide how to reference and utilize the distinctive information structures.
//*** Arrays for integer, time, reg, and vectors of reg ***************
integeri3:0; //integer array with a length of 4
time x20:1; //time array with length of 19
reg r7:0; //scalar reg array with length of 8
c = r3; //the 3rd reg value in array r is assigned to c
//*** Vectors are multi-bit words of type reg or net (wire)************
reg 7:0 MultiBitWord1; // 8-bit reg vector with MSB=7 LSB=0
wire 0:7 MultiBitWord2; // 8-bit wire vector with MSB=0 LSB=7
reg 3:0 bitslice;
reg a; // single bit vector often referred to as a scalar
…. //referencing vectors
a = MultiBitWord13; //applies the 3rd bit of MultiBitWord1 to a
bitslice = MultiBitWord13:0; //applies the 3-0 bits of MultiBitWord1 to bitslice//*** Memories are arrays of vector reg ********************************
reg 7:0 ram0:4095; // 4096 memory cells that are 8 bits wide
//code excerpt from Chapter 2 SRAM model
input 11:0 ABUS; // 12-bit address bus to access all 4096 memory cells
inout 7:0 DATABUS; // 8-bit data bus to wite into and out of a memory cell
reg 7:0 DATABUS_driver;
wire 7:0 DATABUS = DATABUS_driver; //inout must be driven by a wire
….
for (i=0; i< 4095; i = i + 1) // Setting individual memory cells to 0
rami = 0;
end
….
ramABUS = DATABUS; //writing to a memory cell
….
DATABUS_driver= ramABUS; //reading from a memory cell
7.12 OPERATORS
Here is a little choice of the Verilog Operators which appear to be comparative however have distinctive impacts. Coherent Operators assess to TRUE or FALSE. Bitwise administrators follow up on each piece of the operands to deliver a multi-bit result. Unary Reduction administrators play out the task on all bits of the operand to create a solitary piece result.
Table 7.12.1 list of operators and its description
Operator Name Examples
! logical negation ~ bitwise negation && logical and & bitwise and abus = bbus&cbus;
& reduction and abit = &bbus;
~& reduction nand|| logical or | bitwise or | reduction or ~| reduction nor ^ bitwise xor^ reduction xor~^ ^~ bitwise xnor~^ ^~ reduction xnor== logical equality, result may be unknown if x or z in the input if (a == b)
=== logical equality including x and z != logical inequality, result may be unknown if x or z in the input !== logical inequality including x and z > relational greater than >> shift right by a number of positions a = shiftvalue>> 2;
>= relational greater than or equal < relational less than << shift left by a number of positions <= relational less than or equal if (a <= b)
CHAPTER 8
SIMULATION RESULTS
CHAPTER 9
ADVANTAGES
Low power consumption
By utilizing instantiation method we will execute this task. So modules will be diminished and naturally power will be decreased.
Occupies less area
In VLSI, we will actualizing the squares and it’s zone is less, on the off chance that we will do creation or dump in a FPGA the most extreme zone will lessened..High speed
The speed of the framework is high and execution time is less for this framework.
CHAPTER 10
APPLICATIONS
For additions and subtractions
This method is utilized as a part of including and subtracting the bits. In a few circumstances we require augmentations and subtractions at once. At those cases we can utilize this system. In cutting edge Novel reversible ALUs we can utilize this strategy..In Digital signal processing
In this we have do augmentations and flag increases. For that on the off chance that we utilize this method it will give low power and fast in light of the fact that in this we are utilizing reversible entryways with the goal that the speed is higher than essential doors.
In communication system
In communication, we require balance strategies. In that tweak of signs we are utilizing augmentations and duplications and subtractions. For that we can utilize this strategy it will diminish the power and give the yield.
CHAPTER 11
FUTURE SCOPE
In this we have composed 8-bit equality saving include/sub utilizing a reversible door. In future we will build the bit estimate like 16 and 32 bit and here we are utilizing the reversible doors so the power is not as much as entryways.
CHAPTER 12
CONCLUSION
In this task, a novel equality protecting reversible entryway, P2RG and its applications were proposed. The proposed circuit was contrasted and the current outlines as far as steady sources of info, refuse yields, and territory. The steady data sources and junk yields are enhanced. Territory is enhanced by half for full viper/subtractor and 46.36% for 8-bit full snake/subtractor contrasted with the F2G door while 32.26% of zone is enhanced for full snake/subtractor and 33.24% of region is enhanced for 8-bit full snake/subtractor contrasted with the MIG entryway. The plan is better among all its current Counterparts as far as consistent information sources, waste yields and zone. Power ascertained of the full snake/subtractor is 0.214milliwatt while control figured of a similar circuit utilizing irreversible door is 33.59milliwatt. So 33.376milliwatt measure of energy is spared here.
CHAPTER 13
REFERENCES
R. Landauer, “Irreversibility and heat generation in the computing process,” IBM journal of research and development, vol. 5, no. 3, pp. 183–191, 1961.
C. H. Bennett, “Logical reversibility of computation,” IBM journal of Research and Development, vol. 17, no. 6, pp. 525–532, 1973.
R. P. Feynman, “Quantum mechanical computers,” Foundations of physics, vol. 16, no. 6, pp. 507–531, 1986.
E. Fredkin and T. Toffoli, Conservative logic. Springer, 2002.
M. Islam, Z. Begum et al., “Reversible logic synthesis of fault tolerant carry skip bcd adder,” arXiv preprint arXiv:1008.3288, 2010.
P. NG and M. Anandaraju, “Design and synthesis of fault tolerant full adder/subtractor using reversible logic gates.”
P. Garg and S. Saini, “A novel design of compact reversible sg gate and its applications,” in Communications and Information Technologies (ISCIT), 2014 14th International Symposium on. IEEE, 2014, pp. 400–403.
S. Saini and S. B. Mandalika, “A new bus coding technique to minimize crosstalk in vlsi bus,” in Electronics Computer Technology (ICECT), 2011 3rd International Conference on, vol. 1. IEEE, 2011, pp. 424–428.
USYD, “State Reduction,” http://www.ee.usyd.edu.au/tutorials/ digital tutorial/part3/st-red.htm, 2008, Online; accessed 19-July- 2008.
G. Paul, A. Chattopadhyay, and C. Chandak, “Designing parity preserving reversible circuits,” arXiv preprint arXiv:1308.0840, 2013.
B. Parhami, “Fault-tolerant reversible circuits,” in Signals, Systems and Computers, 2006. ACSSC’06. Fortieth Asilomar Conference on. IEEE, 2006, pp. 1726–1729.
P. Kaur and B. S. Dhaliwal, “Design of fault tolearnt full adder/subtarctor using reversible gates,” in Computer Communication and Informatics (ICCCI), 2012 International Conference on. IEEE, 2012, pp. 1–5.
