1 CSE370, Lecture 25 Lecture 1: CSE 370 Introduction u Welcome!!! u Instructor: Yoky Matsuoka u TA: Brian Dellon,

Slides:



Advertisements
Similar presentations
CEG3420 L1 Intro.1 Copyright (C) 1998 UCB CEG3420 Computer Design Lecture 1 Philip Leong.
Advertisements

ECE 331 – Digital System Design
Math 115b Section 1 (Summer 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
Math 115b Section 5(Spring 06)  Instructor: Kerima Ratnayaka   Phone :  Office.
Math 115b Section 1H(Spring 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.
MATH 330: Ordinary Differential Equations Fall 2014.
1 CSE370, Lecture 1 Lecture 1: CSE 370 Introduction u Welcome!!! u Instructor: Paul Beame u TA: Sara Rolfe, Josh.
Slide 1 Instructor: Dr. Hong Jiang Teaching Assistant: Mr. Sheng Zhang Department of Computer Science & Engineering University of Nebraska-Lincoln Classroom:
ECE 232 L1 Intro.1 Adapted from Patterson 97 ©UCBCopyright 1998 Morgan Kaufmann Publishers ECE 232 Hardware Organization and Design Lecture 1 Introduction.
Test Preparation Strategies
ECS15: Introduction to Computers Fall 2013 Patrice Koehl
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
CS1104: Computer Organisation Welcome (AY2006/7 Semester 2)
Spring 2008 Mark Fontenot CSE Honors Principles of Computer Science I Note Set 1 1.
Lecture 0 Digital Electronics Fundamentals Computer Architecture and System Software There are 10 kinds of people in this world – those who understand.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CSE 501N Fall ‘09 00: Introduction 27 August 2009 Nick Leidenfrost.
COMP Introduction to Programming Yi Hong May 13, 2015.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Lecture #1 Page 1 ECE 4110– Digital SystemDesign.
SE-308 Software Engineering-II 7th Term SE University of Engineering & Technology Taxila, Pakistan Software Engineering Department.
CPS120: Introduction to Computer Science Fall: 2002 Instructor: Paul J. Millis.
CPSC 321 Introduction to Logic Circuit Design Mihaela Ulieru (‘Dr. M’)
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
ECEN 248: INTRODUCTION TO DIGITAL DESIGN
CS355 Advanced Computer Architecture Fatima Khan Prince Sultan University, College for Women.
Catie Welsh January 10, 2011 MWF 1-1:50 pm Sitterson 014.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
1 Principles of Computer Science I Note Set 1 CSE 1341.
1 CPRE210: Introduction to Digital Design Instructor –Arun K. Somani –Tel: – –Office Hours: MWF 10:00-11:00 Teaching Assistant.
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
CS/EE 3700: Fundamentals of Digital System Design Chris J. Myers Spring
Course Information Sarah Diesburg Operating Systems COP 4610.
Econ 3320 Managerial Economics (Fall 2015)
1 CSE370, Lecture 19 Lecture 19 u Logistics n Lab 8 this week to be done in pairs íFind a partner before your lab period íOtherwise you will have to wait.
CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.
Digital Logic Design and Lab School of EECS Seoul National University.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
CPS120: Introduction to Computer Science Winter 2002 Instructor: Paul J. Millis.
Matter and Interactions 1 Fall 2006 Matter & Interactions I Physics Professor & Lecturer: Dr. Reinhard Schumacher Teaching Assistants: Ms. Elisa.
1 CSE370, Lecture 18 Lecture 20 u Logistics n HW6 due Wednesday n Lab 7 this week (Tuesday exception) n Midterm 2 Friday (covers material up to simple.
Evaluation & Assessment 10/31/06 10/31/06. Typical Point Breakdown COURSE GRADES: Grades will be assigned on the basis of 450 points, distributed as follows:
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
CEC 220 Digital Circuit Design Wednesday, January 7 CEC 220 Digital Circuit Design Slide 1 of 12.
1 CSE370, Lecture 26 Lecture 26 u Logistics n Ant extra credit problem due today n Extra lab check-off times íMonday 12:30-4:20 íTuesday 12:00-2:00 n All.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
CEC 220 Digital Circuit Design Monday, August 24 CEC 220 Digital Circuit Design Slide 1 of 13.
1 Lecture 24 Transistors A look ahead Course summary.
WELCOME TO MICRO ECONOMICS AB 224 Discussion of Syllabus and Expectations in the Class.
Spring 2008 Mark Fontenot CSE 1341 – Honors Principles of Computer Science I Note Set 1 1.
1 CSE370, Lecture 10 Lecture 10  Logistics  HW3 due now  Solutions will be available at the midterm review session tomorrow (and at the end of class.
CS101 Computer Programming I
Lecture 28 Logistics Today
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Welcome to CS 1010! Algorithmic Problem Solving.
Lecture 28 Logistics Today
Lecture 21 Logistics Today
Lecture 15 Logistics Last lecture Today HW4 is due today
Lecture 20 Logistics Last lecture Today HW6 due Wednesday
CS 232 Geometric Algorithms: Lecture 1
Presentation transcript:

1 CSE370, Lecture 25 Lecture 1: CSE 370 Introduction u Welcome!!! u Instructor: Yoky Matsuoka u TA: Brian Dellon, Vince Zanella, undergrad TA TBA u Class Webpage 1

2 CSE370, Lecture 25 Where to find help u Yoky Matsuoka n Office: CSE 650 n Office hours: Mondays and Fridays 8:45-9:30am n u TA: Brian Dellon n Office hours: Tuesdays 4-5:30pm in CSE650 n u TA: Vince Zanella n Office hours: Mondays 4-5:50pm in n u TA: TBA u u Will set up a class list, anonymous, TA, etc. 1

3 CSE370, Lecture 25 Lectures and Labs u Lecture: MWF 10:30-11:20am, Gowen Hall 201 íIntroductory course in digital logic and its specification and simulation. Boolean algebra, combinatorial circuits including arithmetic circuits and regular structures, sequential circuits including finite-state-machines, use of programmable logic devices. Simulation and high-level specification techniques are emphasized. íPlease ask lots of questions in lecture. u Labs: n section AA T 9:30-12:20, CSE 003 n Section AB W 3:30-6:20, CSE 003 n Section AC M 2:30-5:20 CSE still open íThe hands-on laboratory meets 3 hours once a week. It provides students an opportunity to put what they learn in lecture to practice using digital logic prototyping kits and modern computer-aided design tools. Laboratory topics will be aligned to lecture and homework topics. 1

4 CSE370, Lecture 25 “Why” take CSE 370 u Required (okay, but let’s talk about why it is required and will be useful for your future) u Most basic building blocks of computer science (0’s and 1’s) u It is important to understand how they are used as baseline for more complex operations (adding, storing, other logic like if/while) u It is like studying anatomy of neurons and neuronal connections if you want to become a neuroscientist (even if you become a computational neuroscientist). u It is good to understand what can be implemented in hardware, and why it is sometimes good to implement certain things on hardware instead of software u Understand how some of the technology you interact with on daily basis (memory stick, vending machine, etc) at the hardware logic level. u Knowledge gained in this course is used directly in industry/research 1

5 CSE370, Lecture 25 Class Goals u Understanding of digital logic at the gate and switch level including both combinational and sequential logic elements. u Understanding of the clocking methodologies necessary to manage the flow of information and preservation of circuit state. u An appreciation for the specification methods used in designing digital logic and the basics of the compilation process that transforms these specifications into logic networks. u Facility with a complete set of tools for digital logic design with programmable logic devices as the implementation technology and the realization of medium-sized state machine controller and data paths using PLDs and discrete logic. u To begin to appreciate the difference between hardware and software implementations of a function and the advantages and disadvantages of each. u Understand “how” these concepts are used in real world and “why” it is useful for us to know. 1

6 CSE370, Lecture 25 Syllabus 1 u Combinational logic basics n Binary/hex/decimal numbers n Ones and twos complement arithmetic n Truth tables n Boolean algebra n Basic logic gates n Schematic diagrams n Timing diagrams n de Morgan's theorem n AND/OR to NAND/NOR logic conversion n K-maps (up to 4 variables), logic minimization, don't cares n SOP, POS n Minterm and maxterm expansions (canonical, minimized) 25 1 I like Pink and Blue but not Yellow…

7 CSE370, Lecture 25 Syllabus 2 u Combinational logic applications n Combinational design íInput/output encoding íTruth table íK-map íBoolean equation íSchematics n Multiplexers/demultiplexers n PLAs/PALs n ROMs n Adders ????

8 CSE370, Lecture 25 Syllabus 3 u Sequential logic building blocks n Latches (R-S and D) n Flip-flops (D and T) n Latch and flip-flop timing (setup/hold time, prop delay) n Timing diagrams n Asynchronous inputs and metastability n Registers 1 Remember that the last number was 1

9 CSE370, Lecture 25 Syllabus 4 u Counters n Timing diagrams n Shift registers n Ring counters n State diagrams and state-transition tables n Counter design procedure 1. Draw a state diagram 2. Draw a state-transition table 3. Encode the next-state functions 4. Implement the design n Self-starting counters 1 1, 2, 3, 4, …

10 CSE370, Lecture 25 u Finite state machines n Timing diagrams (synchronous FSMs) n Moore versus Mealy versus synchronized Mealy n FSM design procedure 1.State diagram 2.state-transition table 3. State minimization 4. State encoding 5. Next-state logic minimization 6. Implement the design n State minimization n One-hot / output-oriented encoding n FSM design guidelines íSeparate datapath and control n Pipelining, retiming partitioning basics Syllabus 5 1 Food! start The last coin was 25cents and already had 50cents deposited so let’s pop out a soda

11 CSE370, Lecture 25 Tentative class schedule 1 WeekMondayWednesdayFriday 09/24Introduction9/26Binary number systems 1 Lab1 9/29Boolean algebra10/1Boolean algebra Homework1 due 10/3Logic gates/truth tables 2 Lab2 10/6Canonical forms10/8Boolean Cubes Homework2 due 10/10Verilog introduction 3 Lab3 10/13Karnaugh maps10/15Multiplexors10/17PLDs Homework3 due 4 Lab4 10/20Review10/22MIDTERM110/24Multi-level logic 5 Lab5 10/27Adders10/29Flip flops Homework4 due 10/31State Diagrams Timing Diagrams 6 Lab6 11/3Timing Diagrams11/5Finite State Machines Homework5 due 11/7More FSM 7 Lab7 11/10Moore/Mealy11/12Review Homework6 due 11/14MIDTERM2 8 Lab8 11/17FSM Robot11/19FSM robot Simplification11/21Simplification Homework7 due 9 Lab9 11/24Encoding11/26NO CLASS Thanksgiving 11/28NO CLASS Thanksgiving 1012/1Partitioning12/3Applications Homework8 due 12/5Review 1112/8FINAL EXAM (cumulative) 12/8 8:30am Gowen 201

12 CSE370, Lecture 25 u Lectures: Attendance and participation of all of them is strongly encouraged and expected. Lecture materials are closest to what is covered in the exams (over homework or lab). If you come to the lectures, you will likely do better on the exams. u Laboratory: There will be 9 weekly lab assignments (the last assignment spans 2 weeks). Although you'll be able to use the lab all week, attendance at one of the scheduled times is very important as that is when the TA will be available. We will work hard to ensure that the laboratory assignments take no more than the three hour sessions to complete. You should attend the session for which you are registered. With permission of the TA, you can attend the other section in case of unusual circumstances. u Assignments: There will be 8 weekly homework assignments. They will be based on topics covered in lectures. There will be also reading assignments from the Contemporary Logic Design (2nd edition) text each week which is critical to keep up with the class materials. u Exams: There are two in-class midterms (10/22 and 11/14) and one final exam during finals week (likely 12/8). Class Structure 1

13 CSE370, Lecture 25 u Your course grade will be computed as follows: n 30% homework assignments íHomework assignment is due at the beginning of the class (10:30am) in class. 10% penalty is applied 24 hours late, and 20% penalty is applied 48 hours late. After 10:30am 2 days after the due date, the solution will be posted and assignment will no longer be accepted. n 20% lab assignments íThe lab grades are based on completion checked by the TAs. Don’t fall behind because each lab is worth more than 2% of your grades! n 15% for each midterm (so 30% total) n 20% final exam (cumulative but strong emphasis on materials after both midterms) u We will not curve this class --- so the student next to you doing well does not affect your grades (and we want all of you to do well). For example, last quarter, the average was ~3.6. We also provide extra credit assignments/labs. Class Policy: Grading 1

14 CSE370, Lecture 25 u Collaboration n Unless specifically stated otherwise, we encourage collaboration on assignments, provided (1) you spend at least 15 minutes on each and every problem alone, before discussing its general concepts with others, (2) you only discuss general concepts or related examples - not the specifics of a problem on the assignment, and (3) you write up each and every problem in your own writing, using your own words, and understand the solution fully. Copying someone else's work is cheating (see below), as is copying the homework from another source (e.g., prior year's notes, etc.). Please write down the name of classmates you collaborated with at the top of your assignment. u Cheating n Cheating is a very serious offense. If you are caught cheating, you can expect a failing grade and initiation of a cheating case in the University system. Basically, cheating is an insult to the instructor, to the department and major program, and most importantly, to you and your fellow students. If you feel that you are having a problem with the material, or don't have time to finish an assignment, or have any number of other reasons to cheat, then talk with the instructor. Just don't cheat. n To avoid creating situations where copying can arise, never or post your solution files in public directories. You can post general questions about interpretation and tool use but limit your comments to these categories. If in doubt about what might constitute cheating, send the instructor describing the situation. Class Policy: Collaboration and Cheating 1

15 CSE370, Lecture 25 u Workload n We will try to ensure that the workload is typical for a four-credit course, namely, nine to twelve hours per week outside of the lectures. If we do not succeed, please let us know explain which parts of the course are causing you to spend too much time non-productively. n We have structured the course so that spending an hour or two per day will maximize your efficiency. You will work this way in the real world—you cannot cram a three-month design assignment into the last night—so you may as well work this way now. Plus, you will understand the material better. If you leave the homework for the day before it is due, then you will not have time to study for the exams, and you will not have time to ask questions when (not if) the software misbehaves. u Assignment n The homework assignments are generally due on Wednesdays at the beginning of class (except when there is an exam or a holiday). The homework assignment will be distributed approximately one week before the due date. n Your assignments must be neat and legible. We will not spend time trying to decipher messy work. We urge you to use the graphical and word processing tools that are readily available to you in all the labs in the department. Please make good use of the schematic diagram editor in the tools you'll be using to make neat circuit diagrams to include in your assignments. n Assignment problems will sometimes be graded on a random basis. To get full credit for an assignment, you must, of course, turn-in solutions for each assigned problem. Only a subset of the problems will actually be graded in detail. You will not know in advance which problems this will be - so make sure to do all of them. n Please review the assignment solutions carefully before questioning a grade with either the instructor or the teaching assistants. Class Guidelines 1

16 CSE370, Lecture 25 u Exams n We have two midterms and one final exams. I heard smaller quizzes were not taken seriously in the past and one midterm was too stressful. We welcome feedback. There will be no make-up exams so schedule your term accordingly. u Software n Software tools frequently consume more time then they should. We have designed the assignments to get you up to speed gradually (over the period of a few weeks), but undoubtedly there will be some start-up cost (as with any new tool). Essentially, you are learning a new language, a compiler, and getting familiar with a process. Every tool imposes a certain model. Your frustration can be high until you assimilate that model and learn to use it effectively. Be sure to use the tutorials, and do not spend countless hours making no progress. Ask for help. Remember that these tools are written by engineers for engineers and will not necessarily conform to expectations you may have of consumer-oriented tools such as Word. Class Guidelines (cont’d) 1