10 views

Uploaded by Fakhar Abbas

Hardware

Hardware

© All Rights Reserved

- Digital Electronics Lab Manual
- Boolean Algebra
- [Kenneth P. Parker] the Boundary-Scan Handbook
- Logic Demystified - Anthony Boutelle, Stan Gibilisco.pdf
- If and only if
- Digital Logic Design
- ECSS-Q-ST-60-12C(31July2008)
- MELJUN CORTES CS 123 Digital Design and Pc Trouble Shooting- Teacher-it
- Ces 522 Lecture 1 Hierarchical Design
- lecture plan - digital electronics
- Week 1 - Introduction and Logic Gates
- IEO Syllabus Third Year-Electronics and Communications Engineering
- 1986_Radford_The Use of Electrical
- GROne
- Canon Fax Board N1
- 4CC503_Lec4_week9
- Gate Syllabus
- MELJUN CORTES CS 123 Digital Design and Pc Trouble Shooting- Student-it
- PPT Template(1)
- BooleanFunctions1 (1)

You are on page 1of 4

While Boolean algebra is the fundamental formal system for digital circuit designers, digital circuits are their

final product. Digital circuits are similar to Boolean block diagrams but each block is replaced by an easily

recognizable graphical symbol called a gate. A circuit is designed by connecting gates together. Since the gate

symbols are clearly recognisable there is no need to label them AND, OR etc., and they can be composed into

more complex building blocks which in turn are given their own symbols. The basic gate symbols are:

The NOT gate is often referred to as an inverter gate. Actually, the inversion is indicated by the little circle on

the right hand end. The triangle on the left hand side indicates which is the input and which is the output. The

circle can also be attached to the AND and OR gates to make up two new gates which are called NAND (not

and) and NOR (not or).

These gates are the fundamental building blocks of digital circuits. In fact it would be possible to build any

digital circuit using just NAND gates or just NOR gates. To demonstrate that this is so we will use the NAND

gate to build implementations of all the other gates that we have seen so far.

Firstly, the inverter is easily implemented by connecting the two inputs of the NAND gate together. In terms of

Boolean equations we can write (A A)0 = A0 . The circuit is:

Having created an inverter we can now implement the AND gate simply by inverting the output from a NAND

gate. In terms of Boolean equations we can write ((A B)0 )0 = A B. The circuit is:

In order to create the OR gate we need use de Morgans theorem: A + B = (A0 B 0 )0 . The circuit is created by

using two inverters to form A0 and B 0 and then one more NAND gate.

Finally we can create the NOR gate simply by adding another inverter stage to the OR gate implemented above.

As an exercise you can try to design all the other gates using just NOR gates.

We can build circuits of any complexity out of these simple building blocks. We can look at their function

in two different ways. Firstly we can write down a boolean equation by tracing through the circuit, and then try

to simplify it. Secondly we can calculate a truth table which completely specifies its behaviour. This is most

easily done by calculating the intermediate nodes. Consider a circuit made up by cascading two NAND gates.

We mark the output as X and the intermediate wire as I. We can use Boolean algebra to write:

I = (B C)0

X = (A I)0 = (A (B C)0 )0

X = A0 + B C (by de Morgans theorem)

We can build a truth table by systematically working through the circuit. We calculate I first, and then use it to

find X.

A

0

0

0

0

1

1

1

1

B

0

0

1

1

0

0

1

1

C

0

1

0

1

0

1

0

1

I = (B C)0

1

1

1

0

1

1

1

0

X = (A I)0

1

1

1

1

0

0

0

1

As another exercise we can consider how to build a three input NAND gate. In Boolean algebra we write this

as X = (A B C)0 = (A (B C))0 ). Notice that we are using the associative rule of Boolean algebra to build

a three input AND gate from two two input AND gates. The final circuit can be simplified by using a NAND

gate to replace the AND and inverter combination.

We introduce two very commonly used gates which have their own individual symbols in Boolean circuit

design.

From the boolean equations we see that it is possible to build these out of other gates, but in practice they are so

useful that they deserve to be considered Boolean functions in their own right. The truth tables are as follows:

A

0

0

1

1

B

0

1

0

1

XOR

0

1

1

0

A

0

0

1

1

B

0

1

0

1

XNOR

1

0

0

1

We have now seen one one input gate and six two-input gates, but are these the only useful ones? One may ask

the question how many different gates one can build? and what do they all do? We can answer the first

question by noting that with one input, there are two possible outputs, and therefore 22 = 4 different gates.

With two inputs, there are four possible outputs, and therefore 24 = 16 different gates. If we consider the case

of single input circuits, we can enumerate the four possibilities:

DOC112: Computer Hardware Lecture 2

A

0

1

G0

0

0

G1

0

1

G2

1

0

G3

1

1

