Complete the Xilinx
Tutorial (link below) to learn how to draw circuits and simulate with Xilinx
ISE 4.2i.
Motivation
As an engineer you will use mathematical representations,
manipulations, and models to analyze (understand) and synthesize
(design) solutions to complex problems. Boolean algebra is the fundamental
mathematical representation and modeling tool that we have for working with
digital logic. You will use Boolean algebra both for describing
mathematically the function that a digital logic circuit performs, and also
for developing an efficient solution to a particular logic problem.
Relationship to Laboratory
As you learn to construct digital logic circuits in lab, you
will use Boolean algebra to describe the logic function a circuit is
designed to implement as well as for making transformations from one circuit
form to another. Boolean algebra will also provide insight into the cost and
complexity of the circuits you design.
Goals
Understand combinational versus sequential
Know what a truth table is and be able to use it to describe a logic
function
Develop techniques for analyzing and representing mathematically the
function performed by a digital logic circuit
Learn how to use work with Boolean expressions using the axioms and
theorems of Boolean algebra
Understand how to complement a Boolean expression using DeMorgan's
theorem
Know the difference between the two two-level canonic forms and be
able to manipulate a Boolean expression into the desired form
Know what minterms and maxterms are and how to find them
Know the five possible representations for a combinational logic
function (p. 209) and understand how to convert between them
This project is sponsored by the National Science Foundation under award
NSF00311257.
All material is property of the authors and can be used only with permission.
For further information contact the REAL LIFE Coordinator.