Complex Combinational Circuits Binary Adders Key to enterprise: Addition table also a truth table S i = C i 'A i B i ' + C i 'A i 'B i + C i A i 'B i '+

Slides:



Advertisements
Similar presentations
Digital Design: Combinational Logic Blocks
Advertisements

Modular Combinational Logic
Documentation Standards
CS370 – Spring 2003 Programmable Logic Devices PALs/PLAs.
Programmable Logic PAL, PLA.
111 Basic Circuit Elements n Standard TTL Small-Scale Integration: 1 chip = 2-8 gates n Requires numerous chips to build interesting circuits n Alternative:
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
1 Designing with MSI Documentation Standards  Block diagrams first step in hierarchical design  Schematic diagrams  Timing diagrams  Circuit descriptions.
Multiplexers, Decoders, and Programmable Logic Devices
Digital Logic Design Lecture 18. Announcements HW 6 up on webpage, due on Thursday, 11/6.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Logic Gates Combinational Circuits
Adders, subtractors, ALUs
CS 105 Digital Logic Design
Top-down modular design
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Combinational and Sequential Logic Circuits.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.
Functions of Combinational Logic
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A)
1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)
Digital Electronics and Computer Interfacing
Kuliah Rangkaian Digital Kuliah 6: Blok Pembangun Logika Kombinasional Teknik Komputer Universitas Gunadarma.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Chapter 5 Designing Combinational Systems Tell me what you Have in Have out And want done in between Then I can build a program to do anything. Capt. Ed.
Karnaugh maps for the binary full adder.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
1 CSE370, Lecture 11 Lecture 11  Logistics  HW3 due now  Lab4 goes on as normal next week  Tuesday review 6pm, place TBD  Last lecture  "Switching-network"
Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.
CO UNIT-I. 2 Multiplexers: A multiplexer selects information from an input line and directs the information to an output line A typical multiplexer has.
EE207: Digital Systems I, Semester I 2003/2004
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Computing Machinery Chapter 3: Combinational Circuits.
Chapter # 4: Programmable Logic
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
Combinational Circuit Design. Digital Circuits Combinational CircuitsSequential Circuits Output is determined by current values of inputs only. Output.
Designing Combinational Systems
CSI-2111 Structure of Computers Ipage Combinational Circuits  Objectives : To recognize the principal types of combinational circuits  Adders.
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.
MSI Combinational logic circuits
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,
ACOE161 (Spring2007)MSI Devices1 Revision on MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5)
Presented by A. Maleki Fall Semester, 2010
This chapter in the book includes: Objectives Study Guide
Combinational Circuits
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Dr. Clincy Professor of CS
This chapter in the book includes: Objectives Study Guide
CSCE 211: Digital Logic Design
FIGURE 4.1 Block diagram of combinational circuit
HALF ADDER FULL ADDER Half Subtractor.
Programmable Configurations
Dr. Clincy Professor of CS
CSCE 211: Digital Logic Design
Electronics for Physicists
Digital System Design Combinational Logic
Arithmetic Circuits.
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Presentation transcript:

Complex Combinational Circuits Binary Adders Key to enterprise: Addition table also a truth table S i = C i 'A i B i ' + C i 'A i 'B i + C i A i 'B i '+ C i A i B i C i+1 = C i B i + A i B i + C i A i

Complex Combinational Circuits Binary Adders Alternative representation S i = (C i XOR (A i XOR B i )) C i+1 = A i B i + C i (A i XOR B i ) Notes: i) Full adder (shown) composed of 2 half adders (dotted boxes) ii) Example of minimization for multiple outputs (XOR reused)

Complex Combinational Circuits Binary Adders Ripple-carry adder (for multiple column additions)

Complex Combinational Circuits Binary Adders Carry-look-ahead C i+1 = A i B i + C i (A i XOR B i ) C i+1 = G i + P i C i (recursion relation) where G i = A i B i and P i = A i XOR B i example of recursion calculation C i+2 = G i+1 + P i+1 C i+1 = G i+1 + P i+1 (G i + P i C i ) = G i+1 + P i+1 G i + P i+1 P i C i

Complex Combinational Circuits Binary Adders Two’s complement addition Notes: i) M indicates subtraction (flips B i ’s, and adds 1) ii) detects overflow when carry in does not match carry out for last column

Complex Combinational Circuits Decoders n-bit code to m-bit code, where m > n Binary decoders only active output line corresponds to binary quantity at input Example (2-to-4 binary decoder) Note: Enable turns circuit on.

Complex Combinational Circuits Decoders Binary decoders Example (2-to-4 binary decoder) circuitsymbol.

Complex Combinational Circuits Decoders Active high and active low Abstraction from 0’s and 1’s A circuit always does the same thing from the point of view of activity; however, input and outputs can change Example (active low enable; active low output).

Complex Combinational Circuits Decoders Cascading decoders.

Complex Combinational Circuits Decoders Applications Realizing an SOP PQ + QR ≡  PQR (3,6,7).

Complex Combinational Circuits Decoders Applications Driving a LED display.

Complex Combinational Circuits Encoders n-bit code to m-bit code, where n > m Binary encoders creates binary representation of active input.

Complex Combinational Circuits Encoders Problem: What if more than 1 input line is active? Solution: Use priority encoding.

Complex Combinational Circuits Multiplexers and Demultiplexers Multiplexers select from among multiple inputs Demultiplexers select from among multiple outputs Note: sources and destinations can be arbitrarily wide.

Complex Combinational Circuits Multiplexers Example (4-input 1-bit multiplexer).

Complex Combinational Circuits Multiplexers More examples 8-input 1-bit 4-input 2-bit.

Complex Combinational Circuits Multiplexers Applications Time Division Multiplexing 1100  Realizing a function.

Complex Combinational Circuits Demultiplexers Decoders and demultiplexers identical! A 2-to-4 decoder recast as a 4-output 1-bit demultiplexer.

Complex Combinational Circuits Programmable logic devices (PLD’s) Compromise between gate-level design and application-specific integrated circuit (ASIC) 1) Programmable Read Only Memory (PROM).

Complex Combinational Circuits Programmable logic devices (PLD’s) Compromise between gate-level design and application-specific integrated circuit (ASIC) 2) Programmable Array Logic (PAL ® ) F1 = ABC + A'D' + B'CD' F2 = ACD' + B'D.

Complex Combinational Circuits Programmable logic devices (PLD’s) Compromise between gate-level design and application-specific integrated circuit (ASIC) 3) Programmable Logic Array (PLA) F1 = A'B' + ABC + A'CD F2 = A'B' + C'D' + AC' + CD' F3 = A'CD + AC'.

Complex Combinational Circuits Summary of Topics Adders Full adder Ripple-carry adder Carry-look-ahead Two’s complement Decoders Encoders Multiplexers Demultiplexer PLD’s PROM’s PAL’s PLA’s