We see that G2 is the inverter gate, and is the only useful one of the four. G0 always produces the output 0, G1

simply returns the input value of A, and G3 always produces the output 1. The function of each gate can be

summarised by the following table:

R=

G0

0

G1

A

G2

A

G3

1

By a similar method we can enumerate all possible two input gates and their Boolean functions:

AB

00

01

10

11

R=

G0

0

0

0

0

0

G1

0

0

0

1

AND

G2

0

0

1

0

G3

0

0

1

1

A

G4

0

1

0

0

G5

0

1

0

1

B

G6

0

1

1

0

XOR

G7

0

1

1

1

OR

G8

1

0

0

0

NOR

G9

1

0

0

1

XNOR

G10

1

0

1

0

B

G11

1

0

1

1

G12

1

1

0

0

A

G13

1

1

0

1

G14

1

1

1

0

NAND

G15

1

1

1

1

1

Again we see that the six gates we have already described are the ones that provide useful functions of the two

inputs. We may find a use for the others in specific design problems, but they are not sufficiently useful to merit

a special symbol or function name.

Graphical manipulation of circuit diagrams can often be done to simplify a design. Consider de Morgans

theorem which we can use to write the equation: A + B = (A0 B 0 )0 . This could be the basis of a circuit

manipulation that we can make simply by looking at the circuit diagram:

Often it is convenient to use just the circle for inversion rather than the whole inverter gate symbol. Doing this

we represent de Morgans theorem graphically as follows:

And we can now perform the same manipulations that we did using Boolean algebra directly to circuits as we

design them:

To finish up this lecture we introduce a new way of looking at Boolean circuits. So far we have treated gates as

implementing Boolean functions of their input variables, and have not considered the possibility that the inputs

may be of different types. We now introduce the idea that Boolean variables in circuits may belong to one of

two types: data and control. Control variables are used to determine the flow of data. Here is a simple example.

The block diagram shows a circuit with one control variable, one data variable and one output.

We now specify the action of the circuit informally as: If the control variable is 1 then the output is the same as

A. If it is zero the output is zero. In other words the circuit either allows the data to pass from input to output

or blocks it, depending on the control variable. The implementation of this circuit is trivial: it is just the AND

gate, We now see why the name gate is used.

Thinking about a circuit operation in this way will prove invaluable as we begin to design more complex digital

circuits.

We can extend this concept to design a very useful circuit. It has two data inputs, A and B, one control input and one output. The specification is: If the control input is zero then the output is the same as A. If it is 1,

then the output is the same as B. In other words it is a switch that choses between data line A and data line B.

Starting with this specification we can express the circuits function as a truth table:

C

0

0

0

0

1

1

1

1

A

0

0

1

1

0

0

1

1

B

0

1

0

1

0

1

0

1

R

0

0

1

1

0

1

0

1

We will introduce a systematic method for designing circuits from truth tables next lecture, but for the moment

we will do the design by reasoning. We have seen that the AND gate can be used to block a data path, so we

can apply this idea to the data inputs A and B, but invert the control input so that when C is 0 A is unblocked

but B is blocked and vice versa. We can do this with just two AND gates and one inverter.

All we need to do is to combine the two outputs into one. We note that in Boolean algebra A + 0 = A, and so

all we need to do is to combine RA and RB with an OR gate.

The final circuit is called a multiplexer, and as we shall see is one of the most useful building blocks in digital

computer design.

- Digital Electronics Lab ManualUploaded byRahil Khan
- Boolean AlgebraUploaded byER Varun Panchal
- [Kenneth P. Parker] the Boundary-Scan HandbookUploaded byresponse18
- Logic Demystified - Anthony Boutelle, Stan Gibilisco.pdfUploaded bySagun Raj Basnet
- If and only ifUploaded byPatrick Mugo
- Digital Logic DesignUploaded byShareef Khan
- ECSS-Q-ST-60-12C(31July2008)Uploaded byjsadachi
- MELJUN CORTES CS 123 Digital Design and Pc Trouble Shooting- Teacher-itUploaded byMELJUN CORTES, MBA,MPA
- Ces 522 Lecture 1 Hierarchical DesignUploaded byj0880j
- lecture plan - digital electronicsUploaded byreporterrajini
- Week 1 - Introduction and Logic GatesUploaded byMangala Semage
- IEO Syllabus Third Year-Electronics and Communications EngineeringUploaded byAkhil Aaron
- 1986_Radford_The Use of ElectricalUploaded byMiguel Murillo
- GROneUploaded byKernel5
- Canon Fax Board N1Uploaded bycopyhere
- 4CC503_Lec4_week9Uploaded byAnonymous bk7we8
- Gate SyllabusUploaded byRufiah Basha
- MELJUN CORTES CS 123 Digital Design and Pc Trouble Shooting- Student-itUploaded byMELJUN CORTES, MBA,MPA
- PPT Template(1)Uploaded byHemalatha K.N.
- BooleanFunctions1 (1)Uploaded bynyshya22
- ttUploaded byNiko
- Digitla Electronics RI 1215Uploaded byarun
- LogicWorks 4 TutorialUploaded byAnonymous RJZzJPL
- 3.5Uploaded byCarlo Tenorio
- Childs LampUploaded bychakralabs
- Job Description - Electrical Engineer (1044204)Uploaded bybigirimw
- The Clap Switc1Uploaded byahsana29
- Express Sch[1]Uploaded byAbhishek Mishra
- Boolean Algebra and logic gates.pdfUploaded byUmair Adil
- Cmos Full AdderUploaded byAnonymous JnvCyu85

