Documentation Standards
|
|
- Merryl Franklin
- 5 years ago
- Views:
Transcription
1 Documentation Standards Circuit specification. Description of what the system is supposed to do, including a description of all inputs and outputs and the functions that are to be performed (page ). Block diagram. Informal pictorial description of the system s major functional modules. Schematic or logic diagram. Formal specification of the electrical components of the system, their interconnections, and all details needed to construct it (IC type, pin numbers, etc.).
2 Documentation Standards Timing diagram. Shows the values of various logic signals as a function of time, including cause and effect delays between critical signals. Structured logic device description. Describes the internal function of a programmable logic device (PLD), a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC).
3 Block Diagrams SHIFT-AND-ADD MULTIPLIER RESET LOAD RUN CONTROL R/W ADDR IN -word x -bit RAM DISPLAY BYTE EN OUT INBUS direct left right LDA LDB SEL MULTIPLEXER to A REGISTER B REGISTER CARRY LOOKAHEAD ADDER Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e OUTBUS
4 Block Diagrams (a) (b) -BIT REGISTER -BIT REGISTER x LS Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (c) LS LS LS LS
5 Gate Symbols Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e AND NAND OR NOR BUFFER INVERTER (a) (b) (c) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (a) (b) (c) (d) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (a) (b) (c) (d) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (a) (b) (c) (d)
6 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e SSI x00 x0 x0 x0 x x0 x x x0 x x x0 x x x
7 Active Levels For Pins Each signal should have an active level associated with it. A signal is active high if it performs the named action or denotes the named condition when it is HIGH or. A signal is active low if it performs the named action or denotes the named condition when it is LOW or 0. A signal is said to be asserted when it is at its active level.
8 Active Levels For Pins ENABLE DO MY THING ENABLE DO MY THING (a) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (b)
9 Buses Collection of two or more related signal lines. Microprocessor A A A A A A0 A A A A A A A A A A0 ADDR ADDR ADDR ADDR ADDR ADDR0 ADDR ADDR ADDR ADDR ADDR ADDR ADDR ADDR ADDR ADDR0 ADDR ADDR ADDR ADDR ADDR ADDR0 ADDR ADDR ADDR[:0] LA LA LA LA LA LA0 LA LA LA[:0] ADDR ADDR ADDR ADDR ADDR ADDR ADDR ADDR0 LA LA LA LA LA LA LA LA0 RDY READY ALE D D D D D D D D0 MEMIO READ WRITE ALE DATA DATA DATA DATA DATA DATA DATA DATA0 MIO RD_L WR_L ALE DATA[:0] DATA DATA DATA DATA DATA DATA DATA DATA0 RD_L WR_L DB DB DB DB DB DB DB DB0 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e DB[:0] CONTROL,
10 Timing Diagrams Illustrate the logical behavior of the signals in a digital circuit as a function of time. Causality: which input transition causes which output transition. Propagation delay: the time it takes for a change at the input to produce a change at the output. Note that propagation delays when outputs change from LOW to HIGH may differ from when they change from HIGH to LOW.
11 Timing Diagrams (b) GO READY trdy trdy DAT tdat tdat (a) (c) GO GO READY READY ENB DAT trdymin trdymax DAT Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e tdatmin tdatmax
12 Decoders A decoder is a multiple-input multiple-output logic circuit that converts coded inputs into coded outputs, where the inputs and outputs codes are different. Decoder input code word enable inputs map output code word Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
13 Decoders Generally the input code has fewer bits than the output codes. In a one-to-one mapping each input code word produces a different output code word. Most commonly used codes: For input: The n-bit binary code. For output: The -out-of-m code.
14 Binary Decoder Binary decoder: The most common decoder. n-to- n. The input code is the n-bit binary code. The output code is the -out-ofm code.
15 Binary Decoder Table - Truth table for a -to- binary decoder. Inputs Outputs EN I I0 Y Y Y Y0 0 x x I0 I0 I I EN I0 Y0 I0 I -to- decoder EN (a) Y0 Y Y Y I EN (b) Y Y Y
16 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e Binary Decoder Table - Truth table for onehalf of a x dual -to- decoder. Inputs Outputs G_L B A Y_L Y_L Y_L Y0_L x x G_L A B () () () () () () () Y0_L Y_L Y_L Y_L x G Y0 Y A B Y Y G A B Y0 Y Y Y 0 (a) G_L A B () () () () () (0) () Y0_L Y_L Y_L Y_L (b) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e / x G A B (c) Y0 Y Y Y / x / x (a) G A B Y0 Y Y Y (b) G A B Y0 Y Y Y
17 Binary Decoder Table - Truth table for a x -to- decoder. Inputs Outputs G GA_L GB_L C B A Y_L Y_L Y_L Y_L Y_L Y_L Y_L Y0_L 0 x x x x x x x x x x x x x x x (a) G () GA_L () GB_L () () () () () Y0_L Y_L Y_L Y_L (b) x Y0 G Y GA Y GB Y Y A Y B Y C Y 0 () Y_L A () (0) Y_L B () C () () () Y_L Y_L Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
18 Cascading Binary Decoders N0 N N N +V R x Y0 G Y GA Y GB Y Y A Y B Y C Y 0 DEC0_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L EN_L U x G GA GB A B C Y0 Y Y Y Y Y Y Y 0 DEC_L DEC_L DEC0_L DEC_L DEC_L DEC_L DEC_L DEC_L Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e U
19 Cascading Binary Decoders x GA G GB Y0 Y Y Y B A C Y Y Y Y x GA G GB Y0 Y Y Y B A C Y Y Y Y DEC0_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC0_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L DEC_L N0 N N N EN_L N EN_L EN x GA G GB Y0 Y Y Y B A C Y Y Y Y DEC_L DEC_L DEC0_L DEC_L DEC_L DEC_L DEC_L DEC_L x GA G GB Y0 Y Y Y B A C Y Y Y Y DEC_L DEC_L DEC_L DEC_L DEC0_L DEC_L DEC_L DEC_L / x A G B Y0 Y Y Y EN0X_L ENX_L ENX_L ENX_L U U U U U Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
20 Seven Segment Decoders a Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e e f g c b d (a) (b) Table - Truth table for a x seven-segment decoder. Inputs Outputs BI_L D C B A a b c d e f g 0 x x x x
21 Seven Segment Decoders (a) () a Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (b) x (0) b BI a b 0 A c B d C e D f g () c () d BI_L () () e A () B () () f C () () g D ()
22 Encoders Reverses what a decoder does. If a device s output code word has fewer bits than the input code word then the device is usually called an encoder. The simplest encoder is the binary encoder or the n -to-n encoder.
23 Encoders Inputs Outputs I0 I I I I I I I Y Y Y Binary encoder Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e Y0 I0 (a) n inputs I0 I I Y0 Y I n Y n n outputs (b) I I I I I I I Y Y
24 Priority Encoders Priority encoders assigns priority to the input lines, so that when multiple lines are asserted at the same time, the encoder will produce the highest priority requestor. Inputs Outputs I0 I I I I I I I Y Y Y X X X X X X X X X X X X X X X X X X X X X 0 0 X X X X X X X
25 Priority Encoders Table - Truth table for a x -input priority encoder. Inputs Outputs EI_L I0_L I_L I_L I_L I_L I_L I_L I_L A_L A_L A0_L GS_L EO_L x x x x x x x x 0 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 I0_L (0) () EO_L I_L () () GS_L I_L () I_L () () A0_L I_L () Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e I_L () () A_L I_L () I_L () () A_L EI_L ()
26 Cascading Binary Encoders I I I I I I I I0 A A A0 GS EO EI 0 x I I I I I I I I0 A A A0 GS EO EI 0 x I I I I I I I I0 A A A0 GS EO EI 0 x x REQ_L REQ0_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ0_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ0_L REQ_L REQ_L REQ0_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L REQ_L I I I I I I I I0 A A A0 GS EO EI 0 RGS RA0 RA RA RA RA U U U U GA_L GA_L GA0_L GGS_L GEO_L GA_L GA_L GA0_L GGS_L GEO_L GA_L GA_L GA0_L GGS_L GEO_L G0A_L G0A_L G0A0_L G0GS_L x00 U x00 U x0 U 0 x0 U x0 U 0 x0 U Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
27 Tri-State Devices Devices whose outputs may be in one of three states, 0,, or Hi-Z (high impedance). These devices have an extra input which is used to control if the output is floating (Hi-Z) or if it is behaving normally (page ). (a) (b) (c) (d) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e Inputs Output EN A Y X Hi-Z
28 Tri-State Devices -bit party line P Q x EN EN_L EN_L SSRC0 SSRC SSRC G GA GB A B C Y0 Y Y Y Y Y Y Y 0 SELP_L SELQ_L SELR_L SELS_L SELT_L SELU_L SELV_L SELW_L R S T SDATA U V W SSRC[0] 0 EN EN_L, EN_L SDATA W P Q R S max(t plzmax, t phzmax ) min(t pzlmin, t pzhmin ) dead time
29 Tri-State Devices G G x G_L G_L () () (b) A A A A A A A A Y Y Y Y Y Y Y Y A A A A () () () () () () () () Y Y Y Y A () () Y Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e A A () () () () Y Y (a) A () () Y
30 Tri-State Devices x DIR G B B B (b) (a) A A A A A A A A B B B B B () B G_L () DIR () A () () B A () () B A () () B A () () B A () () B A () () B A () () B A ()
31 Tri-State Devices Microprocessor x READ INSEL G G Input Port DB0 DB DB DB DB DB DB DB D0 D D D D D D D INSEL INSEL User Inputs A A A A A A A A Y Y Y Y Y Y Y Y DB0 DB DB DB DB DB DB DB x G G Input Port Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e User Inputs A A A A A A A A Y Y Y Y Y Y Y Y DB0 DB DB DB DB DB DB DB DB[0:]
32 Multiplexers (b) D0 D Y Dn (a) enable select s multiplexer EN SEL D0 D Dn Y n data sources b b b D0 D Dn Y b data output bd0 bd bdn by SEL EN Digital switch (page ). A multiplexer with n data sources requires s = log n select lines. Commercially available MUX have n=,,, or. EN enables the output.
33 Multiplexers Inputs Output EN S D0 D Y 0 X X X Inputs Output EN S Y 0 X 0 0 D0 D Y = EN S D0 + EN S D
34 Multiplexers iy = n j= 0 EN M j id j (b) D0 D Y Dn (a) enable select s multiplexer EN SEL D0 D Dn Y n data sources b b b D0 D Dn Y b data output bd0 bd bdn by SEL EN General logic equation for a multiplexer is show above.
35 Multiplexers Table - Truth table for a x -input, -bit multiplexer. Inputs Outputs EN_L C B A Y Y_L x x x D0 D D D D D 0 0 D D D D 0 0 D D 0 0 D D 0 D D EN_L () D0 () A A B B C C D () D () D () () Y D () () Y_L D () x D D A B () () () (0) 0 EN A B C D0 D D D D D D D Y Y C () (a) (b)
36 Multiplexers Inputs Outputs G_L S Y Y Y Y x A A A A 0 B B B B Table - Truth table for a x -input, -bit multiplexer. (a) G_L S A B () () () () () Y (b) 0 x G S A Y B A Y B A Y B A Y B A () B () () Y A B A () (0) () () Y Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e B () () Y
37 Multiplexers Inputs Outputs G_L G_L B A Y Y C0 C C C C C 0 0 C C C C C 0 0 C C C C 0 0 C x x 0 0 Table - Truth table for a x -input, -bit multiplexer. (a) A () B () G_L () Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e C0 () C () () Y C () C () G_L C0 C C C () (0) () () () () Y (b) 0 x A B G C0 C Y C C G C0 C Y C C
38 Multiplexers x D0 D D D D D D D EN Y Y A B C 0 / x A G B Y0 Y Y Y XEN_L XA XA XA0 XA XA X0 X X X X X X X EN_L EN_L EN_L EN0_L x D0 D D D D D D D EN Y Y A B C 0 X0 X X X X X X X x D0 D D D D D D D EN Y Y A B C 0 x D0 D D D D D D D EN Y Y A B C 0 X X X X X0 X X X X X X X X X X X0 / x0 XOUT XO0_L XO_L XO_L XO_L U U U U U U Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
39 Demultiplexers Digital switch (page 0). A demultiplexer with n data outputs requires s = log n select lines. (a) SRCA multiplexer demultiplexer DSTA SRCB SRCC BUS DSTB DSTC SRCZ DSTZ SRCSEL DSTSEL (b) SRCA Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e DSTA SRCB SRCC MUX BUS DMUX DSTB DSTC SRCZ DSTZ SRCSEL DSTSEL
40 Demultiplexers (a) -to- decoder (b) / x SRCDATA G Y0 DST0DATA SRCDATA_L G Y0 DST0DATA_L Y DSTDATA Y DSTDATA_L DSTSEL0 A Y DSTDATA DSTSEL0 A Y DSTDATA_L DSTSEL B Y DSTDATA DSTSEL B Y DSTDATA_L Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e Table - Truth table for onehalf of a x dual -to- decoder. Inputs Outputs G_L B A Y_L Y_L Y_L Y0_L x x
41 Exclusive-Or Gates An exclusive-or (XOR) gate is a input device whose output is if exactly one of its inputs is (page 0). An exclusive-nor (XNOR) or equivalence is just the opposite. (a) (b) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
42 Exclusive-Or Gates X Y X Y (XOR) (X Y) (XNOR) Table - Truth table for XOR and XNOR functions. Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (a) X F = X Y Y (b) X F = X Y Y
43 Parity Circuits Parity detectors are circuits that detects if the numbers of ones at its input is odd or even. Used to detect errors during the transmission of binary information, by using a parity bit. Parity bit is an extra bit included with the binary message to make the number of ones in the message either even or odd.
44 Parity Circuits (a) I I I I IN ODD (b) I I I I ODD IM IN Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
45 Parity Circuits x0 (a) A B C () () (0) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (b) 0 A B C D E F G H I EVEN ODD D E F () () () () EVEN G H I () () () () ODD
46 Parity Circuits x0 D E F G H I EVEN ODD A B C 0 D0 D D D D D D D U U U U D[0:] RP Memory Chips DIN DIN DIN DIN DIN PIN DIN0 READ WRITE DIN DIN DOUT DOUT DOUT DOUT DOUT POUT DOUT0 DOUT DOUT D0 D D D D D D D D D D0 D D D D D x G G Y Y Y A A A A A A A A Y Y Y Y Y DO0 DO DO DO DO DO DO DO LS0 U x0 x0 ERROR RD_L PI PO RD WR Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
47 Comparators Comparators are circuits that compare two binary words and indicates whether they are equal or not equal. (a) A0 B0 / x U DIFF (b) A0 B0 A B A B A B 0 x U U U U DIFF0 DIFF DIFF DIFF x0 U x0 U DF0_L DF_L x00 U DIFF Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
48 Comparators primary inputs PI 0 cascading input PI cascading output PI n PI PI PI C 0 C C C n C n CI module CO CI module CO CI module CO PO PO PO boundary inputs Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e boundary outputs PO 0 PO PO n primary outputs (b) X0 Y0 X Y X Y X(N ) Y(N ) X Y CMP EQI EQO EQ X Y CMP EQI EQO EQ X Y CMP EQI EQO EQ EQ(N ) X Y CMP EQI EQO EQN (a) X Y CMP EQO Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e EQI
49 Comparators Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e () PEQQ_L Q0 P0 () () Q P () () Q P () () Q P () () () PGTQ_L Q () P () Q () P () Q () P () Q () P ()
50 Comparators x 0 ALTBIN AEQBIN AGTBIN A0 B0 A B A B A B ALTBOUT AEQBOUT AGTBOUT Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e + V R x x x XD0 YD0 XD YD XD YD XD YD 0 ALTBIN AEQBIN AGTBIN A0 B0 A B A B A B ALTBOUT AEQBOUT AGTBOUT XLTY XLTY XLTY ALTBIN ALTBOUT ALTBIN ALTBOUT XEQY XEQY XEQY AEQBIN AEQBOUT AEQBIN AEQBOUT XGTY XGTY XGTY AGTBIN AGTBOUT AGTBIN AGTBOUT XD 0 XD 0 A0 A0 YD B0 YD B0 XD A XD A YD B YD B XD A XD0 A YD B YD0 B XD A XD A YD B YD B XD[0] YD[0] Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
51 Adders Half adder adds two one bit operands and produces a two bit sum (page ). HS = X Y CO = XY X Y CO HS
52 Adders Full adder adds three one bit operands and produces a two bit sum. S = X Y CIN COUT = XY + X CIN + Y CIN CIN X Y COUT S
53 Adders full adder X Y CIN S (b) X Y CIN S COUT COUT X Y (a) Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e (c) COUT S CIN x y x y x y x 0 y 0 X Y X Y X Y X Y c c c c COUT CIN COUT CIN COUT CIN COUT CIN c 0 S S S S s s s s 0 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
54 PLDs I I I I Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e P P P P P P O O O I I I I P P P P P P O O O Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
55 PLDs Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e V CC floating gate nonfloating gate active-low input lines active-high AND lines
56 PLDs I I I I P P P P P P O O O Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
57 PALL I () () O I () I () 0 () IO I () 0 () IO I () 0 () IO I () () IO I () 0 () IO I () 0 () IO I () 0 () () O I0 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
58 GALVC I () I () 0 () O I () 0 () IO I () 0 () IO I () 0 () IO I () () IO I () 0 () IO I () 0 () IO I () 0 () () O I0 Copyright 000 by Prentice Hall, Inc. Digital Design Principles and Practices, /e
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
More informationCSE140: 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
More informationUniversity of Toronto Faculty of Applied Science and Engineering Final Examination
University of Toronto Faculty of Applied Science and Engineering Final Examination ECE 24S - Digital Systems Examiner: Belinda Wang, Jianwen Zhu 2: - 4:3pm, April 26th, 24 Duration: 5 minutes (2.5 hours)
More informationMODULAR 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,
More informationARITHMETIC 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
More informationHardware 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
More informationCSE140: 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
More informationBoolean 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
More informationSection 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic
Section 3: Combinational Logic Design Major Topics Design Procedure Multilevel circuits Design with XOR gates Adders and Subtractors Binary parallel adder Decoders Encoders Multiplexers Programmed Logic
More informationCHAPTER1: 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.
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 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 informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationCSE 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:
More informationCOSC 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,
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 informationChapter 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
More informationDesign 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
More informationELCT201: 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
More informationDIGITAL 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:
More informationCombinational 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
More informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationCOMBINATIONAL 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
More informationNumber 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
More informationLOGIC 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
More informationAppendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
More informationECE 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
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More informationChapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms
Chapter 2 (Lect 2) Canonical and Standard Forms Sum of Minterms Product of Maxterms Standard Form Sum of products Product of sums Other Logic Operators Logic Gates Basic and Multiple Inputs Positive and
More informationCOMBINATIONAL CIRCUITS
OMINTIONL IRUITS pplications Parity Generation and heking Even Parity P e P e P P P P P P5 P P6 ( ) = m(,, ) =, Odd Parity P o P e Three-bit Parity Generator ( ) = m(,,5, ) P P P P P P5 P P6 = 6 Three-bit
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
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 informationXOR - 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
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
More informationUNIT 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
More informationFunction of Combinational Logic ENT263
Function of Combinational Logic ENT263 Chapter Objectives Distinguish between half-adder and full-adder Use BCD-to-7-segment decoders in display systems Apply multiplexer in data selection Use decoders
More informationENGIN 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
More informationChap 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
More informationUnit 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
More informationCMSC 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:
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
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 informationMidterm 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
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 2 Combinational Logic Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
More informationComputer organization
Computer organization Levels of abstraction Assembler Simulator Applications C C++ Java High-level language SOFTWARE add lw ori Assembly language Goal 0000 0001 0000 1001 0101 Machine instructions/data
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationCHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals Digital Concepts Slide 2 What?
More informationModule 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors Flip-Flops
Module 2 asic Digital uilding locks Lecturer: Dr. Yongsheng Gao Office: Tech 3.25 Email: Web: Structure: Textbook: yongsheng.gao@griffith.edu.au maxwell.me.gu.edu.au 6 lecturers 1 tutorial 1 laboratory
More informationSystems 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
More informationDigital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab in-charge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
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 informationProgrammable Logic Devices
Programmable Logic Devices Mohammed Anvar P.K AP/ECE Al-Ameen Engineering College PLDs Programmable Logic Devices (PLD) General purpose chip for implementing circuits Can be customized using programmable
More informationCSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April
CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April Objective - Get familiar with the Xilinx ISE webpack tool - Learn how to design basic combinational digital components -
More informationExperiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
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 informationBoole Algebra and Logic Series
S1 Teknik Telekomunikasi Fakultas Teknik Elektro oole lgebra and Logic Series 2016/2017 CLO1-Week2-asic Logic Operation and Logic Gate Outline Understand the basic theory of oolean Understand the basic
More informationDigital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1
Lecture 5 - Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom - lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom - lecturer Page 2 Buffer A buffer
More informationSoftware 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
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 informationvidyarthiplus.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
More informationDigital 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
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 informationCombinational 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
More informationVidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form
S.E. Sem. III [EXTC] Digital System Design Time : 3 Hrs.] Prelim Paper Solution [Marks : 80 Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form [5] (i) (42) 10 (ii) (17)
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in
More informationClass 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:
More informationUnit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4
Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationCprE 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
More informationCMSC 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
More informationCSEE 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
More informationSRC Language Conventions. Class 6: Intro to SRC Simulator Register Transfers and Logic Circuits. SRC Simulator Demo. cond_br.asm.
Fall 2006 S333: omputer rchitecture University of Virginia omputer Science Michele o SR Language onventions lass 6: Intro to SR Simulator Register Transfers and Logic ircuits hapter 2, ppendix.5 2 SR Simulator
More informationDigital 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
More informationChapter 3 Ctd: Combinational Functions and Circuits
Chapter 3 Ctd: Combinational Functions and Circuits 1 Value Fixing, Transferring, and Inverting Four different functions are possible as a function of single Boolean variable Transferring Inverting Value
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationReview: Additional Boolean operations
Review: Additional Boolean operations Operation: NAND (NOT-AND) NOR (NOT-OR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationPart 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there
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 informationComputer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 6.1 ROBERT SEDGEWICK
More informationCombinational 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
More informationAppendix A: Digital Logic. CPSC 352- Computer Organization
- CPSC 352- Computer Organization -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties of oolean lgebra.6 The Sum-of-Products Form, and Logic Diagrams.7 The
More informationCOSC3330 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
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 21: Shifters, Decoders, Muxes
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 21: Shifters, Decoders, Muxes [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN
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 informationIntroduction to Digital Logic
Introduction to Digital Logic Lecture 15: Comparators EXERCISES Mark Redekopp, All rights reserved Adding Many Bits You know that an FA adds X + Y + Ci Use FA and/or HA components to add 4 individual bits:
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
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 information14: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
More informationRAO PAHALD SINGH GROUP OF INSTITUTIONS BALANA(MOHINDER GARH)123029
1 DIGITAL SYSTEM DESIGN LAB (EE-330-F) DIGITAL SYSTEM DESIGN LAB (EE-330-F) LAB MANUAL VI SEMESTER RAO PAHALD SINGH GROUP OF INSTITUTIONS BALANA(MOHINDER GARH)123029 Department Of Electronics & Communication
More informationCh 9. Sequential Logic Technologies. IX - Sequential Logic Technology Contemporary Logic Design 1
Ch 9. Sequential Logic Technologies Technology Contemporary Logic Design Overview Basic Sequential Logic Components FSM Design with Counters FSM Design with Programmable Logic FSM Design with More Sophisticated
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 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 informationEECS150 - 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
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More information