שערים לוגיים 234262 – © Dima Elenbogen 2009. Wired AND 234262 – © Dima Elenbogen 2009.

Slides:

Advertisements

Similar presentations

Digital Design: Combinational Logic Blocks

Advertisements

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

מבוסס על הרצאות של יורם זינגר, האוניברסיטה העברית י"ם

Selected Problems from Chapter 12. 1) 2) 240 N T BC cos(30) T BC sin(30) T AB.

משטר סטטי שערים לוגיים Wired Drives – © Dima Elenbogen 2009, Moshe Malka :29.

משטר דינמי – © Dima Elenbogen :00. הגדרת cd ו -pd cd - הזמן שעובר בין הרגע שראשון אותות הכניסה יוצא מתחום לוגי עד אשר אות המוצא יוצא מתחום.

שערים לוגיים – © Dima Elenbogen Wired AND – © Dima Elenbogen 2009.

Tutorial #6 Controller + DataPath part II – © Yohai Devir 2007 © Dima Elenbogen 2009 Technion - IIT.

שערים לוגיים – © Dima Elenbogen Wired AND – © Dima Elenbogen 2009.

Tutorials #4-#5 Controller + DataPath design – © Yohai Devir 2007 Technion - IIT.

משטר דינמי – © Dima Elenbogen :14. הגדרת cd ו -pd cd - הזמן שעובר בין הרגע שראשון אותות הכניסה יוצא מתחום לוגי עד אשר אות המוצא יוצא מתחום.

מבוא למדעי המחשב תרגול 3 שעת קבלה : יום שני 11:00-12:00 דוא " ל :

משטר סטטי – © Dima Elenbogen :08. משטר סטטי כל שער לוגי מפרש מתח נמוך מ -V il כ -0 לוגי כל שער לוגי מפרש מתח גבוה מ -V ih כ -1 לוגי  כל.

PLAs Programmable Logic Arrays

Multiplexer MUX. 2 Multiplexer Multiplexer (Selector)  2 n data inputs,  n control inputs,  1 output  Used to connect 2 n points to a single point.

Tutorial #6 Controller + DataPath part II – © Yohai Devir 2007 © Dima Elenbogen 2009 Technion - IIT.

Tutorial #6 Controller + DataPath part II – © Yohai Devir 2007 © Dima Elenbogen 2009 Technion - IIT.

Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.

ROM & PLA Digital Logic And Computer Design

1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)

4-1 Introduction Chapter # 4: Programmable and Steering Logic.

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

1 Building Larger Circuits Today: Combinational Building BlocksFirst Hour: Combinational Building Blocks –Section 4.1 of Katz’s Textbook –In-class Activity.

Инвестиционный паспорт Муниципального образования «Целинский район»

