Digital System Design I

EEEN10131 Digital System Design I 10 Semester 1 Undergraduate Level 1 Zhipeng Wu Unit coordinator 1 FHEQ level (Framework for Higher Education Qualifications) ' First part HE study/Bachelors ' European Credit Transfer & Accumulation System Rating : 5.0 The Unit includes the following contents:Introduction to Number SystemsBinary, Hexadecimal, OctalBoolean AlgebraAND, OR, NOT, Exclusive OR functionsCombined functionsLogical Dual and De Morgans TheoremBoolean TheoremsManipulating Logic ExpressionsCombinational Logic Circuit DesignThe Truth TableMinterms, canonical sum-of-products, don’t care termsNAND, NORCost of ImplementationAlgebraic Logic ReductionKarnaugh map - implicants, prime implicants, essential prime implicantsMulti-level logicLogic Functions - Multiplexer, Demultiplexer, Decoder, AdderHazards - static, dynamic, function, essentialReduced Dimension Maps - map-entered variablesQuine-McCluskey logic reduction - prime implicant tableMaxterms & Product of SumsMixed LogicSequential Logic Circuit DesignBistable devices : latches and flip-flopsSR, D-type latchMaster-Slave, positive edge-triggered Flip-Flop : D-type and JKSequential FunctionsShift register, twisted ring counter, linear feedback shift register, binary counterFinite State Machines - synchronous designArchitectureMealy and Moore state machinesLogic Synthesis - state diagram, state table, state reduction, state assignment, next-state and output functionsState Machine DiagramMetastability - Setup and HoldImplementation of simple FSM using Field Programmable Logic DeviceLaboratory ExercisesIntroduction to the design of simple combinatorial and sequential circuits that are implemented on a breadboard and then tested using virtual instruments running on a PC. The Unit includes the following contents:Introduction to Number SystemsBinary, Hexadecimal, OctalBoolean AlgebraAND, OR, NOT, Exclusive OR functionsCombined functionsLogical Dual and De Morgans TheoremBoolean TheoremsManipulating Logic ExpressionsCombinational Logic Circuit DesignThe Truth TableMinterms, canonical sum-of-products, don’t care termsNAND, NORCost of ImplementationAlgebraic Logic ReductionKarnaugh map - implicants, prime implicants, essential prime implicantsMulti-level logicLogic Functions - Multiplexer, Demultiplexer, Decoder, AdderHazards - static, dynamic, function, essentialReduced Dimension Maps - map-entered variablesQuine-McCluskey logic reduction - prime implicant tableMaxterms & Product of SumsMixed LogicSequential Logic Circuit DesignBistable devices : latches and flip-flopsSR, D-type latchMaster-Slave, positive edge-triggered Flip-Flop : D-type and JKSequential FunctionsShift register, twisted ring counter, linear feedback shift register, binary counterFinite State Machines - synchronous designArchitectureMealy and Moore state machinesLogic Synthesis - state diagram, state table, state reduction, state assignment, next-state and output functionsState Machine DiagramMetastability - Setup and HoldImplementation of simple FSM using Field Programmable Logic DeviceLaboratory ExercisesIntroduction to the design of simple combinatorial and sequential circuits that are implemented on a breadboard and then tested using virtual instruments running on a PC. The course unit aims to: Introduce students to the fundamentals of combinatorial and sequential logic circuit design. This will provide students with the fundamental techniques that are the basis of digital system design as employed in modern computer-aided design tools such as VHDL that is introduced in year 2. Ultimately such skills can lead to employment opportunities in electronic systems design, for instance mobile technologies, computer design and silicon chip design.  ILO 1 - Design basic combinatorial and sequential logic circuits.ILO 2 - Create finite state machines.ILO 3 - Implement simple digital circuits on circuit boards.ILO 4 - Logic circuit design with optimised Boolean expressions.ILO 5 - Perform analogue and digital measurements on digital circuits using virtual instruments running on a PC.  The unit is taught through scheduled lectures (weekly), which is further supported by the following:laboratories (completed within 4 weeks period),tutorials (weekly and in lecturing slots),e-learning through Blackboard (inc. quizzes and exercises, weekly after lectures). 0 Other 20% 1 Written exam 80% Coursework 1:Laboratory 1. Combinatorial logic circuitsLaboratory 2. Sequential logic circuitsAssessed by two reports submitted at the end of each lab session.Length: 2 sessions of 3 hours eachHow and when feedback is provided: Marked reports and returned within 2 weeks of completions of the labsWeighting: 10%Coursework 2:Tutorial questions as defined by tutorial scheduleHow and when feedback is provided: Assessed by 1st year tutors; Weekly feedback through tutorsWeighting: 10% Coursework 1: How and when feedback is provided: Marked reports and returned within 2 weeks of completions of the labsCoursework 2: How and when feedback is provided: Assessed by 1st year tutors; Weekly feedback through tutors N “Logic & Computer Design Fundamentals”  by M. Morris Mano and Charles R. Kime, Pearson(ISBN 9781292037363, ISBN 978-0-13-198926-9)“Digital Logic Design” (4th edition) by Brian Holdsworth and Clive Woods“Contemporary Logic Design” (1st Edition) by Randy Katz, Benjamin Cummings 1993 (ISBN 0805327037)“Modern Logic Design” by D.H. Green, Addison Wesley 1986 (ISBN 0201145413) Lectures 22 Practical classes & workshops 6 Tutorials 5 0 67