- ITU - Digital Circuits Course Slide No. 04
- Study Guide
- Section 1 1
- 02_singlecycle
- Lecture 5
- Conjunction
- 2 - Com Bi National Logic Circuits
- Chapter2-5
- Elektronik Soalan 5 Dan 8 2009
- Combinational Circuits
- Arithmatic Ckt
- activity 2 1 6 written report
- Microcontrollers and Digital IO
- lecture5a
- teologia
- tarkasangrahaofa00anan
- dlpsr
- Work Smarts Logic Smart Guide
- Across Main Traceability Transformation Reality
- On Mathematics as Installation Art
- How to Brief a Legal Case for a Law School Class
- يسي
- Afz0001Super Across Management
- Binary Logic Questions
- Approaches to Knowledge Representation
- HAMBLIN Charles Fallacies
- Arity
- Graham Priest the Logic of Buddhist Philosophy – – Aeon
- Science Within Pain
- ACTPrep Student
- Attendance Slip
- 04-LogicGatesCanonical
- labs-2012 (1)
- RTOS
- 82443769 Microprocessor Lab Manual
- 23770-9-2013-01-27455689
- Ecsyll2010 (VTUPlanet.com)Syllabus
- Cse v Operating Systems [10cs53] Notes
- labs-2012 (1)
- Microprocessor Lab
- 2013 Shay
- Current Labman
- 1
- tnn7_report_201212141110
- 7 A,B TIME TABLE
- 3
- 2 Dielectric Loss
- 01 Intro and Methodology
- RTOS
- tnn7_report_201212141110
- Linear Algebra 2005-06(3 Q.P.)
- 41159d-56161
- 04-KarnaughMaps
- 2012-3 Realtime Operating Systems
- Cut-Off Lec and Jrf June 2013

**Logic gates and truth tables Implementing logic functions Canonical forms
**

Sum-of-products Product-of-sums

**Logic gates and truth tables
**

AND X•Y

X Y

XY

Z

X 0 0 1 1 X 0 0 1 1 X 0 1

Y 0 1 0 1 Y 0 1 0 1 Y 1 0

Z 0 0 0 1 Z 0 1 1 1

OR

X+Y

X Y Z

NOT

X'

X

_ X

Y

1

2

**Logic gates and truth tables
**

NAND

X Y

**Logic gates and truth tables
**

XOR

X•Y

XY

Z

X 0 0 1 1

Y 0 1 0 1

Z 1 1 1 0

X⊕Y

X Y Z

X 0 0 1 1

Y 0 1 0 1

Z 0 1 1 0

NOR

X Y

X+Y

Z

X 0 0 1 1

Y 0 1 0 1

Z 1 0 0 0

XNOR

X Y

X⊕Y

Z

X 0 0 1 1

Y 0 1 0 1

Z 1 0 0 1

3

4

**Realizing Boolean formulas
**

F = (A•B)’ + C•D

A B F C D A B C F

**Realizing truth tables
**

Given a truth table

1. Write the Boolean expression 2. Minimize the Boolean expression 3. Draw as gates

F = C•(A+B)’

5

6

B. Carry-in Outputs: Sum. 7 8 Full adder: Sum Before Boolean minimization Sum = A'B'Cin + A'BCin' + AB'Cin' + ABCin After Boolean minimization Sum = (A⊕B) ⊕ Cin Full adder: Carry-out Before Boolean minimization Cout = A'BCin + AB'Cin + ABCin' + ABCin After Boolean minimization Cout = BCin + ACin + AB 9 10 Preview: 2-bit ripple-carry adder A B A1 1-Bit Adder 0 Cin Cout Cin Cout B1 A2 B2 Many possible mappings Many ways to map expressions to gates _ _ _ _ Example: Z = A•B•(C+D) = A•(B•(C+D)) Cin Cout Sum1 Sum2 Overflow Sum 11 12 . Carry-out B 0 0 1 1 0 0 1 1 Cin 0 1 0 1 0 1 0 1 Cout 0 0 0 1 0 1 1 1 Sum 0 1 1 0 1 0 0 1 A B Cin Adder Sum Cout Sum = A'B'Cin + A'BCin' + AB'Cin' + ABCin Cout = A'BCin + AB'Cin + ABCin' + ABCin Both Sum and Cout can be minimized.Example A B 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 C 0 1 0 1 0 1 0 1 F 0 0 1 1 0 1 0 1 Example: Binary full adder F = A’BC’+A’BC+AB’C+ABC = A’B(C’+C)+AC(B’+B) = A’B+AC A 0 0 0 0 1 1 1 1 1-bit binary adder Inputs: A.

