Jaehwan (John) Lee, Ph.D. Assistant Professor Department of Electrical and Computer Engineering Purdue School of Engineering and Technology Indiana University-Purdue University Indianapolis 723 West Michigan St. SL 160, Indianapolis, IN 46202-5132 Tel: 317-278-2267, Fax: 317-274-4493, Email: johnlee at iupui.edu

Courses

Note: Most of lecture materials are now under Oncourse, which is a secured web course server.

• ECE 270: Introduction to Digital System Design, S08, F08
  Introduction to logic design, with emphasis on practical design techniques and circuit implementation. Topics include Boolean algebra; theory of logic functions; mapping techniques and function minimization; logic equivalent circuits and symbol transformations; transistor-transistor-logic (TTL) and metal oxide semiconductor (MOS) logic into gate implementations; electrical characteristics; propagation delays; signed number notations and arithmetic; binary and decimal arithmetic logic circuits; theory of sequential circuits; timing diagrams; analysis and synthesis of SR-, D-based sequential circuits; clock generation circuits; algorithmic state machine method of designing sequential circuits.
  
  Prerequisite: ECE 201.
  
  Textbook: Katz and Borriello, "Contemporary Logic Design" 2nd Edition, 2005, Prentice Hall.
  
  Outcomes: Upon completion of the course, the student should be able to
  • Derive a Boolean expression for a digital circuit.
  • Design a digital circuit given the input, output and description of the system.
  • Design sequential logic and combinational logic digital circuits.
  • Design digital circuits using various digital logic building blocks such as multiplexers, Flip-Flops.
  • Derive a finite state machine, implement it and optimize it given a description of the target digital system.
  • Incorporate timing issues, such as propagation delay and hazards, in digital circuit design.
  • Reverse engineer a digital circuit. That is, given a digital design, be able to determine its functionality.
  
  
  
• ECE 495: Introduction to Digital Logic Optimization
  The course focuses on analysis and design of exact and heuristic algorithms for digital logic optimization. How digital logic can be algorithmically optimized in terms of delay and area? Topics include: area-efficient layout, delay minimization, representation and optimization of combinational logic functions, representation and optimization of multiple-level networks, modeling and optimization of sequential functions, state assignment and state minimization, and technology library mapping.
  
  Prerequisite: ECE 201 and ECE 270 (Basic circuit analysis, digital design, differential equations, linear algebra, basic Boolean algebra)
  
  Main Textbook: Lecture Slides
  
  Aux Textbooks:
  • Giovanni De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 1994, ISBN 0-07-016333-2
  • Wayne Wolf, Modern VLSI Design: System-on-Chip Design, Prentice Hall, 2002. ISBN: 0-13-061970-1
  • I. Sutherland, B. Sproull and D. Harris, Logical Effort, Elsevier Publishers, San Francisco, 1999. ISBN: 1-55860-557-6
  • Gary Hachtel and Fabio Somenzi, Logic Synthesis and Verification Algorithms, Kluwer Academic, Boston, 1996. ISBN: 0792397460
  
  Topics: (Some sample slides are linked, but the difficulty will be adjusted to registered students)
  • Introduction to digital design. (1 class)
  • Algorithmic approach to Stick diagrams and Euler paths (3 classes)
  • Algorithmic approach to logic delay, logical effort and delay minimization (4 classes)
  • Two-level logic minimization (5 classes)
  • Heuristic logic minimization (3 classes)
  • Multi-level logic minimization (3 classes)
  • Fault detection (2 classes)
  • Design for testability (2 classes)
  • Finite State Machine (FSM) minimization (2 classes)
  • Logic library mapping (3 classes)
  • Two or three Exams (2 classes)
  
  Grading: Homework (10%), two or three exams (50%), attendance and class participation (5%), and final exam (35%).
  
  
  
• ECE 565: (Advanced) Computer Architecture, Spring 2006, Fall 2007
  An introduction to problems of designing and analyzing current machine architectures. Major topics include performance and cost analysis, pipeline processing, superscalar architecture, VLIW, hierarchical memory design, multiprocessor architectures, and vector machines and numerical applications. A qualitative approach allowing a computer system designer to determine the extent to which a design goal is emphasized.
  
  Prerequisite: ECE 365 or graduate standing.
  
  Textbook: Hennessy and Patterson, Computer Architecture: A Quantitative Approach, 3rd Ed., 2003. ISBN-13: 978-1-55860-596-1, ISBN-10: 1-55860-596-7.
  
  Topics:
  • Introduction and Performance, Fundamentals of Computer Architecture (Ch. 1)
  • Instruction Set Architecture (Ch. 2)
  • Pipelining (Ap. A)
  • Instructional Level Parallelism - Hardware approcahes (Ch. 3)
  • Instructional Level Parallelism - Software approaches (Ch. 4)
  • Memory Hierarchy (Ch. 5)
  • Multiprocessors (Ch. 6)
  • Input/Output and Storage (Ch. 7) (if time allows)
  • Networks and Interconnection Technology (Ch. 8)
  • Design space exploration and embedded processors (if time allows)
  • Configurable processors and computing (if time allows)
  • Vector Processors and DSPs (Ap. B) (if time allows)
  
  
  
