MIME-Version: 1.0 Content-Location: file:///C:/5F1A5A30/COMP3500.htm Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset="us-ascii" DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

COURSE DESCRIPTION FOR COMP-3500: DIGITAL LOGIC DESIGN=

&nb= sp;

= COURSE OBJECTIVES

This course gives compreh= ensive introduction to the digital logic design theory and techniques. It provides students with extensive simulation and design experience for logic circuits. Students get opportunity to apply theoretical knowledge to real-world probl= ems. The course covers the Boolean algebra, combinational and sequential logic networks, network reduction, adders, subtractors, multipliers, decoders, multiplexers, shifters, counters, latches and flip-flops, finite-state machines, and arithmetic logic units.  Students are expected to work in laboratory in teams to design and implement some logic networks.

 

= PREREQUISITES

The prerequisite for this course is a grade of C or = better in COMP 2400. Those who do not meet the prerequisite should withdraw this course.

 

A.     COMPETENCIES

1.&n= bsp;          Ability to understand the fundamentals of digital l= ogic design.

2.&n= bsp;          Ability to design logic networks to meet required criteria.

3.&n= bsp;          Ability to simulate digital logic circuits.

4.&n= bsp;          Ability to implement digital logic circuits.

5.&n= bsp;          Understanding of modern software development and engineering tools.

6.&n= bsp;          Ability to work on multi-disciplinary teams.

7.&n= bsp;          Ability to communicate and present effectively.

 

DETAILED COURSE OUTLINE

Binary Systems

  1. Why binary?
  2. Number conversion
  3. Representation of negative numbers
  4. Arithmetic operations

 

Boolean Algebra and Logic Gates

  1. Simplification theorems
  2. Truth table
  3. Examples
  4. Minterms
  5. Maxterms
  6. Common logic gates

 

LogicWorks 5

 

Gate-Level Minimization

  1. 2, 3, and 4 variable K-maps
  2. Don’t care conditions
  3. NAND/NOR implementations

 

Lab-1

 

Combinational Logic

  1. Half-adder and full-adder
  2. 4-bit and 32-bit adders
  3. Subtractor
  4. Multiplier
  5. Comparators

 

Lab-2

 

Combinational Logic

  1. Decoders
  2. Multiplexers
  3. Three-state buffer
  4. Shifters

 

Lab-3

 

Sequential Circuits

  1. Types
  2. Clock
  3. Flip-flops (D, T, and J-K flip-flops)
  4. Latches

 

Lab-4

 

Sequential Circuits

  1. State equations
  2. State reduction
  3. State diagram
  4. Design procedure

 

Registers and Counters

  1. Shift registers
  2. Universal shift register
  3. Ripple counter
  4. Binary counter
  5. Counter design