University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science. EECS150, Spring 2011

Similar documents
EECS150 - Digital Design Lecture 3 Synchronous Digital Systems Review. Announcements

Why FPGAs? FPGA Overview. Why FPGAs?

EECS150 - Digital Design Lecture 15 Finite State Machines. Announcements

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science SOLUTIONS

CS150 Fall 2012 Solutions to Homework 4

Final Exam review: chapter 4 and 5. Supplement 3 and 4

Outline Synchronous Systems Introduction Field Programmable Gate Arrays (FPGAs) Introduction Review of combinational logic

More design examples, state assignment and reduction. Page 1

EECS 270 Homework the Last Winter 2017

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

L11/12: Reconfigurable Logic Architectures

Switching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm)

EE 109 Homework 6 State Machine Design Name: Score:

FPGA Design. Part I - Hardware Components. Thomas Lenzi

L12: Reconfigurable Logic Architectures

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science. EECS 150 Spring 2000

CDA 4253 FPGA System Design FPGA Architectures. Hao Zheng Dept of Comp Sci & Eng U of South Florida

The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.

CPS311 Lecture: Sequential Circuits

RELATED WORK Integrated circuits and programmable devices

Logic Design II (17.342) Spring Lecture Outline

Chapter 5 Synchronous Sequential Logic

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output

FPGA Implementation of Sequential Logic

BIST for Logic and Memory Resources in Virtex-4 FPGAs

9 Programmable Logic Devices

The NOR latch is similar to the NAND latch

Quiz #4 Thursday, April 25, 2002, 5:30-6:45 PM

Modeling Latches and Flip-flops

CAD for VLSI Design - I Lecture 38. V. Kamakoti and Shankar Balachandran

Read-only memory (ROM) Digital logic: ALUs Sequential logic circuits. Don't cares. Bus

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

Field Programmable Gate Arrays (FPGAs)

Investigation of Look-Up Table Based FPGAs Using Various IDCT Architectures

Evaluation of Advanced Techniques for Structural FPGA Self-Test

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Good Evening! Welcome!

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

EECS 270 Group Homework 4 Due Friday. June half credit if turned in by June

Examples of FPLD Families: Actel ACT, Xilinx LCA, Altera MAX 5000 & 7000

Faculty of Electrical & Electronics Engineering BEE3233 Electronics System Design. Laboratory 3: Finite State Machine (FSM)

EECS 270 Midterm 2 Exam Closed book portion Fall 2014

Step 1 - shaft decoder to generate clockwise/anticlockwise signals

EECS150 - Digital Design Lecture 18 - Circuit Timing (2) In General...

FE REVIEW LOGIC. The AND gate. The OR gate A B AB A B A B 0 1 1

EN2911X: Reconfigurable Computing Topic 01: Programmable Logic. Prof. Sherief Reda School of Engineering, Brown University Fall 2014

Modeling Latches and Flip-flops

First Name Last Name November 10, 2009 CS-343 Exam 2

A Fast Constant Coefficient Multiplier for the XC6200

EECS150 - Digital Design Lecture 2 - CMOS

FPGA Design with VHDL

Reconfigurable FPGA Implementation of FIR Filter using Modified DA Method

Asynchronous (Ripple) Counters

Chapter 5 Sequential Circuits

Digital Electronics II 2016 Imperial College London Page 1 of 8

Section 6.8 Synthesis of Sequential Logic Page 1 of 8

March 13, :36 vra80334_appe Sheet number 1 Page number 893 black. appendix. Commercial Devices

LFSRs as Functional Blocks in Wireless Applications Author: Stephen Lim and Andy Miller

Catch or Die! Julia A. and Andrew C. ECE 150 Cooper Union Spring 2010

CSCB58 - Lab 4. Prelab /3 Part I (in-lab) /1 Part II (in-lab) /1 Part III (in-lab) /2 TOTAL /8

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger.

In-System Testing of Configurable Logic Blocks in Xilinx 7-Series FPGAs

Digital Circuit Engineering

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

Introduction Actel Logic Modules Xilinx LCA Altera FLEX, Altera MAX Power Dissipation

Good Evening! Welcome!

Reconfigurable Architectures. Greg Stitt ECE Department University of Florida

Lecture 2: Basic FPGA Fabric. James C. Hoe Department of ECE Carnegie Mellon University

ELCT201: DIGITAL LOGIC DESIGN

Flip-Flops A) Synchronization: Clocks and Latches B) Two Stage Latch C) Memory Requires Feedback D) Simple Flip-Flop Gate

COMP sequential logic 1 Jan. 25, 2016

Lab #12: 4-Bit Arithmetic Logic Unit (ALU)

Design and FPGA Implementation of 100Gbit/s Scrambler Architectures for OTN Protocol Chethan Kumar M 1, Praveen Kumar Y G 2, Dr. M. Z. Kurian 3.

Laboratory Exercise 3

EE292: Fundamentals of ECE

Experiment 8 Introduction to Latches and Flip-Flops and registers

3/5/2017. A Register Stores a Set of Bits. ECE 120: Introduction to Computing. Add an Input to Control Changing a Register s Bits

Laboratory Exercise 7

Digital Logic Design I

