國外計算機工程隨堂講義

FundamentalsofComputerEngineering1

WinterSemester2009/2010

-Introductiontolectures,exercises,labsandtutorials-

Dr.-Ing.StefanWerner

UniversitatDuisburg-Essen

FakultatfiirIngenieurwissenschaften

FachgebietTechnischeInformatik

Structure,Time,RoomIntroduction

?Lectures:Lab:Onlineregistrationrequired

Mondays14:00(s.t.)-15:30FromOct.12th-23rd

http://ti.uni-due.de/ti/en

ST025

Dr.-Ing.StefanWerner

stefan.wemer@uni-due.deLabstartsNov.24th

Dipl.-IngJoachimZumbragel

田joachim.zumbraegel@uni-duc.de

?Exercises:?Tutorial:

Mondays14:00(s.t.)-15:30Dayandtimewillbeanounced

ST025Roomwillbeanounced

Dr.-Ing.StefanWerner!!!Thisisanextraoffer!!!

stefan.werncr@uni-due.dc

Start:Nov.2nd

FranziskusAsthaEkadiyantoM.Sc.

th

Start:Oct26franziskus.ekadiyanto@stud.uni-due.de

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-Ing.StefanWerner

ComputerEngineering

Prof.Drying.AxelHunger

TlltOriol■Production

Isanextraoffer

?aimsatgivingmoreexamples,handson

?moreinteractivethanlecturesanexercises

?allowsmoreflexibilityinspeedandtopic

?givesfeedbackbyhomeworkandtheircorrections

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI**

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering

Prof.Dn-Ing.AxelHunger

Lectures:TableofContent

Chapter1:SwitchingAlgebra

Chapter2:LogicalLevels,Timing&Delays

Chapter3:Karnaugh-Veitch-Maps

Chapter4:NumberSystems

Chapter5:BinaryArithmetic

Chapter6:BinaryCodes

Chapter7:CombinationalCircuitDesign

Chapter8:LatchesandFlipFlops

Chapter9:FiniteStateMachines

Chapter10:BasicSequentialCircuits

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering

Prof.I)n-Ing.AxelHunger

SemesterSchedulebilroduction

VorauspianungVorlesung/Ubung/Praktikum

WS2009/10

Date

DateLectureExercise

Lab

12.10.Introduction13.10.

19.10.Chapter1:Inlroduclion.SwitchingAlgebra20.10.

26.10Chapter1:LogicalFunctionsSwitchingAlgebra27.10.

Chapter2:LogicalLevels,Timing&NormalFormsandTruthtables3.11.

2.11.

DelaysCircuits,timinganddelays

09.11Chapter3:KVMapsKV-Maps10.11.

16.11Chapter4:NumberRepresentationKVMaps17.11.

Chapter4:NumberRepresentationNumbersandnumbersystems24.11.

23.11Lab1

Chapter5:Binar>fArithmeticFloatingpointnumbers/IEEEFormat

OrCadIntroduction

30.11Chapler6:BinaryCodesBinaryarithmetics1.12.

7.12.Chapter7:CombinationalCircuitsCodesandcodeconversion8.12.

Lab2:Circuit

Chapter7:CombinationalCircuits15.12.

14.12.CombinationalcircuitdesignSimulationandAnalysi*

Chapter8:LatchesandFlipFlops

21.12.IntermediateTrialExam一

Combinationalcircuitdesign5.01.

04.01.Chapter8:LatchesandFlipFlopsLab3

FlipFlops

FlipFlopsandCounter;

11.01.Chapter9:FinitestatemachinesFlipFlops12.1.

Chapter9:FinitestatemachinesSequentialcircuitanalysisanddesign19.1.

18.01.Lab4:FiniteState

Chapter10:BasicsequentialcircuitsCounterDesign

MachineDesign

25.01.Chapter10:BasicsequentialcircuitsCounterDesign26.1.

01.02.TrialExam4.2

LectureMaterial■

?Lecturenotes

?LectureSlides

pleasedownloadlectureslidespriortothelecturesandbringthemtoeveiylecture

?ExerciseSheets

pleasedownloadexercisesheetspriorfotheexerciseandbringthemtoeveiy

exercise

?TutorialSheets

pleasedownloadtutorialsheetspriortothetutorialsandbringthemtoeverytutorial

?AdditionalMaterialonannouncement

http://ti.uni-due.de/ti/en/education/teaching/ws0910/fcel/index.php

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringIxxturcr:Dr.-Ing.StefanWerner

ComputerEngineering

Prof.I)n-Ing.AxelHunger

WebsiteIntroduction

BOOkS■Production

