COURSE SYLLABUS- DS 763CA				(REVISED 1/22/97)

TV Program Cal VIEW					Spring 1997 Consultant:
205 Mc Laughlin Hall					Serdar Tasiran	       
College of Engineering					Office Hours: Tues & Thurs 9 am
University of California 			        E-Mail: serdar@ic.eecs.berkeley.edu     
Phone: (510) 642-5776					Phone: (510) 642-5776
Fax: (510) 643-5877					Fax: (510) 643-5877    



NATIONAL TECHNOLOGICAL UNIVERSITY
DS 763CA - Spring 1997 - 3 Units
Logic Synthesis For Hardware Systems
Professor Robert Brayton
(UC Berkeley EECS 219B)


Special Note:  This syllabus reflects the sequence of lectures as it was
videotaped in the Spring of 1996.   You must take the exams by the
deadlines below.  If you have a conflict, call BEFORE the deadline to
arrange an alternative time.  


Mon, January 27				Conference Call Sign-Up: Please call the Cal VIEW
					office at (510)642-5776 to sign up for the conference
					call with Serdar on 1/29.

Tues, January 28			Lecture 1 - Boolean functions, Shannon cofactors
					HW #1 Sent out.

Weds, January 29                   	Conference Call
					with Serdar at  9  am PST.

Thur, January 30			Lecture 2 - Incompletely specified functions, unate 
					functions, unate reduction

Mon - Fri, February 3 - 7		Conference Call with Professor Brayton, exact day and
					time will be posted later.

Tues, February 4       			Lecture 3 - Unate recursive paradigm, tautology checking, 
					Quine-McCluskey procedure				
					HW #1 Due, HW #2 Sent out

Thur, February 6			Lecture 4 - Generalized cofactor, Espresso, irredundant 
    					cover.

Tues, February 11			Lecture 5 - Expanding a cube, reducing a cube
					HW #2 Due, HW #3 Sent out

Thur, February 13			Lecture 6 - Multi-valued logic functions

Tues,  February 18			Lecture 7 - Cofactoring, unateness, tautology checking for 
					multi-valued logic
					HW #3 Due, HW #4 Sent out

Thur, February 20 			Lecture 8 - Multi-valued minimization, binary decision 
					diagrams (BDDs)
	
Week of 2/24 - 2/28			EXAM 1 DUE: Must be postmarked by 2/28.
	
Tues, February 24			Conference Call Sign-Up: Please call the Cal VIEW
					office at (510)642-5776 to sign up for the conference
					call with Serdar on  2/26.
			
Tues, February 25			Lecture 9 - BDDs (contd.), multi-level networks
					HW #4 Due

Weds, February 26                      	Conference Call with Serdar at  9 am PST.

Thur, February 27			Lecture 10 - Multi-level networks (contd.), node 
					represetation, factored forms 
						
Tues, March 4				Lecture 11 - Optimum factored forms, division
					HW #5 Sent out

Thur, March 6				Lecture 12 - Boolean division, algebraic division, kernel
					extraction

Tues, March 11  			Lecture 13 - Factoring, decomposition,
					resubstitution, fast kernel extraction
					HW #5 Due, HW #6 Sent out
							
Thurs, March 13				Lecture 14 - Node minimization, satisfiability and 
					observability don't cares, transduction

Tues, March 18				Lecture 15 - Transduction (contd.), compatible set of 
					permissible functions (CSPF), set of implementable
					functions
					HW #6 Due, HW #7 Sent out

Thur, March 20 				Lecture 16 - BDD computation for maximal set of
					implementable functions, reduced offset method, 	
					full_simplify

Week of March 24 - 28			SPRING BREAK - NO LECTURES

Mon -Fri, March 31 - April 4  		Conference Call with Professor Brayton, 
					exact day and time to be posted later.

Tues, April 1				Lecture 17 - Image computation, minimizing boolean
					relations, fault testing
					HW #7 Due, HW #8 Sent out

Thurs, April 3				Lecture 18 - D-algorithm, PODEM, static and dynamic
					learning methods, SAT-based approach

Week of 4/7 - 4/11   			EXAM #2 DUE: Must be postmarked by 4/11.

Mon, April 7				Conference Call Sign-Up: Please call teh Cal VIEW
					office at (510)642-5776 to sign up for the conference
					call with Serdar on 4/9.

Tues, April 8    			Lecture 19 - Search strategies for testing, technology 
					mapping using DAG-covering
					HW #8 Due

Weds, April 9				Conference Call with Serdar at 9 am PST.

Thurs, April 10				Lecture 20 - Technology
					mapping through optimal tree
					covering, the Lehmann-Watanabe method

Tues, April 15   			Lecture 21 - Timing analysis, critical paths, false paths
					HW #9 Sent out

Thur, April 17    			Lecture 22 - Delay models, delay computation

Tues, April 22               		Lecture 23 - Timing optimization, network restructuring,
					node decomposition
					HW #9 Due, HW #10 Sent out

Thur, April 24				Lecture 24 - Lawler's clustering algorithm, sequential 
					circuits, finite state machines (FSMs), incomplete
					specification

Tues, April 29 				Lecture 25 - FSM extraction, network of FSMs, sequential 
					don't cares, generalization of node minimization to
					sequential logic
					HW #10 Due, HW #11 Sent out
												
Thur, May 1 				Lecture 26 - S1S (second order logic of one successor), 
					E-machine construction, applications of E-machine to 
					sequential synthesis
				
Tues, May 6				Lecture 27 - State minimization 
 					HW #11 Due, HW #12 Sent out

Weds, May 7				Conference Call Sign - Up: Please call the Cal VIEW
					office at (510)642-5776 to sign up for the conference
					call with Serdar on 5/9. 

Thurs, May 8				Lecture 28 - Retiming, algorithms for retiming, FSM
					optimization, resynthesis
					HW #12 Due

Fri, May 9				Conference Call with Serdar at 9 am PST.	

Week of 5/12 - 5/16			EXAM #3 DUE: Must be postmarked by 5/16.