CS M51A / EE M16
Winter 2016
Homework #5
Problem 1: Implement the following program repeatedly using a single 8-bit
adder/subtracter (AS) module, 8-bit registers, as few as possible as small as possible
counters and combinational modules of your choice.
T
Name
First
Last
Student ID #
Random #
University of California
Los Angeles
Computer Science Department
CSM51A Sec 2 Final Exam
Winter Quarter 2009
March 19, 2009
This is a closed book exam. Absolutely nothing is permitted except pen, pencil and
eraser to
Name
First
Last
Student ID #
University of California
Los Angeles
Computer Science Department
CSM51A/EEM16 Final Exam
Fall Quarter 2012
Dec. 12th 2012
This is a closed book exam. Absolutely nothing is permitted except pen, pencil and eraser to
write your
Discussion Note (Midterm Review) EEM16 week7 1. State diagram Mealy and Moore machines Draw the state diagram for a pattern recognizer that has one input with values 0 and 1, and outputs a 1 whenever the input sequence contains two 1s
Discussion Note EEM16 Week6 1. Encoder and Decoder Design a combinational network that has a three-bit input x representing the digits 0 to 7, and a three-bit output y representing the same set of integers. The function of the system is
Discussion Note EEM16 Week5 1. Timing characteristics 2. Design and implementation - counter Design a 3 Flip-flop counter which transitions through states Q2Q1Q0 = 000, 100, 110, 111, 011, 001 and then repeats. (a) Draw the state d
Discussion Note EEM16 Week4 1. Time behavior -> state description -> state diagram Ex. 7.11 Describe the time behavior of a modulo-p counter assuming that any of the p states can be the initial state. 2. Mealy and Moore machines
Discussion Note EEM16 Week3 1. Two-level gate networks with multiple outputs Design a 7-segment decoder to display a binary coded decimal (BCD) digit. 2. Two-level gate networks with 5 variables Design a single-error detector for the 2-out-of-5 c
Discussion Note EEM16 Week2 1. Canonical forms - Ex 2.41 Determine the sum of minterms and product of maxterms that are equivalent to E(x,y,z) = x + x (xy+yz) 2. Generalized DeMorgans theorem (A+B+C+D+Z)=ABCDZ (ABCD.Z)=A+B+C+D+.+Z 3. Karanugh map Exercise
Discussion Note EEM16 Week1 1. Digital signal v.s. analog signal 2. Number system (i) (47)10 = (?)2 (ii) Ex. 2.13 (a) Determine the radix-16 representation of the integer whose radix-2 representation is 1001010100011110.
Hint: partition the radix vector i
DESIGN OF MULTILEVEL NETWORKS
1
TRANSFORMATIONS TO SATISFY CONSTRAINTS - number of gate inputs - network size - network delay DESIGN OF NETWORKS WITH xor and xnor GATES DESIGN OF NETWORKS WITH multiplexers (muxes)
Introduction to Digital Systems
6 Design
DESIGN OF GATE NETWORKS
1
DESIGN OF TWO-LEVEL NETWORKS: and-or and or-and NETWORKS MINIMAL TWO-LEVEL NETWORKS KARNAUGH MAPS MINIMIZATION PROCEDURE AND TOOLS LIMITATIONS OF TWO-LEVEL NETWORKS DESIGN OF TWO-LEVEL nand-nand and nor-nor NETWORKS PROGRAMMABLE
COMBINATIONAL ICs
REPRESENTATION OF BINARY VARIABLES AT THE PHYSICAL LEVEL BASIC SWITCH. STRUCTURE OF GATES AND THEIR OPERATION REALIZATION OF GATES USING cmos CIRCUITS
1
CHARACTERISTICS OF CIRCUITS: LOAD FACTORS AND FANOUT FACTORS, PROPAGATION DELAYS,
INTRODUCTION TO DIGITAL SYSTEMS DESCRIPTION AND DESIGN OF DIGITAL SYSTEMS FORMAL BASIS: SWITCHING ALGEBRA IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN \HARDWARE" COURSE EMPHASIS: CONCEPTS, ANALYSIS AND DESIGN Follow-on course