17
George Mason University Class Exercise 1A

Class Exercise 1A

  • Upload
    annona

  • View
    42

  • Download
    3

Embed Size (px)

DESCRIPTION

Class Exercise 1A. Rules. If you believe that you know a correct answer, please raise your hand I will select one or more students (independently whether an answer given by the first student is correct or incorrect) Please, identify yourself by first name and give an answer - PowerPoint PPT Presentation

Citation preview

Page 1: Class Exercise 1A

George Mason University

Class Exercise 1A

Page 2: Class Exercise 1A

2ECE 448 – FPGA and ASIC Design with VHDL

Rules

• If you believe that you know a correct answer, please raise your hand

• I will select one or more students

(independently whether an answer given by

the first student is correct or incorrect)

• Please, identify yourself by first name

and give an answer

• Correct answer = 1 bonus point

Page 3: Class Exercise 1A

Problem 1

List all 2-input logic gates that you can recall.

Page 4: Class Exercise 1A

Problem 2

How many 2-input logic functions can be theoretically defined (whether they make sense or not)?

Page 5: Class Exercise 1A

Problem 3

List all 1-input logic gates.

Page 6: Class Exercise 1A

Problem 4

What is a minimum set of gates that can be used to implement all logic functions?

Page 7: Class Exercise 1A

Problem 5

List four ways of expressing logic functions.

Page 8: Class Exercise 1A

Problem 6

What are the De Morgan’s Laws?Write their equations and draw their schematic representation.

Page 9: Class Exercise 1A

Problem 7

How many select inputs does an 8-to-1 MUX have?

How many select inputs does an n-to-1 MUX have?

Page 10: Class Exercise 1A

Problem 7

How many outputs does a decoder with two data inputs have?

How many outputs does a decoder with n data inputs have?

Page 11: Class Exercise 1A

Problem 8

Show how to implement a decoder that recognizes the following 4 ranges of a 16-bit address A, and generates the corresponding enable signals e0,e1,e2,e3:

For A in: AssertC000-CFFF: e0D000-DFFF: e1E000-EFFF: e2F000-FFFF: e3

Page 12: Class Exercise 1A

Problem 9

How many inputs does an encoder with two data outputs have?

How many inputs does an encoder with n data outputs have?

Page 13: Class Exercise 1A

Problem 10

What is a difference between encoder and priority encoder?

Page 14: Class Exercise 1A

Problem 11

Show how to implement Priority Encoder usingmultiplexers and a minimum number of logic gates

Page 15: Class Exercise 1A

Problem 12

What is a difference between an adder, half-adder, and full-adder?

Page 16: Class Exercise 1A

Problem 13

Show how to implement Full Adder using8-to-1 multiplexers only

Page 17: Class Exercise 1A

Problem 14

Show how to implement Full Adder using4-to-1 multiplexers and inverters only