Experiment 4 Binary Adder, Substracter And Comparator

2y ago
20 Views
2 Downloads
392.49 KB
7 Pages
Last View : 1m ago
Last Download : 3m ago
Upload by : Baylee Stein
Transcription

Experiment4Binary Adder, Substracter and ComparatorObjectives-Use the Adder IC’s to perform Addition and Subtraction-Design a simple comparator-Use the IC to perform the ComparisonReferencesDonald P.Leach : Experimental in Digital Principles, 3rd EditionMalvino/Leach : Digital Principles and ApplicationsBartee : Digital Computer Fundamentals, 6th EditionJohn F. Wakerley : Digital Design , Principle and Practice, 2nd EditionRonald A Reis : Digital Electronics Through Project Analysis, 1st EditionComponents1-74LS04 Hex inverter TTL IC1-74LS08 Quad AND gates TTL IC1-74LS32 Quad OR gates TTL IC2-74LS83 4 bit Binary Full Adder TTL IC1-74LS85 4 bit magnitude comparator TTL IC2-74LS86 Quad-two input XOR TTL ICIntroductionYou have seen in experiment 2 an application of the XOR gate where you havedesigned a Half Adder and a Full Adder. In this experiment you will use 4 bitAdder IC to perform both addition and subtraction (by using 2’s Complementmethod).1) For addition: There are 5 basic rules to remember which are:0 0 00 1 11 0 11 1 10 (one plus one one zero zero carry 1)1 1 1 11(one plus one plus one one carry 1)1 Page

2) For Subtraction: There are 4 basic rules to remember which are:0-0 01-0 11-1 010-1 1A Binary Adder/ SubstracterThe circuit in fig 5.1 is an 8 bit binary Adder/Subtracter, it is constructed bycascading two 74LS83 (4 bit binary adder) in which the carry out of the first IC(low order) is connected to the carry in of the second IC (high order).Figure 4.1For the subtraction operation, it is important to remember that the circuit neveractually subtracts, it only adds. But by creating the 2’s complement of asubtrahend before adding it to then minuend, the circuit solves subtractionproblems.When the Sub Line is LOW, the circuit acts as an ordinary binary adder. This isbecause with one low on each XOR gate, each gate passes the B inputunchanged.When the sub line HIGH, a 2’s complement of the number on B inputs(subtrahend ) (formed by the XOR gates and the carry in HIGH) is passed onthe full adders.2 Page

The output of the operation is on the form of the magnitude and sign bit. Theseven least significant bits represent the magnitude of the operation, andthe eighth significant bit (MSB) represent the sign bit or carry. If a carry out(1)is generated out of the MSB, the number is positive and in true form. If a carryout is not generated(0), the number is negative and is the 2’s complement of themagnitude. Thus the carry bit tells us whether the number is positive ornegative. With this practical circuit, the largest number that can be output is 127, since the eighth place digit is reserved for the sign bit.MAGNITUDE COMPARATORThe 74LS85 is a 4 Bit magnitude comparator that compare two 4 bit words Aand B and can generate an output in the form of : A EQUALS B, (A B) A GREATER than B (A B), A SMALLER than B (A B)The data inputs is from pins A3 A2 A1 A0 and B3 B2 B1B0 . If they are equal, theoutput on pin 6 goes HIGH ( pin 5 and 7 stay LOW). If the A inputs is greater thanthe B inputs, the output on pin 5 goes HIGH (pin 6 and & stay LOW) . If the Ainput is less than the B inputs, the output on pin 7goes HIGH (pin 5 and 6 stay LOW).Procedure1) Connect the Adder/ Subtracter circuit shown in fig 5.Verify the circuit forproper operation by performing 4 binary additions and 4 binarysubtractions.2) Design Adder/Substracter circuit for 8 bit.No need to verify experimentally.3) Design and implement circuits that can act as comparator for A and Busing basic gates. Verify them for proper operation by comparing two-twobit numbers A1 A0 and B1 B0 . Explain their operation.3 Page

Figure 4.24) Implement a 4 bit magnitude comparator by using the 74 LS 85 IC. Verifythem for proper operation by comparing 4 bits addition and 4 bits subtraction.5) Design an 8-bit magnitude comparator by using 74LS85 IC. (students are notrequired to verify design experimentally).4 Page

Pin connection diagram74LS04 hex-inverter (NOT) TTL IC74LS08 Quad-two input AND TTL IC5 Page

74LS32 Quad-two input OR TTL IC74LS86 exclusive OR (X-OR) TTL IC6 Page

74LS83 4 bit Binary Full Adder TTL IC74LS85 4 bit magnitude comparator TTL IC7 Page

2) Design Adder/Substracter circuit for 8 bit. No need to verify experimentally. 3) Design and implement circuits that can act as comparator for A and B using basic gates. Verify them for proper operation by comparing two-two bit

Related Documents:

designs, in digital design we use adders such as half adder, full adder. By using both adders we can implement ripple carry adder, using ripple carry adder we can perform addition for any number of bits. It is a serial adder. It has a huge delay problem. With the use of half adder, full adder delay increases.

1st half adder 2nd half adder Fig. 2.4 : A full adder circuit using half adder. This partial carry combines with the other partial carry and gives the final carry output. The three inputs to such a full adder, A,B and C are completely interchangeable. A full adder circuit constructed by using two half adder circuit.

Adder Aim:To verify the truth table of half adder and full adder by using XOR and NAND gates respectively and analyse the working of half adder and full adder circuit with the help of LEDs in simulator 1 and verify the truth table only of half adder and full adder in simulator 2. Theory Introduction

The dataflow Boolean logic for half adder is given by Sum(S) A XOR B. Carry(C) A AND B. Where A and B are the 1-bit binary inputs to the half adder. Full adder: A full adder adds binary numbers and accounts for values carried in as well as out. A one-bit full adder adds three one-bit binary numbers, often written as A, B, and C in

A full-adder is a logic circuit having 3 inputs A,B and C ( which is the carry from the previous stage) and 2 outputs (Sum and Carry), which will perform according to table 3. The full-adder can handle three binary digits at a time and can therefore be used to add binary numbers in general. The simplest way to construct a full adder is to .

Binary prices Binary prices rautmann (2013 Binary no price Epstein (2002 Binary prices al. (2014 Binary maximis- seek- er- t al. (2010 Binary individ- price al. 2014 Binary prices Binary sset prices Halevy (2019 Auction y Binary diffi- sig- nals Liang (2019 sm y Binary erreac- news al. (2012 Auction y Binary under- signals et y Gaussian erreac .

Server, and the ADDER.NET VNC-URI client. In a typical installation, the ADDER.NET Server is installed just once, but the ADDER.NET VNC-URI client may be installed on any PC from which ADDER.NET Server needs to be accessed. ADDER.NET Server requires a Wind

Introduction to Description Logic Szymon Klarman (part of the content based on the tutorial by Stefan Schlobach) szymon.klarman@gmail.com VU University Amsterdam, 2009-2012. AR@AI Introduction to Description Logic Plan for today Tableau algorithm for ALCwith empty TBoxes Soundness, completeness, termination Reasoning w.r.t. non-empty TBoxes Szymon Klarman 1 / 1. AR@AI Introduction to .