What is the optimal realization? We use the axioms and theorems of Boolean algebra to “optimize” our designs Design goals vary Reduce the number of gates? Reduce the number of gate inputs? Reduce the number of cascaded levels of gates? 13 What is the optimal realization? How do we explore the tradeoffs? Logic minimization: Reduce number of gates and complexity Logic optimization: Maximize speed and/or minimize power CAD tools 14 Canonical forms Canonical forms Standard forms for Boolean expressions Derived from truth table Generally not the simplest forms (can be minimized) Sum-of-products (SOP) Also called disjunctive normal form minterm (DNF) or minterm expansion 001 011 101 110 111 Two canonical forms Sum-of-products (minterms) Product-of-sums (maxterms) 15 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 F 0 1 0 1 0 1 1 1 F' 1 0 1 0 1 0 0 0 F = A'B'C + A'BC + AB'C + ABC' + ABC F' = A'B'C' + A'BC' + AB'C' 16 Minterms Variables appear exactly once in each minterm in true or inverted form (but not both) 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 minterms A'B'C' m0 A'B'C m1 A'BC' m2 A'BC m3 AB'C' m4 AB'C m5 ABC' m6 ABC m7 F in canonical F(A.7) m1 + m3 + m5 + m6 + m7 A'B'C+A'BC+AB'C+ABC'+ABC Product-of-sums (POS) Also called conjunctive normal form (CNF) or maxterm expansion 000 010 100 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 F 0 1 0 1 0 1 1 1 F' 1 0 1 0 1 0 0 0 F = (A + B + C) (A + B' + C) (A' + B + C) maxterm F' = (A+B+C')(A+B'+C')(A'+B+C')(A'+B'+C)(A'+B'+C') 17 18 short-hand notation .6.B.3.5.C) = = = form: Σm(1.

3.7) = ∏M(0.5.3.C) = ∏M(0.4) Maxterm to minterm Use minterms that aren’t in maxterm expansion F(A.C) = ∑m(1.5.7) F' = ∑m(0.B.6.4) From SOP to POS and back Minterm of F to minterm of F' Use minterms that don’t appear F(A.5.C) = = = form: Example: F = AB+C ΠM(0.4) = ∑m(1.2.B. and DeMorgan's Sum-of-products F' = A'B'C' + A'BC' + AB'C' SOP.7) 22 SOP.3.5.3.4) M0 • M2 • M4 (A+B+C)(A+B'+C)(A'+B+C) short-hand notation 19 20 From SOP to POS and back Minterm to maxterm Use maxterms that aren’t in minterm expansion F(A.2. POS.6.7) 21 Maxterm of F to maxterm of F' Use maxterms that don’t appear F(A.Maxterms Variables appear exactly once in each maxterm in true or inverted form (but not both) 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 maxterms A+B+C M0 A+B+C' M1 A+B'+C M2 A+B'+C' M3 A'+B+C M4 A'+B+C' M5 A'+B'+C M6 A'+B'+C' M7 F in canonical F(A.2.6.6.B.2.2.B.C) = ∑m(1. POS.C) = ∏M(0. and DeMorgan's Product-of-sums F' = (A+B+C')(A+B'+C')(A'+B+C')(A'+B'+C') Apply DeMorgan's to get SOP Apply DeMorgan's to get POS (F')' = (A'B'C' + A'BC' + AB'C')' F = (A+B+C)(A+B'+C)(A'+B+C) (F')' = ((A+B+C')(A+B'+C')(A'+B+C')(A'+B'+C'))' F = A'B'C + A'BC + AB'C + ABC 23 24 .4) F' = ∏M(1.B.

- ITU - Digital Circuits Course Slide No. 04Uploaded byHaydar Şahin
- Study GuideUploaded byCanon Em
- Section 1 1Uploaded bySeung Gyun Kim
- 02_singlecycleUploaded byUsman Mohyud Din
- Lecture 5Uploaded bykewancam
- ConjunctionUploaded byForchia Cutar
- 2 - Com Bi National Logic CircuitsUploaded byRey Christopher Castillo
- Chapter2-5Uploaded byRawan F Hamad
- Elektronik Soalan 5 Dan 8 2009Uploaded bywanawok
- Combinational CircuitsUploaded bySrinivas Reddy
- Arithmatic CktUploaded byDebayan Biswas
- activity 2 1 6 written reportUploaded byapi-270488569
- Microcontrollers and Digital IOUploaded byHemang Mehta
- lecture5aUploaded bySonam Phuntsho
- teologiaUploaded byJavierMiguelMaciasMejia
- tarkasangrahaofa00ananUploaded byKrishnaSwami
- dlpsrUploaded byAntonio José Almenara Vida
- Work Smarts Logic Smart GuideUploaded byDian Khoeroni
- Across Main Traceability Transformation RealityUploaded bysfofoby
- On Mathematics as Installation ArtUploaded byAlgirdas Javtokas
- How to Brief a Legal Case for a Law School ClassUploaded byAnthony Fejfar
- يسيUploaded byAumar
- Afz0001Super Across ManagementUploaded bysfofoby
- Binary Logic QuestionsUploaded byAgnivesh Sharma
- Approaches to Knowledge RepresentationUploaded byAmb
- HAMBLIN Charles FallaciesUploaded byLauraelvi
- ArityUploaded byJohan Papado
- Graham Priest the Logic of Buddhist Philosophy – – AeonUploaded bykpshankaran123
- Science Within PainUploaded byPratik Shakya
- ACTPrep StudentUploaded bycoonli

- Attendance SlipUploaded bysarala20021990
- 04-LogicGatesCanonicalUploaded bysarala20021990
- labs-2012 (1)Uploaded bysarala20021990
- RTOSUploaded bysarala20021990
- 82443769 Microprocessor Lab ManualUploaded bysarala20021990
- 23770-9-2013-01-27455689Uploaded bysarala20021990
- Ecsyll2010 (VTUPlanet.com)SyllabusUploaded bysarala20021990
- Cse v Operating Systems [10cs53] NotesUploaded bysarala20021990
- labs-2012 (1)Uploaded bysarala20021990
- Microprocessor LabUploaded bysarala20021990
- 2013 ShayUploaded bysarala20021990
- Current LabmanUploaded bysarala20021990
- 1Uploaded bysarala20021990
- tnn7_report_201212141110Uploaded bysarala20021990
- 7 A,B TIME TABLEUploaded bysarala20021990
- 3Uploaded bysarala20021990
- 2 Dielectric LossUploaded bysarala20021990
- 01 Intro and MethodologyUploaded bysarala20021990
- RTOSUploaded bysarala20021990
- tnn7_report_201212141110Uploaded bysarala20021990
- Linear Algebra 2005-06(3 Q.P.)Uploaded bysarala20021990
- 41159d-56161Uploaded bysarala20021990
- 04-KarnaughMapsUploaded bysarala20021990
- 2012-3 Realtime Operating SystemsUploaded bysarala20021990
- Cut-Off Lec and Jrf June 2013Uploaded bysarala20021990