• ECE 559: MOS VLSI Design, Spring 2006, Fall 2007
  An introduction to most aspects of large scale MOS integrated circuit design including: device fabrication and modeling; inverter characteristics designing CMOS combinational and sequential circuits; designing arithmetic building blocks and memory structures; interconnect and timing issues; testing and verification; and system design considerations. Term project involves the complete design of a functional logic block or system using CAD tools.
  
  Prerequisite: ECE 305 or Consent of instructor.
  
  Textbook: Neil H. E. Weste and David Harris, CMOS VLSI Design, A Circuits and Systems Perspective, Third Edition. Addison Wesley, ISBN 0-321-14901-7, 2005.
  
  Topics:
  • Introduction: Historical Perspective and Future Trend; CMOS Process, The MOS transistor, CMOS Logic, Pass transistors and Transmission gates
  • TriState , MUX, and Latches, Introduction to VLSI Lab and Mentor Tools
  • Fabrication Processes, Design Rules, Stick Diagrams and Layouts
  • Design Partitioning, testing & packaging
  • MOS Transistor Theory, C-V characteristics, Secondary Effects
  • DC characteristics, Pass Transistors DC characteristics, CMOS Processing technology
  • Circuit Characterization and Performance Estimation, Circuit Simulations
  • Combinational Circuit Design
  • Sequential Circuit Design
  • Design Methodology and Tools
  • Testability
  • Datapath Subsystems
  • Array Subsystems
  • Project Presentations and review
  
  
  
• ECE 365: Introduction to the Design of Digital Computers, Spring semesters
  The hardware organization of computer systems including the following topics: instruction set selection, arithmetic/logic unit design, hardwired and microprogrammed control systems, memory organization, I/O interface design, computer simulation of digital systems.
  
  Prerequisite: ECE 270 and 362.
  
  Prerequisites by topic: Digital devices, Number representation and codes, Computer programming.
  
  Textbook: C. Hamacher et al., Computer Organization, Fifth Edition, McGraw-Hill, 2002. ISBN: 0-07-232086-9
  
  Goals: The student, upon completion of this course, should have a good understanding of the hardware organization of computers. The student should be able to design and analyze both small computer systems and computer interface equipment.
  
  Outcomes: Upon completion of the course, the student should be able to
  • Identify the components needed in digital computers.
  • Use different addressing modes and different instruction to develop assembly code programs.
  • Design a control strategy for a digital computer using a hardwired or microprogrammed approach.
  • Analyze the I/O organization of a digital computer.
  • Describe the function and operation of a DMA controller.
  • Design an Arithmetic Logic Unit.
  • Analyze the execution of instructions for a pipelined processor.
  • Describe the function and analyze the performance of the various components in the memory hierarchy.
  
  
  
• ECE 201: Linear Circuit Analysis I, Fall 2006.
  Volt ampere characteristics for circuit elements; independent and dependent sources; Kirchhoff's laws and circuit equations. Source transformations; Thevenin's and Norton's theorems; superposition. Transient response of resistor capacitor (RC), resistor inductor (RL) and resistor inductor capacitor (RLC) circuits, sinusoidal steady state and impedance. Instantaneous and average power.
  
  Prerequisite: MATH 261 and PHYS 251.
  
  Prerequisites by topic: Transcendental functions, methods of integration, polar coordinates.
  
  Textbook: Charles L. Alexander and Matthew N. O. Sadiku, Fundamentals of Electric Circuits, McGraw-Hill, 2007. ISBN 0-07-325643-9.
  
  Goals: To teach sophomore engineering students electric circuit analysis techniques beginning with DC circuit analysis and ending with AC circuits.
  
  Outcomes: Upon completion of the course, the student should be able to
  • Solve problems using basic principles, conventions, and procedures involving voltages, currents, power, and passive sign convention.
  • Describe circuit elements using their i-v relationships including resistors, dependent sources, capacitors, and inductors.
  • Solve problems using Ohm's Law, Kirchhoff's Voltage Law, Kirchhoff's Current Law, linearity, and the maximum power theorem.
  • Solve problems using resistance and DC source combinations.
  • Solve problems using basic techniques such as current division, voltage division, node-voltage analysis, mesh analysis, and superposition.
  • Solve problems having operational amplifiers.
  • Determine the transient response of first-order RL and RC circuits to initial conditions.
  • Determine the total response of first-order RL and RC circuits to DC sources, both switched and unswitched.
  • Determine the steady-state response of linear RLC circuits to sinusoidal inputs using phasor mathematics.
  • Determine the instantaneous power, the average power, apparent power, and the complex power associated with a circuit element.
  • Determine the power factor of impedance.
  • Determine the effective values of sine and cosine voltages and currents and use them in average power calculations.