- 07127487Uploaded byFakhar Abbas
- Continuous Fourier.pdfUploaded byFakhar Abbas
- 25.108_Digital Filter Design Using FDAToolUploaded byJibran Siddiqui
- CT - 2 Mark Question BankUploaded byFakhar Abbas
- english _comp_-ssc1.pdfUploaded byFakhar Abbas
- Polygons & circles.pdfUploaded byASHISH ANAND
- Islamiat Compulsory (1)Uploaded byFakhar Abbas
- Basic3Uploaded byFakhar Abbas
- Basic2Uploaded byFakhar Abbas
- Time and Work Problems1Uploaded byFakhar Abbas
- 07117445Uploaded byFakhar Abbas
- 06952355Uploaded byFakhar Abbas
- 07124701Uploaded byFakhar Abbas
- 07127502Uploaded byFakhar Abbas
- 07127643Uploaded byFakhar Abbas
- 07127688.pdfUploaded byFakhar Abbas
- 07136237Uploaded byFakhar Abbas
- 07145853Uploaded byFakhar Abbas
- 07145972Uploaded byFakhar Abbas
- 07146060Uploaded byFakhar Abbas
- 07150447Uploaded byFakhar Abbas
- 07166317Uploaded byFakhar Abbas
- 07166320Uploaded byFakhar Abbas
- 07167093Uploaded byFakhar Abbas
- Best Paper 9Uploaded byFakhar Abbas
- Best Paper 12Uploaded byFakhar Abbas
- Best Paper 13Uploaded byFakhar Abbas
- Best Paper 17Uploaded byFakhar Abbas
- best_of_best_4Uploaded byFakhar Abbas

- Presidential Election and Orange RevolutionUploaded byAlainzhu
- Mechanical Designer 3D Design in Dallas Ft Worth TX Resume Shawn VahdatUploaded byShawnVahdat
- Code+of+Construction+Safety+Practice+ENGLISH.pdfUploaded byBalaguruPrasanna
- A Study of Keats's Ode to a Nightingale.pdfUploaded bySiddhartha Pratapa
- Dn05171601 3 en Global PDF Online a4Uploaded byعابد الشعبي
- Lesson Plan[1] NewUploaded byBathumalai Munisamy
- 24M- Part Manual - SEBP4105-27-01-ALL.pdfUploaded byFausto G
- Tableau Server Security 8Uploaded byRamki Jagadishan
- Procedure for Db RefreshUploaded byMarissa Johnson
- 4.06 - 4.07 Aromatic Chemistry and AminesUploaded byAdnan Chowdhury
- SCLEROLOGY MILLER.10!6!2012Uploaded byTri Ayu Eka Paksi
- Communication PDF DefinitionUploaded byAaron
- Drugs AbuseUploaded byanilkc9
- 17-7 PH Data SheetUploaded bysksiddique
- Bitustick_XL-Material Safety Data SheetUploaded byaldred_chezka
- Abu SimbelUploaded byJennifer Brown
- Primus 1000 ExcelUploaded bySumeet Pandey
- 3. TecnomatixUploaded byCan Thi Trang
- Growel Dairy Farming ManualUploaded byGrowel Agrovet Private Limited.
- AGARD-R-767Uploaded bySaad Al Hely
- FNSACC505 Student Guide WPUploaded byLouise Hurrell
- Dempayos DevCom201 Module Test Answers for Module IIIUploaded byRecis Dempayos
- Rigvedic DeitiesUploaded bynieotyagi
- Act 2 DinamicaUploaded byAlan Olvera
- Dutch An Essential GrammarUploaded byAhmed Mahmoud
- Ayurvedic Plants in Brain Disorders the Herbal HopeUploaded byPrathamSasha
- Petronas Details RAPID Project Contract AwardsUploaded byIzzadAfif1990
- Swami Sriyukteswarji Biography StoriesUploaded bysre_eram4160
- Repair of Truncus ArteriosusUploaded bydrnareshkumar3281
- Www.reliablefire.com Portablesfolder WheeledunitsUploaded byjdsa123