EECS 144/244

Fall 2015


Fall 2015 edition
Fall 2014 edition
Fall 2013 edition
Spring 2013 edition
Fall 2011 edition


Course Development

EECS 144/244 Lectures (subject to change)

(click on title for slides in PDF)
No. Date Topic Reading Milestones
1a 8/29 Introduction, Logistics Special issue of IEEE Solid-State Circuits Magazine  
1D 8/31 Perl Tutorial [JR] (video - contact TAs for username/password)   9-10am, 540 Cory
1b 8/31 Design Methodologies: RTL Flow, Analog/Mixed-Signal Design, Model-Based Design (to be covered later).    
 9/5 No lecture, Labor Day holiday    
2D 9/7 Timing Analysis - Discussion on Algorithms & Complexity [SAS] Appendix B of Lee and Seshia 9-10am, 540 Cory
2b 9/7 Timing Analysis - 1 [SAS] In-class handout (also posted on bSpace):Chapter 5 of Timing" by S. Sapatnekar
Optional: Chapter 15 of Lee and Seshia
HW 1 out (on bspace):hw1_files
3a 9/12 Timing Analysis - 2 [SAS] Floating-Mode Delay paper, Devadas et al.  
3D 9/14 Software Engineering Best Practices 1 [EAL] Resources 9-10am, 337 Cory
3b 9/14 Retiming [EAL] Shenoy, N, "Retiming: Theory and Practice" HW 1 due 9/18; HW 2 out
4a 9/19 Basic Boolean algebra and logic optimization [SAS]    
4D 9/21 Software Engineering Best Practices 2 [EAL]   9-10am, 540 Cory
4b 9/21 Boolean algebra and logic optimization (contd.) [SAS] Multi-level logic synthesis paper (Sections I-IV, topics mentioned in the slides)  
5a 9/26 Binary Decision Diagrams (BDDs) [SAS] ACM Computing Surveys paper: Required reading; Knuth's chapter: optional reading HW 2 due; HW 3 out (on bspace):hw3_files
5D 9/28 Observability and controllability (stuck-at testing) [SAS] Goel '81; Larrabee '92 9-10am, 540 Cory
5b 9/28 Boolean satisfiability (SAT) solving [SAS]
Other slides: DLL-Example-1, DLL-Example-2, BCP Introduction, BCP 2-literal watching.
CACM Article on SAT  
6a 10/3 Reachability analysis (sequential equivalence checking) [SAS] Ch. 14 of Lee & Seshia  
6D 10/5 Temporal Logic [SAS] Ch. 12 of Lee & Seshia 9-10am, 540 Cory
6b 10/5 Model Checking [SAS] Clarke, Grumberg, Long paper HW 3 due; HW 4 out (on bspace):hw4_files
7a 10/10 Midterm 1 review    
7D 10/12 No discussion section: Highly recommended to attend guest lecture in DREAM Seminar series, 10/17, 4-5 pm in DOP Center   9-10am, 540 Cory
7b 10/12 Midterm 1 (in class)    
8a 10/17 Synchronous Systems [EAL] Malik, Cyclic Combinational Circuits, 1994 and Edwards and Lee, Synchronous, 2003 HW 4 due
8D 10/19 Discussion: Posets and Fixed-Point Theorems [EAL]
  • Edward A. Lee (2011), Concurrent Models of Computation: An Actor-Oriented Approach, Chapter 1: Partially Ordered Sets.
  • 9-10am, 540 Cory
    8b 10/19 Symbolic Execution [EAL] Shiple Et. Al, CyclicCircuits, 1996 HW 5 out
    10a 10/24 From Discrete to Continuous [EAL] Ptolemeus, Draft, 2011  
    10D 10/26 Continuous-time modeling [JR] Reading: Chapters 2 and 3 of this link  
    10b 10/26 The Newton-Raphson algorithm [JR] Reading: Chapter 4 of this link 9-10am, 540 Cory
    11a 10/31 Newton-Raphson (contd.) [JR]  
    11D 11/2 Continuous Random Variables and Stochastic Processes [JR]   9-10am, 540 Cory
    11b 11/2 Solving sparse linear systems [JR](video - contact TAs for username/password)   HW 5 due; HW 6 out; HW 6 (SDF)
    9a 11/7 Scheduling algorithms - 1 [EAL] Lee & Messerschmitt, SDF  
    9D 11/9 TBA   9-10am, 540 Cory
    9b 11/9 Scheduling algorithms - 2 [EAL] Sih & Lee, Parallel Scheduling Geilen & Stujik, Scenarios  
    12a 11/14 Basics of numerical ODE solution [JR] Reading: Chapter 5 of this link  
    12D 11/16 Continuous Random Variables and Stochastic Processes (contd.) [JR] (video - contact TAs for username/password)   9-10am, 540 Cory
    12b 11/16 Basics of numerical ODE solution (contd.) [JR]    
    13a 11/21 Sinusoidal Steady State ("AC") Analysis of Linear DAEs [JR]   HW 6 due
    13D 11/23 TBA   9-10am, 540 Cory
    13b 11/23 Lecture   HW 7 out
    14a 11/28 Lecture   HKN course survey
    14D 11/30 TBA   9-10am, 540 Cory
    14b 11/30 Midterm 2 (in class)   HW 7 due on 12/2
      12/5 NO CLASS: RRR week.    
      12/7 Project Presentation    

    ©2002-2018 U.C. Regents