Roth,Charles:FundamentalsofLogicDesign,PWSPubL,2001Boston

45YGQ4426

Green,DerekC:DigitalElectronics;Longman,2002Harlow

45YGQ4434

Ercegovac,M.，Lang,T.Moreno,J.H.:IntroductiontoDigitalSystems

JohnWiley&SonsInc,1999NewYork

45YGQI436

Tocci,R.J.:DigitalSystems:PrinciplesandApplications

PrenticeHall,1977NewJersey

45YGQ1436,43YGQ1436

Crisp,J.:IntroductiontoDigitalSystems,Newncs,2000Oxford

45YGQ414I

Gersting,J.L.:MathematicalStructuresfbrComputerScience

W.H.FreemanandCompany,1982,NewYork,SanFrancisco

O1TVA1O33,07TVA1033,45TVA1O33

Hill,F.J.;Peterson,G.R.:IntroductiontoSwitchingTheoryandLogicalDesign

JohnWiley&SonsInc.,1974Canada

43YGQ175

Exambilroduction

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering

Prof.Dicing.AxelHunger1

FundamentalsofComputerEngineering1

WinterSemester2008/2009

Chapter1:

SwitchingAlgebra

Dr.-Ing.StefanWerner

UniversitatDuisburg-Essen

FakultatfiirIngenieurwissenschaften

FachgebietTechnischeInformatik

ChapterI:

Tableofcontent(SwitchingAlgebra

Chapter1:SwitchingAlgebra

Chapter2:LogicalLevels,Timing&Delays

Chapter3:Karnaugh-Veitch-Maps

Chapter4:NumberSystems

Chapter5:BinaryArithmetic

Chapter6:BinaryCodes

Chapter7:CombinationalCircuitDesign

Chapter8:LatchesandFlipFlops

Chapter9:FiniteStateMachines

Chapter10:BasicSequentialCircuits

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-Ing.StefanWerner

ComputerEngineering2of65

Prof.I)n-lng.AxelHunger

Chapter1:

TableofcontentSwitchingAlgebra

Chapter1:SwitchingAlgebra

?Introductiontologic

?BooleanAlgebra

?AxiomsandTheorems

?Logicalfunctions

?TruthTables

?Gates

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering30f65

Prof.Dicing.AxelHunger

Chapter1:

IntroductiontologicSwitchingAlgebra

Pro|X)silionalLogic

IheAncientGreekphilosopherscrcaiedas\stemto

formaliscargumentscalledpropoMUonallogic.

Aproposiiumi、；istalcmcnllluilcouldbe「RUEorIALSL

l^opo-itionsuniklbecompoundedbymeansofihc

operatorsAND.ORandNOT

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering5of65

Prof.Dn-Ing.AxelHunger

ChapterI:

IntroductiontologicSwilchingAlgebra

PropositionalCalculusi：xainple

Prcpasilicnsma\heIRIEorIAlSi.：

itisraining

thewcathcitbrecasi1、had

Acombinedproposition:

it八ramm^OR,theweattw^foreeiisi八had

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering6of65

Prof.I)n-Ing.AxelHunger

Chapter1:

IntroductiontologicSwitchingAlgebra

PropositionalCalculusExample

VVecanequateproposniuns.torexampleb\uriling:

IVMIItakeanumbrella〃八ORtheneather

force/vbad

orequivalentlywecanwrite:

Ifit/>nnmni!(>Rtheywuihetforecastisbud

Iheii/willlakeanumbrella

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering7of65

Prof.Dn-Ing.AxelHunger

ChapterI:

IntroductiontologicSwilchingAlgebra

Diagrammaticrepresentation

Wecanthinkofdieumbrellapropositionasaresult

that\\ccalculateIromtheweathertbreciistorIhelact

thatitisraining

Rain-?

OR

BadWeatherIorecast-**1akc

Iinbrclla

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering8of65

Prof.I)n-Ing.AxelHunger

ChapterI:

Introductiontologic

(SwitchingAlgebra

BooleanAlgebra

Propositionallogicistoo

cumbersometoexpressaiguments

ofanycomplexity.

Anequivalent,moretractable

systemoflogicwas

introducedbytheEnglish

mathematicianBoolein

1850.GeorgeBoole

(November2,1815-December8,

1864)wasaBritishmathematician

andphilosopher

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering12of65

Prof.I)n-lng.AxelHunger

Chapter1:

IntroductiontologicSwitchingAlgebra

FundamentalsofBooleanAlgebra

Thetruthvaluesarereplacedby1and0:

1=TRUE

0=FALSE

Propositionsarereplacedbyvariables:

