Combinatorial RTL Components
|
|
|
- Martina Freeman
- 6 years ago
- Views:
Transcription
1 Principles Of Digital Design Combinatorial RTL Components Computation and Reorganization Arithmetic and Comparison Components Logic Components election Components ncoding/decoding Components Bit manipulation Copyright 2-23 by Daniel D. Gajski C 3/C3, University of California, Irvine
2 Digital RTL Components Digital components are divided into Combinatorial components asy to design, partition, and test n inputs Combinatorial Logic Circuit (Logic Gates) m outputs outputs = f (inputs) equential components n inputs Combinatorial Logic Circuit (Logic Gates) m outputs Memory outputs = f (inputs, time) Copyright 2-23 by Daniel D. Gajski 2 C 3/C3, University of California, Irvine
3 Combinatorial RTL Components Data Transformation Components Arithmetic Operation (Add, ubtract, Multiply, Divide) Data Comparison (Greater-than, qual, Less-than, ) Logic Operation (AND, OR, NOT, ) Bit Manipulation (hift, Rotate, xtract, ) Interconnection Components ource and Destination election Bus Connections and Interface Data Conversion Components Data ncoding (Unary to Binary) Data Decoding (Binary to Unary) Copyright 2-23 by Daniel D. Gajski 3 C 3/C3, University of California, Irvine
4 Design Principles ncapsulation Define simple building blocks Iteration Replicate building blocks as much as possible Hierarchy Compose larger building blocks from smaller ones Copyright 2-23 by Daniel D. Gajski 4 C 3/C3, University of California, Irvine
5 Ripple-Carry (erial) Adder c out X Adder c x i y i c i c i + s i x i y i x i y i c i c i s i = x i y i c i c i + = x i y i + c i (x i y i ) x i y i Map Representation Graphic ymbol c i + g i p i c out c 7 c 6 c 5 c 4 FA FA FA FA FA FA FA FA c 3 c 2 c c c i FA Logic chematic s i 8-bit Adder Unit chematic Copyright 2-23 by Daniel D. Gajski 5 C 3/C3, University of California, Irvine
6 Ripple-Carry (erial) Adder c out X Adder c x i y i c i c i + s i x i y i x i y i c i c i s i = x i y i c i c i + = x i y i + c i (x i y i ) x i y i Map Representation Graphic ymbol c i + g i p i c out c 7 c 6 c 5 c 4 FA FA FA FA FA FA FA FA c 3 c 2 c c c i FA Logic chematic s i 8-bit Adder Unit chematic Copyright 2-23 by Daniel D. Gajski 6 C 3/C3, University of California, Irvine
7 Two s Complement Adder/ubtractor Two s complement subtraction A B = A + B + ubtraction Procedure Complement B et input carry to Add to A c out A B Adder/ubtrator F Graphic ymbol a 7 b 7 a 6 b 6 a 5 b 5 a 4 b 4 a 3 b 3 a 2 b 2 a b a b Function Comment A + B Addition A + B + ubtraction c out FA FA FA FA FA FA FA FA f 7 f 6 f 5 f 4 f 3 f 2 f f 8-bit Adder/ubtractor Unit chematic Copyright 2-23 by Daniel D. Gajski 7 C 3/C3, University of California, Irvine
8 6-Function Logic Unit () Boolean functions of two variables have two inputs, one output, and four minterms. There are 6 Boolean functions of four variables (4 control lines) x i y i x i y i f f f 2 f 3 f 4 f 5 f 6 f 7 f 8 f 9 f f f 2 f 3 f 4 f 5 m m m 2 2 m m 3 m 2 m m Boolean Function of 2 Variables s i = m + m + 2 m m 3 = x i y i + x i y i + 2 x i y i + 3 x i y i LU -bit slice for 6-function LU s i Copyright 2-23 by Daniel D. Gajski 8 Logic chematic C 3/C3, University of California, Irvine
9 6-Function Logic Unit (2) Boolean functions of two variables have two inputs, one output, and four minterms. There are 6 Boolean functions of four variables (4 control lines) x 7 y 7 x 6 y 6 x 5 y 5 x 4 y 4 x 3 y 3 x 2 y 2 x y x y 2 3 X 2 3 Logic Unit LU LU LU LU LU LU LU LU F s 7 s 6 s 5 s 4 s 3 s 2 s s Graphic ymbol 8-bit Logic Unit chematic s i = m + m + 2 m m 3 = x i y i + x i y i + 2 x i y i + 3 x i y i Copyright 2-23 by Daniel D. Gajski 9 C 3/C3, University of California, Irvine
10 2-bit Magnitude Comparator G = when X >, L = when X <, G = L = when X =. x x y y x x y y x x y y G L Copyright 2-23 by Daniel D. Gajski G Map G = x y + x y y + x x y L = x y + x x y + x y y Boolean quations G L Logic chematic x y x y C 3/C3, University of California, Irvine L Map
11 8-bit Magnitude Comparator Larger magnitude comparators can be constructed from basic 2-bit comparators using the following equations G i = (x i > y i ) OR ((x i = y i ) AND (G i > L i )) L i = (x i < y i ) OR ((x i = y i ) AND (G i < L i )) x 7 y 7 x 6 y 6 x 5 y 5 x 4 y 4 x 3 y 3 x 2 y 2 x y x y x 7 y 7 x 6 y 6 x 5 y 5 x 4 y 4 x 3 y 3 x 2 y 2 x y x y G L G L G L G L G 7 L 7 G L G 6 L 6 L L 5 L L 4 L L 3 L L 2 L L G G 5 G G 4 G G 3 G G 2 G G G L G L G L erial Implementation (n comparator delays) G L G 7 L 7 Parallel Implementation (log(n) comparator delays) Copyright 2-23 by Daniel D. Gajski C 3/C3, University of California, Irvine
12 2-to- elector electors (Multiplexers) are used for selecting one of many sources of data D D D D Graphic ymbol elector D D Boolean xpression = D + D Logic chematic Copyright 2-23 by Daniel D. Gajski 2 C 3/C3, University of California, Irvine
13 4-to- elector D 3 D 2 D D Graphic ymbol D 3 D 2 D D 3 2 elector D D D 2 D 3 = D + D + D 2 + D 3 Boolean xpression Logic chematic Copyright 2-23 by Daniel D. Gajski 3 C 3/C3, University of California, Irvine
14 8-to- elector 2 D D D 2 D 3 D 4 Implementation with 2-to- electors D 5 D 6 D 7 Implementation with 3-to-8 Decoder D 7 D 6 D 5 D 4 D 3 D 2 D D D 7 D 6 D 5 D 4 D 3 D 2 D D 2 Decoder Copyright 2-23 by Daniel D. Gajski 4 C 3/C3, University of California, Irvine
15 8-to- elector 2 D D D 2 D 3 D 4 Implementation with 2-to- electors D 5 D 6 D 7 Implementation with 3-to-8 Decoder D 7 D 6 D 5 D 4 D 3 D 2 D D D 7 D 6 D 5 D 4 D 3 D 2 D D Decoder Copyright 2-23 by Daniel D. Gajski 5 C 3/C3, University of California, Irvine
16 Bus Implementation Bus drivers have three possible output values:,, and Z (High Impedance Disconnection) D Z D Decoder 3 2 D D D 2 Tristate Driver ymbol D D 3 D D D D 2 D D 3 D 2-input Bus 4-input Bus Copyright 2-23 by Daniel D. Gajski 6 C 3/C3, University of California, Irvine
17 8-bit hifter -bit left or right shift or rotation Function Table 2 Comment X D No hift X Not Used shl(d) hift Left rtl(d) Rotate Left shr(d) hift Right rtr(d) Rotate Right hifter Implemented with 4-to- electors d 7 d 6 d 5 d 4 d 3 d 2 d d Right Input Left Input elector elector 3 2 elector elector elector elector elector elector elector elector y 7 y 6 y 5 y 4 y 3 y 2 y y Copyright 2-23 by Daniel D. Gajski 7 C 3/C3, University of California, Irvine
18 8-bit hifter (xample) -bit left or right shift or rotation Function Table 2 Comment X D No hift X Not Used shl(d) hift Left rtl(d) Rotate Left shr(d) hift Right rtr(d) Rotate Right hifter Implemented with 4-to- electors d 7 d 6 d 5 d 4 d 3 d 2 d d X X elector elector 3 2 elector elector elector elector elector elector elector elector y 7 y 6 y 5 y 4 y 3 y 2 y y Copyright 2-23 by Daniel D. Gajski 8 C 3/C3, University of California, Irvine
19 8-bit Right Rotator Right rotation from to 7 bit position d 7 d 6 d 5 d 4 d 3 d 2 d d 2 y 7 y 6 y 5 y 4 y 3 y 2 y y d 7 d 6 d 5 d 4 d 3 d 2 d d d d 7 d 6 d 5 d 4 d 3 d 2 d d d d 7 d 6 d 5 d 4 d 3 d 2 d 2 d d d 7 d 6 d 5 d 4 d 3 d 3 d 2 d d d 7 d 6 d 5 d 4 d 4 d 3 d 2 d d d 7 d 6 d 5 d 5 d 4 d 3 d 2 d d d 7 d 6 d 6 d 5 d 4 d 3 d 2 d d d 7 2 y 7 y 6 y 5 y 4 y 3 y 2 y y Rotator Implemented with 2-to- electors Copyright 2-23 by Daniel D. Gajski 9 C 3/C3, University of California, Irvine
20 8-bit Right Rotator (xample) Right rotation from to 7 bit position d 7 d 6 d 5 d 4 d 3 d 2 d d 2 y 7 y 6 y 5 y 4 y 3 y 2 y y d 7 d 6 d 5 d 4 d 3 d 2 d d d d 7 d 6 d 5 d 4 d 3 d 2 d d d d 7 d 6 d 5 d 4 d 3 d 2 d 2 d d d 7 d 6 d 5 d 4 d 3 d 3 d 2 d d d 7 d 6 d 5 d 4 d 4 d 3 d 2 d d d 7 d 6 d 5 d 5 d 4 d 3 d 2 d d d 7 d 6 d 6 d 5 d 4 d 3 d 2 d d d 7 y 7 y 6 y 5 y 4 y 3 y 2 y y Rotator Implemented with 2-to- electors Copyright 2-23 by Daniel D. Gajski 2 C 3/C3, University of California, Irvine
21 -to-2 Decoder Decoders are used for enabling one or more components A A A C C Decoder C C Graphic ymbol X C = A C = A Copyright 2-23 by Daniel D. Gajski Boolean xpression 2 C C Logic chematic C 3/C3, University of California, Irvine
22 2-to-4 Decoder A A C 3 C 2 C C A A Graphic ymbol Decoder 3 2 X X C 3 C 2 C C A A Boolean xpression C = A A C = A A C 2 = A A C 2 = A A Logic chematic C 3 C 2 C C Copyright 2-23 by Daniel D. Gajski 22 C 3/C3, University of California, Irvine
23 2-to-4 Decoder (xample) A A C 3 C 2 C C A A Graphic ymbol Decoder 3 2 X X C 3 C 2 C C Boolean xpression C = A A C = A A C 2 = A A C 2 = A A Logic chematic Copyright 2-23 by Daniel D. Gajski 23 C 3/C3, University of California, Irvine
24 3-to-8 Decoder A 2 A A C 7 C 6 C 5 C 4 C 3 C 2 C C Larger decoders can be built as a tree of smaller decoders Graphic ymbol A 2 A A Decoder C 7 C X X X A 2 A A A 2 A A C 7 C 6 C 5 C 4 Implementation with 2-to-4 Decoders Copyright 2-23 by Daniel D. Gajski C 3 C 2 C C 24 C 7 C 6 C 5 C 4 C 3 C 2 C C Implementation with -to-2 Decoders C 3/C3, University of California, Irvine
25 3-to-8 Decoder A 2 A A C 7 C 6 C 5 C 4 C 3 C 2 C C Larger decoders can be built as a tree of smaller decoders Graphic ymbol A 2 A A Decoder C 7 C X X X C 7 C 6 C 5 C 4 C 3 C 2 C C Implementation with 2-to-4 Decoders Copyright 2-23 by Daniel D. Gajski 25 C 7 C 6 C 5 C 4 C 3 C 2 C C Implementation with -to-2 Decoders C 3/C3, University of California, Irvine
26 2-to- Priority ncoder ncoder is opposite of decoder, but with priority for MB D D D D ncoder Any A Graphic ymbol D D A Any X A = D Any = D + D Any A Boolean xpression Logic chematic Copyright 2-23 by Daniel D. Gajski 26 C 3/C3, University of California, Irvine
27 4-to-2 Priority ncoder D 3 D 2 D D 3 2 ncoder D 2 D D 3 D Any A A Graphic ymbol D 3 D 2 D D A A Any X X X X X X A = D 2 D + D 3 A = D 2 + D 3 Any = D + D + D 2 + D 3 Boolean xpression Any A Logic chematic A Copyright 2-23 by Daniel D. Gajski 27 C 3/C3, University of California, Irvine
28 8-to-3 Priority ncoder Larger encoders can be built from smaller encoders and selectors Implementation with 2-to- ncoders and electors D 7 D 6 D 5 D 4 D 3 D 2 D D A 2 A A Any X X X X X X X X X X X X X X X X X X X X X X X X X X X X Implementation with 4-to-2 ncoder D 7 D 6 D 5 D 4 D 3 D 2 D D D 7 D 6 D 5 D 4 D 3 D 2 D D ncoder ncoder ncoder ncoder ncoder ncoder ncoder elector ncoder elector ncoder elector elector ncoder elector elector Any A 2 Copyright 2-23 by Daniel D. Gajski A A 28 Any A 2 A A C 3/C3, University of California, Irvine
29 8-to-3 Priority ncoder Larger encoders can be built from smaller encoders and selectors Implementation with 2-to- ncoders and electors D 7 D 6 D 5 D 4 D 3 D 2 D D A 2 A A Any X X X X X X X X X X X X X X X X X X X X X X X X X X X X Implementation with 4-to-2 ncoder ncoder ncoder ncoder ncoder ncoder ncoder ncoder elector ncoder elector ncoder elector elector ncoder elector elector Copyright 2-23 by Daniel D. Gajski 29 C 3/C3, University of California, Irvine
30 Combinatorial RTL ummary Described basic combinatorial RTL components: Adders ubtractors Logic Units Decoders electors Buses ncoders Comparators hifters Presented design for combinatorial components Discussed procedures for building larger components from smaller ones Copyright 2-23 by Daniel D. Gajski 3 C 3/C3, University of California, Irvine
Combinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS
CHAPTR VI- CHAPTR VI CHAPTR VI BUILDING BLOCKS R.M. Dansereau; v.. CHAPTR VI- COMBINAT. LOGIC INTRODUCTION -INTRODUCTION Combinational logic Output at any time is determined completely by the current input.
Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS
CHAPTR VI- CHAPTR VI CHAPTR VI BUILDING BLOCKS R.M. Dansereau; v.. CHAPTR VI- COMBINAT. LOGIC INTRODUCTION -INTRODUCTION Combinational logic Output at any time is determined completely by the current input.
Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
Systems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego
CSE 4 Lecture Standard Combinational Modules CK Cheng and Diba Mirza CSE Dept. UC San Diego Part III - Standard Combinational Modules (Harris: 2.8, 5) Signal Transport Decoder: Decode address Encoder:
CSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Decoders, adders, comparators, multipliers and other ALU elements Tajana Simunic Rosing Mux, Demux Encoder, Decoder 2 Transmission Gate: Mux/Tristate
COMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
Chapter 5 Arithmetic Circuits
Chapter 5 Arithmetic Circuits SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} February 11, 2016 Table of Contents 1 Iterative Designs 2 Adders 3 High-Speed
14:332:231 DIGITAL LOGIC DESIGN
4:332:23 DIGITAL LOGIC DEIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 23 Lecture #4: Adders, ubtracters, and ALUs Vector Binary Adder [Wakerly 4 th Ed., ec. 6., p. 474] ingle
ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Law Combinational
ECE 2300 Digital Logic & Computer Organization
ECE 2300 Digital Logic & Computer Organization pring 201 More inary rithmetic LU 1 nnouncements Lab 4 prelab () due tomorrow Lab 5 to be released tonight 2 Example: Fixed ize 2 C ddition White stone =
CHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
ELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 5 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
Logic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]
![Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]](/thumbs/81/84077758.jpg "Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]")
Chapter 4: Combinational Logic Solutions to Problems: [, 5, 9, 2, 9, 23, 3, 33] Problem: 4- Consider the combinational circuit shown in Fig. P4-. (a) Derive the Boolean expressions for T through T 4. Evaluate
CprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Code Converters CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev HW
Sample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
Chapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
CSE140: Components and Design Techniques for Digital Systems. Logic minimization algorithm summary. Instructor: Mohsen Imani UC San Diego
CSE4: Components and Design Techniques for Digital Systems Logic minimization algorithm summary Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Definition
CprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Decoders and Encoders CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
Digital Logic Design ENEE x. Lecture 14
Digital Logic Design ENEE 244-010x Lecture 14 Announcements Homework 6 due today Agenda Last time: Binary Adders and Subtracters (5.1, 5.1.1) Carry Lookahead Adders (5.1.2, 5.1.3) This time: Decimal Adders
Boolean Logic Continued Prof. James L. Frankel Harvard University
Boolean Logic Continued Prof. James L. Frankel Harvard University Version of 10:18 PM 5-Sep-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. D Latch D R S Clk D Clk R S X 0 ~S 0 = R 0 ~R
XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
![XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.](/thumbs/81/84726747.jpg "XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.")
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 17 Encoders and Decoders Overview Binary decoders Converts an n-bit code to a single active output Can be developed using AND/OR gates Can
CprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
MODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
Digital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta
Digital System Design Combinational Logic Assoc. Prof. Pradondet Nilagupta pom@ku.ac.th Acknowledgement This lecture note is modified from Engin112: Digital Design by Prof. Maciej Ciesielski, Prof. Tilman
COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
Logic Design Combinational Circuits. Digital Computer Design
Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional
Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.
Combinational Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2010 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Combinational Circuits
IT T35 Digital system desigm y - ii /s - iii
UNIT - II Combinational Logic Adders subtractors code converters binary parallel adder decimal adder magnitude comparator encoders decoders multiplexers demultiplexers-binarymultiplier Parity generator
Arithmetic Circuits-2
Arithmetic ircuits-2 Multipliers Array multipliers hifters Barrel shifter Logarithmic shifter EE 261 Krish hakrabarty 1 Binary Multiplication X = Σ X i 2 i i=0 Multiplicand M-1 N-1 Y = Σ Y i 2 i i=0 Multiplier
Design of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
Review for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
Digital Design. Digital Design
Principles Of Digital Design Chapter 3 Boolean Algebra and Logic Design Boolean Algebra Logic Gates Digital Design Implementation Technology ASICs Gate Arrays Basic Algebraic Properties A set is a collection
COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri
COMBINATIONAL LOGIC CIRCUITS Dr. Mudathir A. Fagiri Standard Combinational Modules Decoder: Decode address Encoder: Encode address Multiplexer (Mux): Select data by address Demultiplexier (DeMux): Direct
Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
Hardware Design I Chap. 4 Representative combinational logic
Hardware Design I Chap. 4 Representative combinational logic E-mail: shimada@is.naist.jp Already optimized circuits There are many optimized circuits which are well used You can reduce your design workload
Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
Carry Look Ahead Adders
Carry Look Ahead Adders Lesson Objectives: The objectives of this lesson are to learn about: 1. Carry Look Ahead Adder circuit. 2. Binary Parallel Adder/Subtractor circuit. 3. BCD adder circuit. 4. Binary
Arithmetic Circuits Didn t I learn how to do addition in the second grade? UNC courses aren t what they used to be...
rithmetic Circuits Didn t I learn how to do addition in the second grade? UNC courses aren t what they used to be... + Finally; time to build some serious functional blocks We ll need a lot of boxes The
CPS 104 Computer Organization and Programming Lecture 11: Gates, Buses, Latches. Robert Wagner
CPS 4 Computer Organization and Programming Lecture : Gates, Buses, Latches. Robert Wagner CPS4 GBL. RW Fall 2 Overview of Today s Lecture: The MIPS ALU Shifter The Tristate driver Bus Interconnections
CMP 334: Seventh Class
CMP 334: Seventh Class Performance HW 5 solution Averages and weighted averages (review) Amdahl's law Ripple-carry adder circuits Binary addition Half-adder circuits Full-adder circuits Subtraction, negative
Chapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction
Chapter 5 igital systems digital system is any machine that processes information encoded in the form of digits. Modern digital systems use binary digits, encoded as voltage levels. Two voltage levels,
Fundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
Adders - Subtractors
Adders - Subtractors Lesson Objectives: The objectives of this lesson are to learn about: 1. Half adder circuit. 2. Full adder circuit. 3. Binary parallel adder circuit. 4. Half subtractor circuit. 5.
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS 1 SPECIFICATION OF ADDER MODULES FOR POSITIVE INTEGERS HALF-ADDER AND FULL-ADDER MODULES CARRY-RIPPLE AND CARRY-LOOKAHEAD ADDER MODULES NETWORKS OF ADDER MODULES
Unit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
Spiral 2-1. Datapath Components: Counters Adders Design Example: Crosswalk Controller
2-. piral 2- Datapath Components: Counters s Design Example: Crosswalk Controller 2-.2 piral Content Mapping piral Theory Combinational Design equential Design ystem Level Design Implementation and Tools
Logic and Computer Design Fundamentals. Chapter 5 Arithmetic Functions and Circuits
Logic and Computer Design Fundamentals Chapter 5 Arithmetic Functions and Circuits Arithmetic functions Operate on binary vectors Use the same subfunction in each bit position Can design functional block
Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.
Combinational Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Combinational Circuits
Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu
Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu Temple University Gate Delay ((1.1).1) ((1.0).0) ((0.1).1) ((0.1).0) ((1.1) = 1 0 s = sum c out carry-out a, b = added bits C = carry in a
University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.
Final Examination Instructor: Shawki M. Areibi Co-examiner: Medhat Moussa. Location: UOG Date: Wednesday, December 5th, 2007 Time: 8:30-10:30 AM Duration: 2 hours. Type: R Closed Book. Instructions: University
Class Website:
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #5 Instructor: Andrew B. Kahng (lecture) Email: abk@ece.ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office:
CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays
CMSC 33 Lecture 8 Midterm Exam returned ssign Homework 3 Circuits for ddition Digital Logic Components Programmable Logic rrays UMC, CMSC33, Richard Chang Half dder Inputs: and Outputs:
Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
Chapter 03: Computer Arithmetic. Lesson 03: Arithmetic Operations Adder and Subtractor circuits Design
Chapter 03: Computer Arithmetic Lesson 03: Arithmetic Operations Adder and Subtractor circuits Design Objective To understand adder circuit Subtractor circuit Fast adder circuit 2 Adder Circuit 3 Full
Combinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
Combina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Combina-onal Logic Chapter 4 EECE 256 Dr. Sidney Fels Steven Oldridge Topics Combina-onal circuits Combina-onal analysis Design procedure simple combined to make complex adders, subtractors, converters
Bit-Sliced Design. EECS 141 F01 Arithmetic Circuits. A Generic Digital Processor. Full-Adder. The Binary Adder
it-liced Design Control EEC 141 F01 rithmetic Circuits Data-In Register dder hifter it 3 it 2 it 1 it 0 Data-Out Tile identical processing elements Generic Digital Processor Full-dder MEMORY Cin Full adder
Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
Floating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
Design of Combinational Logic
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NASHIK 3. Design of Combinational Logic By Prof. Anand N. Gharu (Assistant Professor) PVGCOE Computer Dept.. 30 th June 2017 CONTENTS :- 1. Code Converter
Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
Review. EECS Components and Design Techniques for Digital Systems. Lec 18 Arithmetic II (Multiplication) Computer Number Systems
Review EE 5 - omponents and Design Techniques for Digital ystems Lec 8 rithmetic II (Multiplication) David uller Electrical Engineering and omputer ciences University of alifornia, Berkeley http://www.eecs.berkeley.edu/~culler
Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education
MEC5 디지털공학 Combinational Logic Jee-Hwan Ryu School of Mechanical Engineering Combinational circuits Outputs are determined from the present inputs Consist of input/output variables and logic gates inary
LOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
Sequential logic and design
Principles Of Digital Design Sequential logic and design Analysis State-based (Moore) Input-based (Mealy) FSM definition Synthesis State minimization Encoding Optimization and timing Copyright 20-20by
Digital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.
DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS AIM To design and implement encoders and decoders using logic gates. COMPONENTS REQUIRED S.No Components Specification Quantity 1. Digital IC Trainer
Chapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
UNIT II COMBINATIONAL CIRCUITS:
UNIT II COMBINATIONAL CIRCUITS: INTRODUCTION: The digital system consists of two types of circuits, namely (i) (ii) Combinational circuits Sequential circuits Combinational circuit consists of logic gates
Overview. Arithmetic circuits. Binary half adder. Binary full adder. Last lecture PLDs ROMs Tristates Design examples
Overview rithmetic circuits Last lecture PLDs ROMs Tristates Design examples Today dders Ripple-carry Carry-lookahead Carry-select The conclusion of combinational logic!!! General-purpose building blocks
Chap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
COSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
Lecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
Software Engineering 2DA4. Slides 8: Multiplexors and More
Software Engineering 2DA4 Slides 8: Multiplexors and More Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of Digital Logic
ELEN Electronique numérique
ELEN0040 - Electronique numérique Patricia ROUSSEAUX Année académique 2014-2015 CHAPITRE 3 Combinational Logic Circuits ELEN0040 3-4 1 Combinational Functional Blocks 1.1 Rudimentary Functions 1.2 Functions
ELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
ว ตถ ประสงค ของบทเร ยน
Logic Design with MSI Circuits ว ตถ ประสงค ของบทเร ยน ร จ กวงจรประเภท MSI เข าใจการทำงานของวงจร MSI ท ม ใช อย ท วไป สามารถประย กต ใช วงจร MSI ในการออกแบบวงจรลอจ กแบบต างๆ ได A. Yaicharoen 1 Type of Circuits
EECS150 - Digital Design Lecture 10 - Combinational Logic Circuits Part 1
EECS5 - Digital Design Lecture - Combinational Logic Circuits Part Feburary 26, 22 John Wawrzynek Spring 22 EECS5 - Lec-cl Page Combinational Logic (CL) Defined y i = f i (x,...., xn-), where x, y are
Digital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Arithmetic Circuits January, 2003 1 A Generic Digital Processor MEM ORY INPUT-OUTPUT CONTROL DATAPATH
Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
Menu. 7-Segment LED. Misc. 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU
Menu 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU Look into my... 1 7-Segment LED a b c h GND c g b d f a e h Show 7-segment LED in LogicWorks,
UNIVERSITY OF CALIFORNIA, RIVERSIDE
Final Page of UNIVERITY OF CLIFORNI, RIVERIDE Computer cience Department and Electrical Engineering Department C/EE20 Logic Design Final December, 2000 50 Name: olution Key tudent ID#: Please print legibly
ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture A Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Laws
vidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COMBINATIONAL LOGIC DESIGN: ARITHMETICS (THROUGH EXAMPLES) 2016/2017 COMBINATIONAL LOGIC DESIGN:
Digital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
Midterm Exam Two is scheduled on April 8 in class. On March 27 I will help you prepare Midterm Exam Two.
Announcements Midterm Exam Two is scheduled on April 8 in class. On March 27 I will help you prepare Midterm Exam Two. Chapter 5 1 Chapter 3: Part 3 Arithmetic Functions Iterative combinational circuits
CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays
MS 33 Lecture 8 Midterm Exam returned Assign Homework 3 ircuits for Addition Digital Logic omponents Programmable Logic Arrays UMB, MS33, Richard hang MS 33, omputer Organization & Assembly
Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR
TOPIS: Logic Logic Expressions Logic Gates Simplifying Logic Expressions Sequential Logic (Logic with a Memory) George oole (85-864), English mathematician, oolean logic used in digital computers since
CSEE 3827: Fundamentals of Computer Systems. Combinational Circuits
CSEE 3827: Fundamentals of Computer Systems Combinational Circuits Outline (M&K 3., 3.3, 3.6-3.9, 4.-4.2, 4.5, 9.4) Combinational Circuit Design Standard combinational circuits enabler decoder encoder
Digital Integrated Circuits A Design Perspective
rithmetic ircuitsss dapted from hapter 11 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 Generic Digital Processor MEMORY INPUT-OUTPUT ONTROL