Course introduces the principles and practices of digital logic design. Student will learn about number systems, Boolean algebra, sum-of-product equations, minterms, Karnaugh maps, optimization, combinational circuit design, sequential circuit design, datapath components, and physical implementation. Students will have the opportunity to design and implement digital circuits using software.
Athena Title
Fundamentals of Logic Design
Equivalent Courses
Not open to students with credit in CSEE 2220E, CSEE 2220H
Prerequisite
CSEE 2210 or ECSE 1100 or ECSE 1100E or ESCE 1100H or ELEE 1030
Semester Course Offered
Offered every year.
Grading System
A - F (Traditional)
Student learning Outcomes
By the end of this course, students will have obtained knowledge on logic functions and Boolean algebra.
By the end of this course, students will have learned how to apply formal design methods (minimization methods), the Karnaugh Table, and the Quine-McCluskey method.
By the end of this course, students will be able to formalize a problem and convert it into a logic expression and then into a circuit on the gate level.
By the end of this course, students will be able to obtain an overview how a gate-level circuit can be realized using integrated circuits and programmable logic.
By the end of this course, students will be able to develop and deliver a clear technical presentation documenting a digital logic design, as demonstrated through the Final Project Presentation.
By the end of this course, students will be able to apply engineering design principles to synthesize an original digital logic design solution, as demonstrated through their performance on Test 2.
By the end of this course, students will be able to plan and complete a team-based digital logic design project, engaging teammates toward a shared design goal, as demonstrated through the Final Project collaboration score.
Topical Outline
Introduction: Digital systems and number systems
Components of digital systems, basic logic functions
Boolean algebra: Terminology and properties, DeMorgan’s law
Boolean functions: Different representation of Boolean functions including sentence, truth tables, equations, and circuits; Conversion between different representation
Canonical representations and Standard form of Boolean functions; Minterms, sum-of-minterms, and compact sum-of-minterms representation
Combinational logic design process
Universal logic gates
Multiplexers and decoders
Combinational logic optimization and tradeoffs
Simplification of Boolean expressions; The Karnaugh map method; Algebraic 2-level simplification; Don’t care input combinations
Sequential logic; SR Latch, D Latch, D-Flip Flop, and registers
Timing diagram; State diagrams/finite state machine; Formal design of sequential circuits
Number systems (binary, decimal, hexadecimal); Addition and subtraction; Unsigned and signed numbers; 2's complement
Arithmetic-logic unit
Physical implementation; Tradeoffs and comparisons between different approaches
Realization using gates; AND/OR networks, NAND networks, NOR networks
Memory elements; ROM and RAM
Gate delays and number of transistors; Simulation of combinatorial circuits; Propagation delay
Programmable logic: Gate arrays; Logic design and programming tools
General Education Core
CORE III: Quantitative Reasoning
Institutional Competencies Learning Outcomes
Analytical Thinking
The ability to reason, interpret, analyze, and solve problems from a wide array of authentic contexts.
Communication
The ability to effectively develop, express, and exchange ideas in written, oral, interpersonal, or visual form.
Creativity & Innovation
The capacity to combine or synthesize existing ideas, images, or expertise in original ways and the experience of thinking, reacting, and working in an imaginative way characterized by innovation, divergent thinking, and risk taking.
Leadership & Collaboration
The capacity to engage in the relational process of optimizing personal and collective strengths toward a common goal.
