Digital Design. Register Transfer Specification And Design
|
|
- Blaise Palmer
- 5 years ago
- Views:
Transcription
1 Principles Of Digital Design Chapter 8 Register Transfer Specification And Design
2 Chapter preview Boolean algebra 3 Logic gates and flip-flops 3 Finite-state machine 6 Logic design techniques 4 Sequential design techniques 6 Binary system and data representation 2 Combinational components 5 Storage components 7 Generalized finite-state machines 8 Register-transfer design 8 Processor components 9 2
3 Register-transfer transfer design Each standard or custom IC consists of one or more datapaths and control units. To synthesize such IC we introduce the model of a FSM with a datapath (FSMD). We demonstrate synthesis algorithms for FSMD model, including component selection, resource sharing, pipelining and scheduling. 3
4 Example 7. 4
5 Design Model Control inputs Control unit Control signals Status signals Datapath inputs Datapath Control inputs Control outputs Datapath outputs High-level block diagram Datapath inputs D Q Control signals Control unit Nextstate logic. D Q. D Q State register. Output logic Status signals Register Control Datapath outputs outputs Register-transfer-level block diagram 5 RF ALU */ Register Mem Bu Bu Bus 3 Datapath
6 Ones-counter specification Data Mask Temp Ocount Start = Start = Done=; Data = Input Done=; Ocount = Done=; Mask = Done=; Temp = Data AND Mask Data = Done=; Ocount = Ocount + Temp Data = 6 Done=; Data = Data >> Done=; Output =Ocount
7 FSDM Definition In Chapter 6 we defined an FSM as a quintuple < S, I, O, f, h > where S is a set of states, I and O are the sets of input and output symbols: f : S I S, and h : S I O More precisely, I = A A2 Ak S = Q Q2 Qm O = Y Y2 Yn Where Ai, i k, is an input signal, Qi, i m is the flip-flop output and Yi, i n is an output signal. To define a FSMD, we define a set of variables V = V V2 Vq which defines the state of the datapath by defining the values of all variables in each state. = U U{ ( W ) W } { V V { p f }} = = = I= I I C D where IC = A A2 Ak as before and ID = B B2 Bp, O= O O C D Where OC = Y Y2 Yn as before and OD = Z Z2 Zr. 7
8 FSDM Definition With formal definition of expressions and relations over a set of variables we can simplify function f : ( S V ) I S V by separating it into two parts: fc and fd. The function fc defines the next state of the control unit fc : S IC STAT S while the function fd defines the values of datapath variables in the next state fd : S V ID V Also, and fd :={fdi : V ID V : { Vj =ej Vj V, ej Expr ( V ID )}} hc : S IC STAT OC hd : S V ID OD 8
9 FSMD specification of Ones-counter Next state Control Datapath Present Datapath Variables (Start. Data=) Output output State Done Outport Data Ocount Temp Mask Z s 3 s 6 s 7 s 7 s 7 s 3 s 3 s 3 s 3 s 6 s 6 s 6 s 6 Z Inport Z Data Z Data Ocount Z Data Ocount Data AND Mask Mask Z Data Ocount+Temp Mask Z Data>> Ocount Mask Ocount Data Ocount Next state Control Datapath Present (Start. Data=) Output output Data Variables State Done Outport Z Z Data = Inport s s s 3 s s 3 Z Ocount = s 3 Z Mask = Z Temp = Data AND Mask s 6 s 7 s 6 s 6 s 6 s 6 s 7 s 7 Z Ocount = Ocount + Temp Z Data = Data >> Ocount State and output table Present Next state State condition state Start = Start = Data = s 3 s 3 s 6 s 7 [ [ Data s 6 s 7 ] ] Control and Datapath actions condition actions Done = Data = Inport Ocount = Mask = Temp = Data AND Mask Ocount = Ocount + Temp [ Data = Data >> Done = Data = Inport ] State and output table with variable assignments 9 State-action table
10 Algorithmic-State State-Machine Graphic representation of FSMD model Equivalent to state-action table Similar to a flowchart used for program description
11 Name State box ASM Symbols Definition Example Decision Box Condition Box ASM Block
12 ASM rules Rule : The chart must define a unique next state for each state and set of conditions. Rule 2: Every path defined by the network of condition boxes must lead to another state. ASM block ASM block cond cond2 cond cond2 s 3 s 3 Undefined next state 2 Undefined exit path
13 ASM chart for Ones-counter (a) State-based (Moore) chart (b) Input-based (Mealy) chart 3
14 State-action action tables for Ones-counter State-based table Present State Q 2 Q Q Name s 3 Next state Condition Start =, Start =, Data LSR =, Data LSR =, Data, Data =, State s 3 4 Datapath actions condition Operations Done = Data = Inport Ocount = Ocount = Ocount + Data = Data >> Done = Output = Ocount = = + + = + + = = + + = + + = = + + = + + = = = + = + = = = = = = =
15 State-action action tables for Ones-counter Input-based table Present State Q Q Name s 3 [ [ Next state Condition State Start =, ] Start =, Data =, Data =, = = + = + = = + = + Datapath actions condition Operations Done = Data = Inport Ocount = Data LSR =, Ocount = Ocount + ] [ s 3 Data =, Data = Data >> Done = [ ] Output = Ocount [ ] ] = = = = + = + = = = = = = = 5
16 Logic schematics for Ones-counter D 2 = Q 2 (next) = Data LSB + S 3 + S 4 (Data ) = Q Q Data LSB + Q Q + Q 2 Q (Data ) D = Q (next) = + Data LSB + (Data ) = Q 2 Q Q + Q Q Data LSB + Q 2 Q (Data ) D = Q (next) = Start + Data LSB + (Data ) = Q 2 Q Q Start+Q Q Data LSB +Q 2 Q (Dara ) S = =Q 2 Q S = + = Q Q + Q 2 Q E = s 3 = Q Q Load = = Q 2 Q Q Done = Output enable = = Q 2 Q State-based version 6
17 Logic schematics for Ones-counter D = Q ( next ) = + = Q Q + Q Q D = Q ( next ) = Start + ( Data ) = Q Q Start + Q Q ( Data ) S = ( Data ) = Q Q ( Data ) S = + ( Data ) = Q Q + Q Q ( Data ) E = Data LSB = Q Q Data LSB Load = = Q Q Done = Output enable = s 3 = Q Q Input-based version 7
18 Register-transfer transfer synthesis Block diagram Register sharing a = In b = In 2 s 3 Start t = a t 2 = b x = max( t, t 2 ) y = min ( t, t 2 ) t 3 = x >> 3 t 4 = y >> t 5 = x t 3 Functional unit sharing Bus sharing t 6 = t 4 + t 5 s 6 t 7 = max ( t 6, x ) s 7 ASM Chart of Square-root approximation Done = Out = t 7 8
19 Resource usage in square-root root Block diagram a = In b = In 2 s 3 s 6 s 7 Start t = a t 2 = b x = max( t, t 2 ) y = min ( t, t 2 ) t 3 = x >> 3 t 4 = y >> t 5 = x t 3 t 6 = t 4 + t 5 t 7 = max ( t 6, x ) Done = Out = t 7 ASM Chart of Square-root approximation approximation max No. of operations 9 abs min >> - + a b t t 2 x y t 3 t 4 t 5 t 6 t 7 No. of live variables s 3 s Variable usage 3 Operation usage s 6 2 s 6 s 7 s 7 Max. no. of units 2 2
20 (a) Absolute value unit (version ) Simple library components b Sign bit Subtractor Sign bit b Subtractor b (b) Absolute value unit (version 2) a b b a b b a b Subtractor Subtractor Subtractor Sign bit Sign bit min/max control Sign bit (c) Min unit (d) Max unit (e) Min/Max unit a a>> (f) -bit right shifter (g) 3-bit right shifter (h) -bit/3-bit right shifter a Min(a,b) Adder a+b b Adder a Max(a,b) a a>>3 a-b b Shift control add/sub control min/max(a,b) (i) Adder (j) Subtractor (k) Adder/Subtractor >> a a a>>3/a>> Adder a+b/a-b >>3 b 2
21 Connectivity requirements Block diagram a = In b = In 2 abs a b t t 2 x y t 3 t 4 t 5 t 6 t 7 Start abs2 s 3 t = a t 2 = b x = max( t, t 2 ) y = min ( t, t 2 ) t 3 = x >> 3 t 4 = y >> min max >>3 >> t 5 = x t 3 - t 6 = t 4 + t 5 + s 6 t 7 = max ( t 6, x ) Connectivity table s 7 ASM Chart of Square-root approximation Done = Out = t 7 2
22 Register sharing (Variable merging) Grouping of variables with nonoverlaping lifetimes Each group shares one register Grouping reduces number of registers needed in the design Two algorithms: left-edge edge graph-partitioning partitioning 22
23 Left-edge edge algorithm 23
24 Register sharing by left-edge edge algorithm a b t t 2 x y t 3 t 4 t 5 t 6 t 7 s 3 s 6 Sorted list of variables s 7 R = {a, t, x, t7} R2 = {b, t2, y, t4, t6} R3 = {t2, t5 } Register assignments a = In b = In 2 s 3 Start t = a t 2 = b x = max( t, t 2 ) y = min ( t, t 2 ) t 3 = x >> 3 t 4 = y >> t 5 = x t 3 t 6 = t 4 + t 5 s 6 t 7 = max ( t 6, x ) s 7 Done = Out = t 7 Datapath schematic 24 ASM Chart
25 Merging variables with common sources and destination a c b d a, c b, d s i x = a + b s j y = c + d + + x y x, y Partial ASM Chart Datapath without register sharing Datapath with register sharing 25
26 Graph partitioning algorithm / (a) Initial compatibility graph Start Create compatibility graph Merge highest priority nodes Upgrade compatibility graph no All nodes incompatible yes Stop 26
27 Graph partitioning algorithm for SRA / (a) Initial compatibility grah a = In b = In 2 (b) Compatibility graph after merging t 3, t 5 and t 6 Start t = a t 2 = b x = max( t, t 2 ) y = min ( t, t 2 ) (c) Compatibility graph after merging t, x and t 7 s 3 t 3 = x >> 3 t 4 = y >> t 5 = x t 3 (d) Compatibility graph after merging t 2 and y s 6 t 6 = t 4 + t 5 t 7 = max ( t 6, x ) (e) Final compatibility graph 27 s 7 Done = Out = t 7 ASM Chart
28 Register assignment generated by the graph-partitioning partitioning algorithm R = [ a, t, x, t7 ] R2 =[b, t2, y, t3, t5, t6 ] R3= [ t4 ] Register assignments Datapath 28
29 Functional unit sharing (operator merging) Group non-concurrent operations Each group shares one functional unit Sharing reduces number of functional units Prioritized grouping by reducing connectivity Clustering algorithm used for grouping 29
30 Functional unit sharing Partial ASM Chart Non-shared design Shared design 3
31 Complex library components c c Operation absolute minimum c c Operation addition minimum maximum subtraction maximum Unit for computing minimum, maxmum and absolute value Unit for computing addition, subtraction, minimum and maximum c c Operation addition absolute c 2 c c Operation addition absolute subtraction subtraction minimum maximum Unit for computing addition, subtraction, and absolute value 3 Unit for computing addition, subtraction, minimum, maximum and absolute value
32 Operator merging for SRA implementation Compunoent AND Invert Logic Logic Unit a E-OR Adder Logic b (a) Compatibiltity graph min max + - Total (b) Cost table (c) Merging altermative Compunoent AND Unit Logic [ a /min] [ b /max/+/-] Invert E-OR Adder Logic Logic 2 2 ASM Chart (e) Merging altermative32 Total Compunoent AND Unit Logic (d) Cost table Invert E-OR Adder Logic Logic [ a /min/+] 2 [ b /max/+] 2 Total (f) Cost table
33 Datapath connectivity R R 2 R 3 [ abs/min] [ abs/max/+/- ] >> >>3 (a) Datapath schematic for unit allocation from figure 8.22 (c) R R 2 R 3 [ abs/min/+] [ abs/max/- ] >> >>3 ASM Chart (b) Datapath schematic for unit allocation from figure 8.22 (e) 33
34 Priorities in unit merging a, c b, d a, c b, d s i x = a + b s j y = c + d + - x, y +/- x, y (a) Partial ASM Chart (b) Design without merged units (c) Design with merged units 34
35 Unit merging for SRA datapath (a) Compatibility graph (b) Compatibility graph after merging of + and _ (c) Compatibility graph after merging of min, + and _ (d) Final graph partitions 35 ASM Chart
36 SRA datapath generated by prioritized partitioning AU R = [ a, t, x, t 7 ] = [ b / min / + / - ] R 2 = [ b, t 2, y, t 3, t 5, t 6 ] AU 2 = [ a / max /] R 3 = [ t 4 ] SH = [ >> ] SH 2 = [ >>3 ] (a) Register and functional unit allocation R R 2 R 3 [ abs/max] [ abs/min/+/- ] >> >>3 (b) Datapath schematic 36
37 Bus sharing ( connection merging ) Group connections that are not used concurrectly Each group forms a bus Connection merging reduces number of wires Clustering algorithm is demonstrated 37
38 Connection merging in SRA datapath In In 2 M N R R 2 R 3 A B C D E F G H >> >>3 [ abs/max] K L [ abs/min/+/- ] I J Out (a) Datapath for SRA Bus = [ A, C, D, E, H ] Bus2 = [ B, F, G ] Bus3= [ I, K, M ] Bus4 = [ J, L, N ] (e) Bus assignment A B C D E F G H I J K L M N s 3 s 6 (b) Connectivity usage table s 7 (c) Compatibility graph for input buses 38 (d) Compatibility graph for output buses
39 Connection merging in SRA datapath In In 2 M N R R 2 R 3 A B C D E F G H >> >>3 [ abs/max] K L [ abs/min/+/- ] I J Out Datapath for SRA Bus = [ A, C, D, E, H ] Bus2 = [ B, F, G ] Bus3= [ I, K, M ] Bus4 = [ J, L, N ] Bus assignment R R 2 R 3 Bu Bu [ abs/min] [ abs/max/+/- ] >> >>3 Bus 3 Bu (f) Bus oriented datapath 39
40 Register merging Group register with nonoverlapping accesses Each group assigned to one register file Register grouping reduces number of ports, and therefore number of buses Demonstration with clustering algorithm 4
41 Register merging R = In R 2 = In2 Start R = [ a, t, x, t 7 ] R 2 = [ b, t 2, y, t 3, t 5, t 6 ] R 3 = [ t 4 ] R = R R 2 = R 2 (a) Register assignment R = max (R, R 2 ) R 2 = min (R, R 2 ) s 3 R 2 = R >> 3 R 3 = R 2 >> R R 2 R 3 s 3 s 6 s 7 R R 2 [ / ] R 3 R 2 = R -R 2 (b) Register access table (c) Compatibility graph R 2 = R 3 + R 2 s 6 R = max (R 2, R ) s 7 Done = Out = R ASM Chart 4 (d) Datapath schematic
42 Chaining and multicycling Chaining allows serial execution of two or more operations in each state Chaining reduces number of states and increases performance Multicycling allows one operation to be executed over two or more clock cycles Multicycling reduces size of functional units Chaining and multicycling are used on noncritical paths to improve resource utilization and performance 42
43 SRA datapath with chained units In In 2 a = In b = In 2 R R 2 R 3 Start = Bu Bu t = a t 2 = b [ abs/max] [ abs/min/+/- ] >>3 >> Bus 3 Bu x = max( t, t 2 ) t 3 = max( t, t 2 )>>3 t 4 = min ( t, t 2 )>> s 3 t 5 = x t 3 Out t 6 = t 4 + t 5 (b) Datapath schematic s 6 t 7 = max ( t 6, x ) Done = In 2 Out = t 7 (a) ASM Chart 43
44 SRA datapath with multicycle units a = In b = In 2 In In 2 Start = t = a t 2 = b x = max( t, t 2 ) t 3 = max( t, t 2 )>>3 t 4 = min ( t, t 2 )>> Bu Bu R R 2 R 3 [ abs/max] [ abs/+/- ] min s 3 t 5 = x t 3 Bus 3 >>3 >> Bu t 6 = t 4 + t 5 t 7 = max ( t 6, x ) Out (b) Datapath schematic s 6 Done = In 2 Out = t 7 (a) ASM Chart 44
45 Pipelining Pipelining improves performance at a very small additional cost Pipelining divides resources into stages and uses all stage concurrently for different data ( assembly line principle) Pipelining principles works on several levels: (a) Units pipelining (b) Control pipelining (c) Datapath pipelining 45
46 Pipelined arithmetic unit c 2 c c latches Adder sign bit 46
47 SRA datapath with single AU a = In b = In 2 Start = t = a t 2 = b x = max( t, t 2 ) t 3 = max( t, t 2 )>>3 [t 4 ] = min ( t, t 2 )>> s 3 t 5 = x t 3 t 4 = [min ( t, t 2 )>>] s 6 t 6 = t 4 + t 5 t 7 = max ( t 6, x ) Done = In 2 Out = t 7 (b) Datapath schematic (a) ASM Chart 47
48 Datapath with pipelined functional unit In In 2 Bu Bu R R 2 R 3 2-stage AU Bus 3 Bu >>3 >> Out (a) Datapath with pipelined AU Read R t 7 t 6 a t t x x 2 Read R 2 b t 2 t 2 t 3 t 5 Read R 3 AU stage a b max min - + max AU stage 2 a b max min - + max t 7 t 6 shifters >>3 >> Write R a t x Write R 2 b t 2 t 3 t 5 Write R 3 Outport s 3 s 6 t 4 s 7 (b) Timing diagram 48 s 8 t 4 s 9 t 7
49 Datapath pipelining In In 2 a = In b = In 2 Bu R R 2 Bu AU t = a Bus 3 >>3 >> Bu t 2 = b s 3 t 4 = min ( t, t 2 ) >> x = max( t, t 2 ) t 3 = max ( t, t 2 )>>3 R 3 R 4 R 5 Bu Bus 6 AU 2 Bus 7 s 6 t 5 = x t 3 Out (b) Pipelined datapath t 6 = t 4 + t 5 s 7 t 7 = max ( t 6, x ) s 8 Done = Out = t 7 (a) ASM Chart R = [ a, t ] R 3 = [ t 3, t 5, t 6, t 7 ] R 2 = [ b, t 2 ] R 4 = [ x ] AU = [ abs/min/max ] R 5 = [ t 4 ] AU2 = [ +/-/max ] (c) Register and functional unit assignment 49
50 Datapath pipelining In In 2 R R 2 Bu Bu AU nth pair (n+)th pair Bus 3 >>3 >> Bu Read R a s 3 t t s 6 s 7 s 8 s 9 Read R2 b t 2 t 2 R 3 R 4 R 5 AU stage a b min max Out Bu Bus 6 AU 2 Bus 7 (b) Pipelined datapath Shifters Write R Write R2 Read R3 Read R4 Read R5 a b t t 2 >> >>3 t 3 x t 5 t 4 t 6 x t 7 AU stage 2 Write R3 t 3 - t 5 + t 6 max t 7 Write R4 x Write R5 t 4 nth pair 5 (d) Timing diagram
51 Timing diagram for datapath pipeline with pipelined units Read R Read R2 AU stage AU stage 2 Shifters Write R Write R2 Read R3 Read R4 Read R5 AU2 stage AU2 stage 2 Write R3 Write R4 Write R5 Out a b a a b b a t s 3 t t 2 b t 2 s 6 t t 2 min max min max >> >>3 t 4 t 3 x s 7 t 3 x - s 8 - t 5 s 9 t 5 t t 6 2 t 6 x max max t 7 t 4 3 t 7 t 3 x t 7 5
52 Pipelined FSMD implementation / (a) Standard FSMD implementation / (b) FSMD implementation with control and datapath pipelining 52
53 ASM charts for pipelined FSMDs / (b) FSMD implementation with control and datapath pipelining (a) ASM chart (b) ASM chart (c) ASM chart for for control control pipeline with pipeline with status register and status register 53 control registers (d) ASM chart for control and datapath pipeline
54 Scheduling RT description such as ASM chart specifies data operations in each state Flowcharts or programming languages do not have states, but only specify order in which operations are executed. Scheduling transforms flowcharts or programs with RT descriptions Two types of scheduling (a) resource constrained (resource given, minimize time) (b) time constrained (time given, minimize resources) 54
55 Control/dataflow graph for SRA a=in b=in 2 In In 2 a b a>b Start t = a t 2 = b x=max (t, t 2 ) y=min(t, t 2 ) t 3 =x>>3 t 4 =y>> t 5 =x-t 3 t 6 =t 4 +t 5 t 7 = max(t 6,x) Done= Out=t 7 a b a b min max >> >>3 - + max Out Done (a) Flowchart 55 (b) Control/Data flow graph
56 Basic schedules (a) ASAP schedule 56 (a) ALAP schedule
57 List scheduling algorithm 57
58 Resource-constrained constrained scheduling Perfrom ASAP Perfrom ALAP Determine mobilities Create ready list Sort ready list by mobilities Schedule ops from ready list Delete scheduled ops from ready list Add new ops to ready list Increment state index no All ops scheduled? yes (a) ASAP (b) ALAP (c) Ready list with mobilities (d) RC schedule 58
59 Time-constrained scheduling Perfrom ASAP Perfrom ALAP Determine mobilities ranges Create probability distribution graphs no All ops scheduled? yes All ops scheduled? yes Schedule ops from ready list Schedule ops from ready list 59
60 TC schedule for SRA algorithm a b a min max a b b s 3 >> >>3 max max - min >>3 min >>3 + >> - >> - s 6 max + + s 7 max max Out s 8 Out (a) ASAP (b) ALAP (c) TC schedule 6
61 Probability distribution graph before, during and after TC scheduling (a) Initial probability distribution graph (b) Distribution graph after max, + and were scheduled (c) Distribution graph after max, + and,>>3 and >> were scheduled 6 (c) Distribution graph for final scheduled
62 We introduced RT design: FSMD model RT specification with Chapter summary Procedure for synthesis from RT specification Design Optimization through Design Pipelining Static-action tables ASM charts Register sharing Unit chaining Functional unit sharing Multiclocking Bus sharing Unit pipelining Control pipelining Datapath pipelining Scheduling of flowcharts 62
Logic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
More informationDigital Design. Sequential Logic
Principles Of igital esign Chapter 6 Sequential Logic Chapter preview Boolean algebra 3 Logic gates and flip-flops 3 Finite-state machine 6 Logic design techniques 4 Sequential design techniques 6 Binary
More informationCprE 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
More informationDesign at the Register Transfer Level
Week-7 Design at the Register Transfer Level Algorithmic State Machines Algorithmic State Machine (ASM) q Our design methodologies do not scale well to real-world problems. q 232 - Logic Design / Algorithmic
More informationSequential 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
More informationDesign 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
More informationTable of Content. Chapter 11 Dedicated Microprocessors Page 1 of 25
Chapter 11 Dedicated Microprocessors Page 1 of 25 Table of Content Table of Content... 1 11 Dedicated Microprocessors... 2 11.1 Manual Construction of a Dedicated Microprocessor... 3 11.2 FSM + D Model
More informationFSM model for sequential circuits
1 FSM model for sequential circuits The mathematical model of a sequential circuit is called finite-state machine. FSM is fully characterized by: S Finite set of states ( state ~ contents of FFs) I Finite
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Subtractors
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
More information課程名稱 : 數位邏輯設計 P-1/ /6/11
課程名稱 : 數位邏輯設計 P-1/55 2012/6/11 Textbook: Digital Design, 4 th. Edition M. Morris Mano and Michael D. Ciletti Prentice-Hall, Inc. 教師 : 蘇慶龍 INSTRUCTOR : CHING-LUNG SU E-mail: kevinsu@yuntech.edu.tw Chapter
More informationCOMBINATIONAL 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
More information7 Multipliers and their VHDL representation
7 Multipliers and their VHDL representation 7.1 Introduction to arithmetic algorithms If a is a number, then a vector of digits A n 1:0 = [a n 1... a 1 a 0 ] is a numeral representing the number in the
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 10 April 12, 2012 Dohn Bowden 1 Today s Lecture First half of the class Circuits for Arithmetic Operations Chapter 18 Should finish at least
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationReview for B33DV2-Digital Design. Digital Design
Review for B33DV2 The Elements of Modern Behaviours Design Representations Blocks Waveforms Gates Truth Tables Boolean Algebra Switches Rapid Prototyping Technologies Circuit Technologies TTL MOS Simulation
More informationReview for Final Exam
CSE140: Components and Design Techniques for Digital Systems Review for Final Exam Mohsen Imani CAPE Please submit your evaluations!!!! RTL design Use the RTL design process to design a system that has
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationAnalysis of clocked sequential networks
Analysis of clocked sequential networks keywords: Mealy, Moore Consider : a sequential parity checker an 8th bit is added to each group of 7 bits such that the total # of 1 bits is odd for odd parity if
More informationECE 448 Lecture 6. Finite State Machines. State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code. George Mason University
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code George Mason University Required reading P. Chu, FPGA Prototyping by VHDL Examples
More informationChapter 6. Synchronous Sequential Circuits
Chapter 6 Synchronous Sequential Circuits In a combinational circuit, the values of the outputs are determined solely by the present values of its inputs. In a sequential circuit, the values of the outputs
More informationEECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
More informationUNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017
UNIVERSITY OF BOLTON TW35 SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER 2-2016/2017 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002
More informationCombinational 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
More informationECE 5775 (Fall 17) High-Level Digital Design Automation. Scheduling: Exact Methods
ECE 5775 (Fall 17) High-Level Digital Design Automation Scheduling: Exact Methods Announcements Sign up for the first student-led discussions today One slot remaining Presenters for the 1st session will
More informationCPS 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
More informationFundamentals 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
More informationCS61C : Machine Structures
CS 61C L15 Blocks (1) inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks Outline CL Blocks Latches & Flip Flops A Closer Look 2005-07-14 Andy Carle CS
More informationFinite State Machine (FSM)
Finite State Machine (FSM) Consists of: State register Stores current state Loads next state at clock edge Combinational logic Computes the next state Computes the outputs S S Next State CLK Current State
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks 2005-07-14 CS 61C L15 Blocks (1) Andy Carle Outline CL Blocks Latches & Flip Flops A Closer Look CS
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationChapter 2 Basic Arithmetic Circuits
Chapter 2 Basic Arithmetic Circuits This chapter is devoted to the description of simple circuits for the implementation of some of the arithmetic operations presented in Chap. 1. Specifically, the design
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
More informationSynchronous Sequential Circuit Design. Dr. Ehab A. H. AL-Hialy Page 1
Synchronous Sequential Circuit Design Dr. Ehab A. H. AL-Hialy Page Motivation Analysis of a few simple circuits Generalizes to Synchronous Sequential Circuits (SSC) Outputs are Function of State (and Inputs)
More informationBoolean 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
More informationChapter 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
More informationEEE2135 Digital Logic Design
EEE2135 Digital Logic Design Chapter 7. Sequential Circuits Design 서강대학교 전자공학과 1. Model of Sequential Circuits 1) Sequential vs. Combinational Circuits a. Sequential circuits: Outputs depend on both the
More information(Boolean Algebra, combinational circuits) (Binary Codes and -arithmetics)
Task 1. Exercises: Logical Design of Digital Systems Seite: 1 Self Study (Boolean Algebra, combinational circuits) 1.1 Minimize the function f 1 a ab ab by the help of Boolean algebra and give an implementation
More informationINF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder
More informationDigital 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 MEMORY INPUT-OUTPUT CONTROL DATAPATH
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page of COE 22: Digital Logic Design (3--3) Term (Fall 22) Final Exam Sunday January
More informationDesign of Datapath Controllers
Design of Datapath Controllers Speaker: 俞子豪 Adviser: Prof. An-Yeu Wu ACCESS IC LAB Outline vsequential Circuit Model vfinite State Machines vuseful Modeling Techniques P. 2 Model of Sequential Circuits
More informationClocked Sequential Circuits UNIT 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS. Analysis of Clocked Sequential Circuits. Signal Tracing and Timing Charts
ed Sequential Circuits 2 Contents nalysis by signal tracing & timing charts State tables and graphs General models for sequential circuits sequential parity checker Reading Unit 3 asic unit Unit : Latch
More informationCombinational 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
More informationCSC 322: Computer Organization Lab
CSC 322: Computer Organization Lab Lecture 3: Logic Design Dr. Haidar M. Harmanani CSC 322: Computer Organization Lab Part I: Combinational Logic Dr. Haidar M. Harmanani Logical Design of Digital Systems
More informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
More informationSynchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
More informationXI 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
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationUniversity 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
More informationDigital 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
More informationECE 341. Lecture # 3
ECE 341 Lecture # 3 Instructor: Zeshan Chishti zeshan@ece.pdx.edu October 7, 2013 Portland State University Lecture Topics Counters Finite State Machines Decoders Multiplexers Reference: Appendix A of
More informationVerilog HDL:Digital Design and Modeling. Chapter 11. Additional Design Examples. Additional Figures
Chapter Additional Design Examples Verilog HDL:Digital Design and Modeling Chapter Additional Design Examples Additional Figures Chapter Additional Design Examples 2 Page 62 a b y y 2 y 3 c d e f Figure
More informationA crash course in Digital Logic
crash course in Digital Logic Computer rchitecture 1DT016 distance Fall 2017 http://xyx.se/1dt016/index.php Per Foyer Mail: per.foyer@it.uu.se Per.Foyer@it.uu.se 2017 1 We start from here Gates Flip-flops
More informationCPU DESIGN The Single-Cycle Implementation
CSE 202 Computer Organization CPU DESIGN The Single-Cycle Implementation Shakil M. Khan (adapted from Prof. H. Roumani) Dept of CS & Eng, York University Sequential vs. Combinational Circuits Digital circuits
More informationLogic BIST. Sungho Kang Yonsei University
Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern
More informationEE457 Home work #1 Review of EE254L material 3. Datapath and control design: You are given two 4-bit unsigned numbers, P and Q. You need to compare them and deposit the smaller in SMALL_REG and the bigger
More informationCS/COE1541: Introduction to Computer Architecture. Logic Design Review. Sangyeun Cho. Computer Science Department University of Pittsburgh
CS/COE54: Introduction to Computer Architecture Logic Design Review Sangyeun Cho Computer Science Department Logic design? Digital hardware is implemented by way of logic design Digital circuits process
More informationProject Two RISC Processor Implementation ECE 485
Project Two RISC Processor Implementation ECE 485 Chenqi Bao Peter Chinetti November 6, 2013 Instructor: Professor Borkar 1 Statement of Problem This project requires the design and test of a RISC processor
More informationRegister Transfer Level
Register Transfer Level CSE3201 RTL A digital system is represented at the register transfer level by these three components 1. The set of registers in the system 2. The operation that are performed on
More informationEE382V: System-on-a-Chip (SoC) Design
EE82V: SystemonChip (SoC) Design Lecture EE82V: SystemonaChip (SoC) Design Lecture Operation Scheduling Source: G. De Micheli, Integrated Systems Center, EPFL Synthesis and Optimization of Digital Circuits,
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationEE382V-ICS: System-on-a-Chip (SoC) Design
EE8VICS: SystemonChip (SoC) EE8VICS: SystemonaChip (SoC) Scheduling Source: G. De Micheli, Integrated Systems Center, EPFL Synthesis and Optimization of Digital Circuits, McGraw Hill, 00. Additional sources:
More informationProcessor Design & ALU Design
3/8/2 Processor Design A. Sahu CSE, IIT Guwahati Please be updated with http://jatinga.iitg.ernet.in/~asahu/c22/ Outline Components of CPU Register, Multiplexor, Decoder, / Adder, substractor, Varity of
More informationCSE140: Digital Logic Design Registers and Counters
CSE14: Digital Logic Design Registers and Counters Prof. Tajana Simunic Rosing 38 Where we are now. What we covered last time: ALUs, SR Latch Latches and FlipFlops (FFs) Registers What we ll do next FSMs
More informationVLSI System Design Part V : High-Level Synthesis(2) Oct Feb.2007
VLSI System Design Part V : High-Level Synthesis(2) Oct.2006 - Feb.2007 Lecturer : Tsuyoshi Isshiki Dept. Communications and Integrated Systems, Tokyo Institute of Technology isshiki@vlsi.ss.titech.ac.jp
More informationSequential Synchronous Circuit Analysis
Sequential Synchronous Circuit Analysis General Model Current State at time (t) is stored in an array of flip-flops. Next State at time (t+1) is a Boolean function of State and Inputs. Outputs at time
More informationSpiral 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
More informationEECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Review for the Final Stephen A. Edwards Columbia University Summer 25 The Final 2 hours 8 problems Closed book Simple calculators are OK, but unnecessary One double-sided
More informationTribhuvan University Institute of Science and Technology 2067
11CSc. MTH. -2067 Tribhuvan University Institute of Science and Technology 2067 Bachelor Level/First Year/ Second Semester/ Science Full Marks: 80 Computer Science and Information Technology Pass Marks:
More informationALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
More informationSequential Circuits. Circuits with state. Silvina Hanono Wachman Computer Science & Artificial Intelligence Lab M.I.T. L06-1
Sequential Circuits Circuits with state Silvina Hanono Wachman Computer Science & Artificial Intelligence Lab M.I.T. L06-1 Combinational circuits A 0 A 1 A n-1. Sel lg(n) O Mux A B Comparator Result: LT,
More informationBER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO
UN IVERSIT Y O F CA LIFO RNI A AT BERKELEY BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO SAN TA BARBA RA S AN TA CRUZ De p a r tm en t of Ele ctr i ca l En gin e e rin g a
More informationLogic. 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
More informationENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic
ENGG 1203 Tutorial_9 - Review Boolean Algebra 1. Combinational & Sequential Logic 2. Computer Systems 3. Electronic Circuits 4. Signals, Systems, and Control Remark : Multiple Choice Questions : ** Check
More informationSample 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:
More informationCOMPUTER SCIENCE TRIPOS
CST.2016.2.1 COMPUTER SCIENCE TRIPOS Part IA Tuesday 31 May 2016 1.30 to 4.30 COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit the
More informationFaculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY
1 McGill University Faculty of Engineering DIGITAL SYSTEM DESIGN ECSE-323 FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY STUDENT NAME McGILL I.D. NUMBER Examiner: Prof. J. Clark Signature: Associate
More informationChapter 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
More informationIT 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
More informationProfessor Fearing EECS150/Problem Set Solution Fall 2013 Due at 10 am, Thu. Oct. 3 (homework box under stairs)
Professor Fearing EECS50/Problem Set Solution Fall 203 Due at 0 am, Thu. Oct. 3 (homework box under stairs). (25 pts) List Processor Timing. The list processor as discussed in lecture is described in RT
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationChapter 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
More informationPreparation of Examination Questions and Exercises: Solutions
Questions Preparation of Examination Questions and Exercises: Solutions. -bit Subtraction: DIF = B - BI B BI BO DIF 2 DIF: B BI 4 6 BI 5 BO: BI BI 4 5 7 3 2 6 7 3 B B B B B DIF = B BI ; B = ( B) BI ( B),
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More informationCOE 328 Final Exam 2008
COE 328 Final Exam 2008 1. Design a comparator that compares a 4 bit number A to a 4 bit number B and gives an Output F=1 if A is not equal B. You must use 2 input LUTs only. 2. Given the following logic
More informationDept. of ECE, CIT, Gubbi Page 1
Verification: 1) A.B = A + B 7404 7404 7404 A B A.B A.B 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 A B A B A + B 0 0 1 1 1 0 1 1 0 1 1 0 0 1 1 1 1 0 0 0 2) A+B = A. B 7404 7404 7404 A B A+B A+B 0 0 0 1 0 1 1 0 1
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
More informationTHE UNIVERSITY OF MICHIGAN. Faster Static Timing Analysis via Bus Compression
Faster Static Timing Analysis via Bus Compression by David Van Campenhout and Trevor Mudge CSE-TR-285-96 THE UNIVERSITY OF MICHIGAN Computer Science and Engineering Division Department of Electrical Engineering
More informationALU (3) - Division Algorithms
HUMBOLDT-UNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK Lecture 12 ALU (3) - Division Algorithms Sommersemester 2002 Leitung: Prof. Dr. Miroslaw Malek www.informatik.hu-berlin.de/rok/ca CA - XII - ALU(3)
More informationELEN 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
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS150 - Digital Design Lecture 18 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150 - Lec18-counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS50 - Digital Design Lecture 8 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS50 - Lec8-counters Page Counters Special sequential circuits (FSMs) that sequence though a set outputs. Examples:
More informationChapter 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
More informationALU, Latches and Flip-Flops
CSE14: Components and Design Techniques for Digital Systems ALU, Latches and Flip-Flops Tajana Simunic Rosing Where we are. Last time: ALUs Plan for today: ALU example, latches and flip flops Exam #1 grades
More informationELCT201: 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
More information