RIT EECC 341 - Study Notes (113 pages)

Previewing pages 1, 2, 3, 4, 5, 6, 7, 8, 52, 53, 54, 55, 56, 57, 58, 106, 107, 108, 109, 110, 111, 112, 113 of 113 page document View the full content.
View Full Document

Study Notes



Previewing pages 1, 2, 3, 4, 5, 6, 7, 8, 52, 53, 54, 55, 56, 57, 58, 106, 107, 108, 109, 110, 111, 112, 113 of actual document.

View the full content.
View Full Document
View Full Document

Study Notes

87 views


Pages:
113
School:
Rochester Institute of Technology
Course:
Eecc 341 - Introduction to Digital Systems for Computer Engineering

Unformatted text preview:

Final Exam Review Combinational Logic Building Blocks Decoders Encoders Multiplexers Demultiplexers Implementing functions using decoders multiplexers Combinational Arithmetic Circuits Adders Subtractors Multipliers Comparators shifters Sequential Logic Circuits Latches Flip Flips Clocked Synchronous State Machines State Machine Analysis State Machine Design Registers Counters EECC341 Shaaban 1 Final Review Winter 2001 2 20 2002 Binary n to 2n Decoders A binary decoder has n inputs and 2n outputs Only the output corresponding to the input value is equal to 1 n inputs n to 2n decoder 2n outputs EECC341 Shaaban 2 Final Review Winter 2001 2 20 2002 3 to 8 Binary Decoder Truth Table F0 x y z x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z F0 F1 F2 F3 F4 F 5 F6 F7 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 F1 x y z F2 x yz F3 x yz F4 xy z F5 xy z F6 xyz F0 F7 xyz F1 X Y Z 3 to 8 Decoder F2 F3 F4 F5 F6 x y z F7 EECC341 Shaaban 3 Final Review Winter 2001 2 20 2002 Implementing Functions Using Decoders Any n variable logic function in canonical sum of minterms form can be implemented using a single n to 2n decoder to generate the minterms and an OR gate to form the sum The output lines of the decoder corresponding to the minterms of the function are used as inputs to the or gate Any combinational circuit with n inputs and m outputs can be implemented with an n to 2n decoder with m OR gates Suitable when a circuit has many outputs and each output function is expressed with few minterms EECC341 Shaaban 4 Final Review Winter 2001 2 20 2002 Implementing Functions Using Decoders Example Full adder S x y z 1 2 4 7 C x y z 3 5 6 7 3 to 8 0 Decoder 1 x S2 y S1 z S0 2 3 4 5 6 7 x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 C 0 0 0 1 0 1 1 1 S 0 1 1 0 1 0 0 1 S C EECC341 Shaaban 5 Final Review Winter 2001 2 20 2002 Encoders If the a decoder s output code has fewer bits than the input



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Study Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Study Notes and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?