| Readings | ||
| 08/22 | Course
objectives Introduction to digital systems - State the differences between analog and digital systems |
|
| Binary
representation of information - Define the term `positional number system' - Represent numbers in decimal, binary, octal and hexadecimal notations and convert from one notation to the other - Add, subtract, multiply and divide binary numbers - Represent numbers in sign-magnitude, one's complement and two's complement forms - Carry out addition and subtraction, and identify overflow conditions - Represent numbers in binary coded decimal format (BCD) - Represent characters using ASCII format - Represent voice, images, etc. in binary |
Ch. 1 |
|
| Boolean
Algebra and Combinational Logic - Define the basic logic operations (AND, OR, NOT) - Evaluate Boolean expressions - Derive the logic function implemented by a combinational logic circuit - Use Laws and Theorems of Boolean Algebra to simplify logic expressions - Find the complement of a Boolean expression using DeMorgan's Law - Find the dual of a Boolean expression - State and use the Negative Logic Theorem - Use Consensus theorem to simplify logic expressions - Implement Boolean expressions using 2-level networks (SOP, POS) |
Ch. 2 Theorems Ch. 3 |
|
| -
Convert functional specifications (written in
English) to logic expressions - Convert specifications written in English to a truth table - Write a logic expression as a minimum POS, minimum SOP, canonical POS and a canonical POS - Design logic circuits to add/subtract two's complement numbers - Obtain minterm and maxterm expansions (using m/M notations or in algebraic form) from a truth table or an algebraic expression - Convert a minterm expansion it a maxterm expansion and vise versa - Use m/M notation to obtain product/sum of logic expressions - Find the minterm and maxterm expansions of F', F.G, F+G where F, G are Boolean functions Hardware for Arithmetic - Design logic circuits to add/subtract two's complement numbers - Design an array multiplier for binary integers |
Ch. 4 |
|
| - Use don't care terms to simplify
logic expressions - Represent 3,4,5 and 6 variable functions using K-maps - Represent expressions given in SOP, POS, maxterm or minterm form on K-maps - Obtain minimum POS and SOP expansions using K-map - Design multiple output circuits using K-maps - Represent 5 and 6 variable functions using K-maps and obtain minimum SOP, POS |
Ch. 5 |
|
| -
Implement logic functions using multilevel networks - Derive alternative gate symbols for basic logic gates - Implement logic functions using basic 2-level forms (NAND-NAND, AND-OR etc.) - Convert networks from one form to another - Implement logic functions using only NOR gates or only NAND gates - Describe the operation of tri-state logic gates, multiplexers and decoders - Implement logic functions using multilevel networks - Design multiple-output circuits - Implement combinational logic expressions using multiplexers, decoders, ROMS and programmable logic |
Ch. 7 Ch. 8 Ch. 9 |
|
|
|
Sequential
Circuits - Describe the operation of S-R, T, D, and J-K latches and flip-flops - Draw timing diagrams of circuits containing latches and flip-flops - Draw the circuit diagram, and describe the operation of registers, shift registers, cyclic shift registers, etc. |
Ch. 11 Ch. 12 |
| -
Analyze Moore and Mealy type sequential
networks, i.e., given a sequential circuit, - Derive the state graphs/ state tables of a given sequential circuit - Draw timing diagrams corresponding to given input waveforms - Derive Moore and Mealy type state diagrams to meet given specifications - Synthesize Moore & Mealy circuits to meet given specifications using D, T, J-K and/or S-R flip-flops |
Ch. 13 Ch 14 Ch. 15 |
|
| -
Identify equivalent states and reduce state diagrams to
minimum number of states - Determine whether two state diagrams are equivalent - Use Alphanumeric Notation in state graphs |
||
|
|