R=itisraining

W=Theweatherforecastisbad

Operatonsarereplacedbysymbols

~=NOT

+=OR

?=AND

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering13of65

Prof.Dn-Ing.AxelHunger

ChapterI:

IntroductiontologicSwilchingAlgebra

ClaudeShannonandthetheturnto

engineering

Shannondemonstrated(around1938)that

Boole'swaytohandlecomplex

statementscanperfectlybeusedto

describethefunctionalityofnetworksof

switchesthatareeitheropenorclosed.

Sincethan,switcheshavebecomemuch

smaller,butShannon'sSwitchingAlgebra

isstillthemajorlanguagetodescribethe

behaviourofdigitalsystems.

ClaudeE帆oodShannon

(April30,1916-February

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering14of65

Prof.I)n-Ing.AxelHunger

Chapter1:

IntroductiontologicSwitchingAlgebra

TheSwitch-Model

?ThevariableAcanbe0or1.

?Aisrepresentedbyaswitch.

?A=1mightequaltoaclosedswitch

soacun-entcanflowthroughito-----?----?-----0

A=1

?A=0isanopenswitchthatcutsthecircuit.

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering15of65

Prof.Dn-Ing.?\xelHunger

Chapter1:SwitchingAlgebraMChapter1:

DefinitionWSwitchingAlgebra

AnyAlgebraingeneralTheSwitchingAlgebra

consistsofconsistsof

-asetofelements?thebasicsetB={0,1}

一operationsthatcanbeusedon?thedisjunction'V(OR)

theelements?theconjunction-(AND)

一aneutralelementforevery?theneutralelements'O'and'1'

operation

一anumberofaxiomstheset?Commutativity

andtheoperationshaveto?Associativity

satisfy?Distributivity

?Identity

?Complementation

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering16of65

Prof.Dn-Ing.AxelHunger

Chapter1:

LogicalExpressionsSwitchingAlgebra

?combinationofoneormoreelements

?operators'+'(OR)or(AND)areusedtocombinetheelements

?Boolean/SwitchingAlgebraisclosed

=>operatorsusedontwoelementsAandBofthebasicsetwill

yieldaresultCthatismemberofthebasicsetagain.

?LogicalexpressionsarealsocalledBooleanorswitching

expressions.

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering17of65

Prof.Dn-Ing.AxelHunger

ChapterI:

BooleanOperatorsSwilchingAlgebra

Conjunction(ANDoperation)

?conjunctionisalsocalledANDoperator.

?operationyields1onlyifAis1ANDBis1.

?intheswitchmodelisaseriesof-0

twoswitches,whereacurrentonlycanAB

flowifbothswitchesareclosed.

Disjunction(ORoperation)

?disjunction'+'iscalledORoperator.

?operationyields1assoonasAis1ORBis1.

?A+Bintheswitchmodelisequivalenttotwo

parallelswitcheswhereacurrentcanflowifB

oneofthem(orboth)areclosed.

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering18of65

Prof.I)n-Ing.AxelHunger

Axiom1Chapter1:

CommutativitySwitchingAlgebra

BothoperatorsofSwitchingAlgebraarecommutative

A+B

BA

ABBA

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering19of65

Prof.Dn-Ing.AxelHunger

Axiom5Chapter1:

ComplementationSwitchingAlgebra

ForeveryelementAofthebasicsetthereexistsitscomplementA

alsocalledits/nverseelementoritsnegation.Anelement

combinedwithitscomplementyieldsaneutralelement:

A-A=00

—??---------o

AA0

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering23of65

Prof.Dn-Ing.AxelHunger

Theorem1ChapterI:

NullLawSwilchingAlgebra

Anyneutralelementusedwiththe''other“operator(towhich

itisnottheneutralelement)cancelsoutthevariable(compare

withAxiom4andseethedifference):

A?00

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringP*

FacultyofEngineeringIxcturcr:Dr.-lng.StefanWerner

ComputerEngineering24of65

Prof.I)n-Ing.AxelHunger

Theorem2Chapter1:

InvolutionSwitchingAlgebra

Thecomplementofanelement'scomplementistheoriginal

elementagain:

A=A

UniversityofDuisburg-EssenLecture..FundamentalsofComputerEngineeringI”

FacultyofEngineeringLecturer:Dr.-Ing.StefanWerner

ComputerEngineering25of65

Prof.Dn-Ing.AxelHunger

Theorem3ChapterI:

Idempotency(SwitchingAlgebra

Anelementcombinedwithitselfyieldsitself:

Markthedifferencetoe.g.thealgebraofnaturalnumberswhere

1+1=2.In