Power Point Presentation Donald Bearden CS 147 September 13, 2001.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

컴퓨터구조론 교수 채수환. 교재 Computer Systems Organization & Architecture John D. Carpinelli, 2001, Addison Wesley.
Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika
Conversion and Coding (12)10.
Combinational Circuits CS370 – Spring BCD to 7 Segment Display Controller Understanding the problem: input is a 4 bit bcd digit output is the control.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
ECE 331 – Digital System Design
CSE-221 Digital Logic Design (DLD)
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
1 COMP541 Arithmetic Circuits Montek Singh Mar 20, 2007.
ECE 301 – Digital Electronics
Digital Logic Design Lecture 18. Announcements HW 6 up on webpage, due on Thursday, 11/6.
ECE 301 – Digital Electronics
1 EE 365 Adders Multipliers Read-Only Memories 2 Equality Comparators 1-bit comparator 4-bit comparator EQ_L.
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
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
CS 105 Digital Logic Design
Calculator Lab Overview Note: Slides Updated 10/8/12
ReVieW Combinational & Sequential Logic Circuit EKT 221 / 4 DIGITAL ELECTRONICS II.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
ECE 101 An Introduction to Information Technology Digital Logic.
Combinational Logic Design
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
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.
Digital Arithmetic and Arithmetic Circuits
Conversion and Coding (12) 10. Conversion and Coding (12) Conversion.
IKI a-Combinatorial Components Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
Digital Logic Fundamentals CT101 – Computing Systems.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
CHAPTER 4 Combinational Logic Design- Arithmetic Operation (Section 4.6&4.9)
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
ARITHMETIC MICRO OPERATIONS
Computer Architecture Lecture 3 Combinational Circuits Ralph Grishman September 2015 NYU.
Combinational Circuits
CS221: Digital Logic Design Combinational Circuits
Digital Logic Fundamentals & CLC Review
ECE 331 – Digital System Design Multi-bit Adder Circuits, Adder/Subtractor Circuit, and Multiplier Circuit (Lecture #12)
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.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
1 Fundamentals of Computer Science Combinational Circuits.
Number Representation (Part 2) Computer Architecture (Fall 2006)
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
ETE 204 – Digital Electronics Combinational Logic Design Single-bit and Multiple-bit Adder Circuits [Lecture: 9] Instructor: Sajib Roy Lecturer, ETE,ULAB.
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Combinational Circuits
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Reference: Moris Mano 4th Edition Chapter 4
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Combinational Circuits
Programmable Configurations
Ch 4. Combinational logic
Logic Circuits I Lecture 3.
Combinational Circuits
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Computer Architecture
Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.
Presentation transcript:

Power Point Presentation Donald Bearden CS 147 September 13, 2001

Topics Covered: n Sec 1.3.5: Adders and Subtractors n Sec 1.3.6: Memory n Sec 1.4.1: BCD to 7-segment Decoder n Sec 1.4.2: Data Sorters

1.3.5: Adders and Subtractors n The circuits used to perform arithmetic operations are constructed using combinatorial logic. ADDERS are the most commonly used. n HALF ADDERS are the most basic of the adders. It inputs two 1-bit values, X and Y and outputs their 2-bit sum as bits C(carry) and S(sum).

A half adder: n Truth table: n X Y | C S n n 0 0 | 0 0 n 0 1 | 0 1 n 1 0 | 0 1 n 1 1 | 1 0 Half adder X Y C S

1.3.5: Adders and Subtractors n FULL ADDER was developed to add numbers that are more than one bit wide. It has three inputs: the two data inputs and a carry input(Cin). The output is the same as the half adder.

FULL ADDER: n Truth table: n X Y Cin | C S n n | 0 0 n | 0 1 n | 0 1 n | 1 0 n | 0 1 n | 1 0 n | 1 0 n | 1 1 n Full adder Cin X Y S C

1.3.5: Adders and Subtractors n RIPPLE ADDER: full adders cascaded to produce an n-bit adder by connecting output C of an adder to Cin of th enext adder. The reason it’s called a ripple adder is the carry bits ripple through the adder. n Each full adder has a small PROPAGATION DELAY, which adds up as the carry bits are propagated, or ripple, from right to left. n One solution to the delay problem is the CARRY LOOKAHEAD ADDER. This adder breaks the implementation of the carry into two parts: the GENERATE, g part and the PROPAGATE, p.

1.3.5: Adders and Subtractors n FULL SUBTRACTORS are logic components that directly subtract two values. It has three inputs: two data inputs and a borrow input. n TWO’s COMPLEMENT can also be used to implement subtraction. Two’s complement of a value is the negative of that value. It is generated by complementing the value and adding 1.

1.3.6: MEMORY n MEMORY is a group of circuits used to store data. Although not strictly combinatorial in design, it can be used as combinatorial components in digital circuits. n A memory component has some number of memory locations, each of which stores a binary value of some fixed length. n The number of locations and the size of each location vary from memory chip to memory chip, but are fixed within an individual chip. n The size of the chip is denoted as the number of locations times the number of bits in each location. A memory chip of size 512 x 8 has 512 memory. n A memory chip with 2(n) locations requires n ADDRESS inputs., n The DATA pins on a memory chip are used to access the data.

1.3.6: Memory n The two primary classes of chips are: ROM(Read only memory) and RAM(Random access memory). n Data is programmed into the ROM chip using a separate ROM programmer. The circuit does not change the contents of the ROM. n PC’s use ROM to store the instructions that constitute their BIOS(Basic input/output system).When power is removed from a ROM chip, it still maintains its data. ROM is nonvolatile. n RAM is often referred to as read/write memory. Unlike ROM, it initially contains no data. Data can flow in to or out of the chip, as opposed to ROM, which are output only. RAM loses its data once power is removed; it is volatile.

Combinatorial Circuit Designs: n Many circuits can be designed using gates and components. Two of these designs are: BINARY CODED DECIMAL(BCD) to 7-segment decode and a simple DATA SORTER.

1.4.1: BCD to 7-segment Decoder n BCD(Binary coded decimal) to 7-segment decoder is used in digital displays.It converts the binary representation of a decimal digit, 0000 to 1001 to the signals needed to show the digit on a 7-segment LED display. n This circuit is actually seven distinct circuits, one for each segment, a through g. The design process for each is the same. For many applications, it is preferable to use ACTIVE LOW display-that is, a 0 lights the display and a 1 blanks the display.

7-Segment LED display a f b e c g d Segment labels: Patterns:

1.4.2: Data Sorter n A simple DATA SORTER will input a 4-bit values and output them in descending order. The basic building block of this circuit is the compare-and- swap modules. It receives two data inputs and compares them using the 4-bit comparator.

Four-input data sorter max min max min max min max min X Y XYXY XYXY XYXY XYXY abab CdCd