DOC PREVIEW
Berkeley COMPSCI 150 - Lecture Notes

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CS150 Week 6, lecture 1 Covers:1) Monster input gates2) PLAs, PALs, ROMs1) Monster input gates How many 2-input AND gates do you need to make a 64 input AND gate? And what’s the minimum number ofstages necessary? To give you the idea, let’s do a simpler one: An 8-input AND gate. Total: 7 Gates Total: 3 Gates Total: 1 GatePhillips’ AND gates have a 200ps/gate delay. So 3 stages would have a 600ps+ delay from the time the input changes to when the output changes.Gates: ?Stages: ?2) PLAs, PALs, ROMsProgrammable logic devices: PLAs: AND and OR plane adjustable. PALs: Only AND plane adjustable.Programmable memory devices: ROM: Regurgitates whatever was burned into it…Picture of a PLA: ( are fused conections. ) __ __ A A B B _OUTPUT = AB +


View Full Document

Berkeley COMPSCI 150 - Lecture Notes

Documents in this Course
Lab 2

Lab 2

9 pages

Debugging

Debugging

28 pages

Lab 1

Lab 1

15 pages

Memory

Memory

13 pages

Lecture 7

Lecture 7

11 pages

SPDIF

SPDIF

18 pages

Memory

Memory

27 pages

Exam III

Exam III

15 pages

Quiz

Quiz

6 pages

Problem

Problem

3 pages

Memory

Memory

26 pages

Lab 1

Lab 1

9 pages

Memory

Memory

5 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?