(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

Unit 11. Latches and Flip-Flops

DESIGN OF HIGH SPEED RECONFIGURABLE COPROCESSOR FOR INTERLEAVER AND DE- INTERLEAVER OPERATIONS

California State University, Bakersfield Computer & Electrical Engineering & Computer Science ECE 3220: Digital Design with VHDL Laboratory 7

Robust Secure FPGA-based Wireless Smart Meters Utilizing PUF and CSI

A S. x sa1 Z 1/0 1/0

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits

Assignment 2b. ASSIGNMENT 2b. due at the start of class, Wednesday Sept 25.

CSE140L: Components and Design Techniques for Digital Systems Lab. CPU design and PLDs. Tajana Simunic Rosing. Source: Vahid, Katz

From Theory to Practice: Private Circuit and Its Ambush

EECS150 - Digital Design Lecture 12 - Video Interfacing. Recap and Outline

When the OR-array is pre-programed (fixed) and the AND-array. is programmable, you have what is known as a PAL/GAL. These are very low

Keywords Xilinx ISE, LUT, FIR System, SDR, Spectrum- Sensing, FPGA, Memory- optimization, A-OMS LUT.

Report on 4-bit Counter design Report- 1, 2. Report on D- Flipflop. Course project for ECE533

COPY RIGHT. To Secure Your Paper As Per UGC Guidelines We Are Providing A Electronic Bar Code

Transcription:

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS150, Spring 2011 Homework Assignment 2: Synchronous Digital Systems Review, FPGA basics Due Feb 3, 2pm Homework submissions are electronic, Please format your homework as plain text with PDF for any necessary figures. 1. The circuit shown below is an equal comparitor. It takes 2 4-bit numbers and outputs a 1 iff the two input numbers are the same in every bit position. a 0 b 0 a 1 x b 1 a 2 z b 2 a 3 y b 3 (a) How many rows does this circuit have in its truth-table? (b) Write down the truth-table for the sub-circuits with outputs at node x and y. 1

2. Consider the 3-input circuit shown below: a b c y (a) Derive and write down its corresponding truth-table. (b) Based on observing the truth-table, is it possible to simplify the circuit (remove some gates)? If so, draw the simplified circuit. 3. Imagine that you are given a collection of 3-input lookup-tables (3-LUTs) and no other elements, and you desire a 5-LUT. Draw a circuit diagram showing how you would create a 5-LUT from the 3-LUTs. 2

4. Consider the circuit shown below. Its function is an odd parity detector the output is a 1 iff the number of input bits that are a 1 is odd. It has M single-bit inputs. Assume that you can choose to use LUTs of any number of inputs, N 2, to implement the function. However, all the LUTs you use must be of the same N. The LUT delay and LUT chip area are related to N: t = c 1 log(n), area = c 2 N. (a) Without reorganizing the above circuit, write an expression for: i. the minimum number of LUTs needed to implement the circuit. ii. the delay through the resulting LUT implementation. iii. the total LUT area. (b) What value of N would you choose to minimizes the delay through the circuit? (c) Now assume you can rearrange the parity detector to help minimize delay and/or minimize area. After LUT mapping, using only 4-LUTs, write expressions for the total delay and total area. How do these compare to your answers above? 3

5. Imagine that you are given an FPGA with the following combinational logic block structure: x 0 x 1 x 2 x 3 3-LUT 0 x 4 x 5 x 6 3-LUT 1 This type of structure is common in FPGAs to easily allow two N-LUTs to be combined to form a (N+1)-LUT. You are asked to implement a 4-input Multiplexor circuit using this FPGA. How many of the above combinational logic blocks would be needed? Show your implementation. 4

6. Using only 4-input lookup tables (LUTs), partition the circuit shown below into as few LUTs as possible. Do not attempt to simplify the gate-level circuit before mapping it to LUTs. Indicate your answer by filling in the table. Fill in one row for each LUT, assigning node names from the circuit to LUT inputs and outputs. Mark unused LUT inputs with X (for unused). a b c d e k f g l n p h i o m j LUT # input 1 input 2 input 3 input 4 output 1 2 3 4 5 6 7 8 5

7. Given the circuit shown below and the configurable logic block (CLB), partition the circuit so that it can be implemented with a collection of CLBs. Try to use as few a number of CLBs as possible. Indicate your answer by filling in the table: one row per CLB used; for the configuration bit, s, write in a 0 or 1, for all other columns write in the name of the signal wire from the logic circuit that corresponds to the CLB input or output, a 0 or 1, or nc for no connection. You may leave some rows blank or add rows. CLB # u v w x y z s 1 2 3 4 5 6 7 8 6

8. Based on the illustration below detailing the Virtex-5 SLICEL, answer the following: (a) Excluding the configuration bits, what is the total number of usable state bits? (b) Suppose the slice were a SLICEM instead of a SLICEL. How many additional useable state bits would then be available? 7

(c) Based on the figure, how many bit are need to configure this slice? (d) Illustrate or explain how to implement two 7-LUTs using this slice. (e) Illustrate or explain how to implement a 12-bit equal comparator circuit using a single slice. Hint: You are allowed to use the carry-logic along with the LUTs. 9. For the circuit shown below, describe in words its function. Draw a clock waveform and the wavesforms at nodes x 0 through x 3 for 4 clock cycles. Assume initially x 0 through x 3 are all set to 0. FF FF FF x 0 x 1 x 2 8