(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.

2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Exponents Factoring 1 Multiply Factoring.

Programmable Logic Devices - I. Outline  Programmable Logic Devices  PN Diode Operation  AND Logic Arrays  OR Logic Arrays  Two-level AND-OR Arrays.

BR 8/991 Combinational Building Blocks 2/1 Multiplexor (MUX) I0 I1 Y S if S = 0, then Y = I0 if S = 1, then Y = I1 Y = I0 S’ + I1 S I0 I1 Y S A[3:0] B[3:0]

EE207: Digital Systems I, Semester I 2003/2004

CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 8: Documentation and Timing Diagrams José Nelson Amaral.

Karnaugh Maps Not in textbook. Karnaugh Maps K-maps provide a simple approach to reducing Boolean expressions from a input-output table. The output from.

1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A

EECS 270 Lecture 10. K-map “rules” – Only circle adjacent cells (remember edges are adjacent!) – Only circle groups that are powers of 2 (1, 2,

CSI-2111 Structure of Computers Ipage Combinational Circuits  Objectives : To recognize the principal types of combinational circuits  Adders.

(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.

 If three sides of one triangle are congruent to the three sides of another triangle, then the two triangles are congruent.  If AB = DE, BC = EF, AC.

PLDS Mohammed Anvar P.K AP/ECE Al-Ameen Engineering College.

Binary Parallel Adders

照片档案整理一、照片档案的含义二、照片档案的归档范围三、卷内照片的分类、组卷、排序与编号四、填写照片档案说明五、照片档案编目及封面、备考填写六、数码照片整理方法七、照片档案的保管与保护.

공무원연금관리공단 광주지부 공무원대부등 공적연금 연계제도 공무원연금관리공단 광주지부. 공적연금 연계제도 국민연금과 직역연금 ( 공무원 / 사학 / 군인 / 별정우체국 ) 간의 연계가 이루어지지 않고 있 어 공적연금의 사각지대가 발생해 노후생활안정 달성 미흡 연계제도 시행전.

Жюль Верн ( ). Я мальчиком мечтал, читая Жюля Верна, Что тени вымысла плоть обретут для нас; Что поплывет судно громадней «Грейт Истерна»; Что.

Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.

Before 10.7 Review of the Distributive Property.

Algebra substitution.

Boolean Expressions Lecture No. 10.

Carry Look Ahead (CLA).

Obj: to use ratios to solve problems

. - t !!l t. - 1f1f J - /\/\ - ' I __.

Solving MIPS Exam Problems

تصنيف التفاعلات الكيميائية

תרגול 6 בקר ומסלול נתונים חלק שני

Boolean Algebra.

Programmable Logic Devices (PLDs)

.. '.. ' 'i.., \. J'.....,....., ,., ,,.. '"'". ' · · f.. -··-·· '.,.. \...,., '.··.. ! f.f.

The General Triangle C B A.

Princess Sumaya University

Математици-юбиляри.

Objectives The student will be able to:

Bell Ringer 10/27/10 What is the GCF? 18x³y² and 24x² ab and a³b².

Objectives The student will be able to:

Reading: ‘Washington, DC’

The General Triangle C B A.

1. Evaluating Expressions and Functions

Factoring using the greatest common factor (GCF).

Objectives The student will be able to:

Objectives The student will be able to:

Pythagoras theorem statement

Objectives The student will be able to:

Properties of Numbers Review Problems.

Presentation transcript:

שערים לוגיים – © Dima Elenbogen 2009

Wired AND – © Dima Elenbogen 2009

Pull-Up – © Dima Elenbogen 2009

Wired-AND Bus – © Dima Elenbogen 2009

Wired-OR & Pull-Down InputOutput 0 נתק 11 התנהגות Wired-OR – © Dima Elenbogen 2009

טבלת אמת maj3prime 00 OOO 00 OO1 01 O1O 11 O OO 11 1O O f2f1 abc – © Dima Elenbogen 2009

סכום מכפלות prime: f1(a,b,c) = a’bc’ + a’bc + ab’c + abc maj3: f2(a,b,c) = a’bc + ab’c + abc’ + abc – © Dima Elenbogen 2009 Technion - IIT

ROM – © Dima Elenbogen x2

– © Dima Elenbogen 2009 maj3Prime 00 OOO 00 OO1 01 O1O 11 O OO 11 1O O F2f1 abc ROM 2 3 x2

– © Dima Elenbogen 2009 Technion - IIT maj3Prime 00 OOO 00 OO1 01 O1O 11 O OO 11 1O O F2f1 abc ROM 2 3 x2

סימונים נקרא ל -ROM בעל k כניסות ו -m מוצאים :

PLA (Template) – © Dima Elenbogen 2009 Technion - IIT

סכום מכפלות f1 = (⌐a Λ b) v (a Λ c)(prime) f2 = (a Λ b) v (b Λ c) v (a Λ c)(maj3) – © Dima Elenbogen 2009 Technion - IIT

PLA _ f1 = ab + ac (prime) f2 = ab + bc + ac (maj3) – © Dima Elenbogen 2009

PLA _ f1 = ab + ac (prime) f2 = ab + bc + ac (maj3) – © Dima Elenbogen 2009 Technion - IIT

תרגיל ברשותך מספר לא מוגבל של רכיבי ROM בעלי 3 כניסות ויציאה אחת (ROM 2 3 x1). ממש פונקציה של ארבע כניסות באמצעות מספר מינימלי של רכיבים אלו.

ƒ(x 1,x 2,x 3,x 4 ) ƒx4x4 x3x3 x2x2 x1x1 f(0,0,0,0)0000 f(0,0,0,1) f(0,1,1,1)1110 f(1,0,0,0) f(1,1,1,1)1111 כמה שורות ? כמה שורות ? – © Moshe Malka, Dima Elenbogen 2010 Technion - IIT ƒ x =0 (x 2,x 3,x 4 ) 1 ƒ x =1 (x 2,x 3,x 4 ) 1

– © Dima Elenbogen 2010 Technion - IIT הרחבת Shannon ƒ(x 1, x 2,...,x n ) = x 1 ∙ƒ(0, x 2,...,x n ) + x 1 ∙ƒ(1, x 2,...,x n ) ƒ x =0 (x 2,...,x n ) 1 ƒ x =1 (x 2,...,x n ) 1 n-1 משתנים

Tri-State Driver Enable Data in Output Net 0 לא משנה נתק – © Dima Elenbogen 2009

דוגמת Bus – © Dima Elenbogen 2009

מניעת התנגשות ב -Bus – © Dima Elenbogen 2009

Bi-directional Buffer – © Dima Elenbogen 2009