CS1104 – Computer Organization

Slides:



Advertisements
Similar presentations
Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
Advertisements

Memory and Programmable Logic
COE 202: Digital Logic Design Memory and Programmable Logic Devices
Princess Sumaya University
Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
Karnaugh Map Adjacent Squares
Digital Logic Design Gate-Level Minimization
The scale of IC design Small-scale integrated, SSI: gate number usually less than 10 in a IC. Medium-scale integrated, MSI: gate number ~10-100, can operate.
CS2100 Computer Organisation
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Karnaugh Map Adjacent Squares
Chapter 4 Gates and Circuits.
FIGURE 17-1 Binary-to-decimal conversion. Dale R. Patrick Electricity and Electronics: A Survey, 5e Copyright ©2002 by Pearson Education, Inc. Upper Saddle.
PLDs ROM : Programmable OR array
Random-Access Memory (RAM)
Princess Sumaya University
25 seconds left…...
KU College of Engineering Elec 204: Digital Systems Design
CENG 241 Digital Design 1 Lecture 2 Amirali Baniasadi
CENG 241 Digital Design 1 Lecture 3 Amirali Baniasadi
Digital Design: Combinational Logic Blocks
Overview Programmable Implementation Technologies (section 6.8)
Programmable Logic PAL, PLA.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Programmable Logic Devices
Digital Logic Design Lecture 21. Announcements Homework 7 due on Thursday, 11/13 Recitation quiz on Monday on material from Lectures 21,22.
CPEN Digital System Design
Parity. 2 Datasheets TTL:  CMOS: 
Chapter 6 – Selected Design Topics Part 4 – Programmable Implementation Technologies Logic and Computer Design Fundamentals.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Combinational Circuit – MSI Circuit ENCODER With the aid of K-map (don’t care situation), we can get D 0 =
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
ECE 331 – Digital System Design Tristate Buffers, Read-Only Memories and Programmable Logic Devices (Lecture #16) The slides included herein were taken.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 13 – Programmable.
EE 261 – Introduction to Logic Circuits Module #8 Page 1 EE 261 – Introduction to Logic Circuits Module #8 – Programmable Logic & Memory Topics A.Programmable.
Programmable Logic Devices, Threshold Logic
Random-Access Memory (RAM)
Chapter 5 Memory and Programmable Logic 5.1. Introduction 5.2. Random Access Memory 5.3. Memory Encoding 5.4. Read Only Memory 5.5. Programmable Logic.
Memory and Programmable Logic Dr. Ashraf Armoush © 2010 Dr. Ashraf Armoush.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
Unit 9 Multiplexers, Decoders, and Programmable Logic Devices Ku-Yaw Chang Assistant Professor, Department of Computer Science.
CSET 4650 Field Programmable Logic Devices
Field-programmable logic devices FPLA circuits –Packaged PLA components with a fuse at every diode in both the AND and OR sections, that can be configured.
Memory and Programmable Logic Memory device: Device to which binary information is transferred for storage, and from which information is available for.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /10/2013 Lecture 5: Combinational Logic Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE.
ROM & PLA Digital Logic And Computer Design
Programmable Logic Devices
Chapter
Digital Logic Design Lecture # 14 University of Tehran.
1 CSE370, Lecture 11 Lecture 11  Logistics  HW3 due now  Lab4 goes on as normal next week  Tuesday review 6pm, place TBD  Last lecture  "Switching-network"
Programmable Logic Devices - I. Outline  Programmable Logic Devices  PN Diode Operation  AND Logic Arrays  OR Logic Arrays  Two-level AND-OR Arrays.
Logic Gates Digital Electronics.
IC design options PLD (programmable logic device)
DIGITAL SYSTEMS Programmable devices PLA-PAL Rudolf Tracht and A.J. Han Vinck.
Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.
Programmable Logic Devices
Gunjeet Kaur Dronacharya Group of Institutions. Outline Introduction Random-Access Memory Memory Decoding Error Detection and Correction Programmable.
Programmable Logic Devices
Chapter- 9 Programmable Logic Devices DHADUK ANKITA ENRL NO Noble Engineering College- Junagadh.
ETE Digital Electronics
Computer Architecture & Operations I
Computer Architecture & Operations I
Logic and Computer Design Fundamentals
ECE 434 Advanced Digital System L03
CPE/EE 422/522 Advanced Logic Design L02
ECE434a Advanced Digital Systems L02
Presentation transcript:

CS1104 – Computer Organization http://www.comp.nus.edu.sg/~cs1104 Aaron Tan Tuck Choy School of Computing National University of Singapore

Lecture 10: Combinational Circuits Programmable Logic Devices PN Diode Operation AND Logic Arrays OR Logic Arrays Two-level AND-OR Arrays Programmable Logic Array (PLA) Realising Logic Functions with PLAs CS1104-10 Lecture 10: Combinational Circuits: Programmable Logic Devices

Lecture 10: Combinational Circuits Programmable Logic Devices Read-Only Memory (ROM) Programmable Read-Only Memory (PROM) Realising Logic Functions with PROMs Progammable Array Logic (PAL) Realising Logic Functions with PALs CS1104-10 Lecture 10: Combinational Circuits: Programmable Logic Devices

Programmable Logic Devices Programmable Logic Devices (PLDs) are IC chips with internal logic gates connected by electronic fuses. These fuses can be ‘blown’ (by programming) to obtain different circuit configurations. Semi-customized chips that give high packing density at reasonable cost. Three classes of PLDs are : Programmable Logic Array (PLA) Programmable Read Only Memory (PROM) Programmable Array Logic (PAL) CS1104-10 Programmable Logic Devices

Programmable Logic Devices Fixed AND array Fused programmable OR array Fuses Inputs Outputs Programmable Read Only Memory (PROM) Fixed OR array Fused programmable AND array Fuses Inputs Outputs Programmable Array Logic (PAL) Inputs Fused programmable OR array Fuses Outputs AND array Programmable Logic Array (PLA) CS1104-10 Programmable Logic Devices

Programmable Logic Devices “Programming” an array – blowing the fuses. A A' B B' x1 x2 x3 A A' B B' x1 = A.B x2 = A'.B x3 = A.B' (a) Unprogrammed (b) Programmed Example of a basic AND array CS1104-10 Programmable Logic Devices

Programmable Logic Devices PLDs use diodes. A PN diode is an electronic device formed by creating a junction of two types of semi-conductor materials, p type and n type. Forward-biased: When p side (anode) is more positive than n side (cathode), it behaves as a closed switch. Reverse-biased: When cathode is more positive than anode, it behaves as an open circuit. P N + - Anode Cathode Forward-biased (closed circuit) + - PN junction diode and schematic symbol. Reverse-biased (open circuit) CS1104-10 Programmable Logic Devices

PN Diode Operation PN diode operation for digital applications. (a) B +V A B (a) (d) (b) +V (e) A=0 B=0 A=1 B=1 A=0 B=0 +V A=1 B=1 (c) (f) PN diode operation for digital applications. (a) With pull-up resistor. (b) Reverse-biased: diode open; B pulled up to 1. (c) Forward-biased: diode shorted, forcing B to 0. (d) With pull-down resistor. (e) Reverse-biased: diode open; B pulled down to 0. (f) Forward-biased: diode shorted, forcing B to 1. CS1104-10 PN Diode Operation

AND Logic Arrays AND function realised with a diode array. (a) (c) (d) f(A,B,C) = 0 +V B=1 C=1 A f(A,B,C) = A.B.C +V B C (a) (c) (d) A=0 f(A,B,C) = 0 +V B=0 C=1 (b) A=1 f(A,B,C) = 1 +V B=1 C=1 AND function realised with a diode array. (a) Basic configuration. (b) All diodes open; f pulled up to 1. (c) One diode shorted, forcing f to 0. (d) Multiple diodes shorted, forcing f to 0. CS1104-10 AND Logic Arrays

OR Logic Arrays OR function realised with a diode array. (a) (b) (c) f(A,B,C) = A+B+C B C (b) A=0 f(A,B,C) = 0 B=0 C=0 (c) A=1 f(A,B,C) = 1 B=0 C=0 OR function realised with a diode array. (a) Basic configuration. (b) All diodes open; f pulled up to 0. (c) One diode shorted, forcing f to 1. CS1104-10 OR Logic Arrays

Two-level AND-OR Arrays AND and OR circuits can be interconnected to realise any arbitrary switching function. Example: f(a,b,c)=a.b.c'+b'.c CS1104-10 Two-level AND-OR Arrays

Programmable Logic Array (PLA) Combination of a programmable AND array followed by a programmable OR array. Example: Design a PLA to realise the following three logic functions and show the internal connections. f1(A,B,C,D,E) = A'.B'.D' + B'.C.D' + A'.B.C.D.E' f2(A,B,C,D,E) = A'.B.E + B'.C.D'.E f3(A,B,C,D,E) = A'.B'.D' + B'.C'.D'.E + A'.B.C.D CS1104-10 Programmable Logic Array (PLA)

Realising Logic Functions with PLAs f1(A,B,C,D,E) = A'.B'.D' + B'.C.D' + A'.B.C.D.E' f2(A,B,C,D,E) = A'.B.E + B'.C.D'.E f3(A,B,C,D,E) = A'.B'.D' + B'.C'.D'.E + A'.B.C.D A B C D E P1 P3 P4 P6 P5 P2 P7 Programmable OR array Programmable AND array A'B'D' X B'CD' A'BCDE' A'BE B'CD'E B'C'D'E A'BCD f1 f2 f3 A'.B'.D' B'.C.D' A'.B.C.D.E' CS1104-10 Realising Logic Functions with PLAs

Read-Only Memory (ROM) A semi-conductor memory is a device where data can be stored and retrieved. Logically, this memory device can be regarded as a table of memory cells (data). 1 2 3 : n Addresses 1-word data 1-bit data word size CS1104-10 Read-Only Memory (ROM)

Read-Only Memory (ROM) A Read-Only Memory (ROM) is a memory device where data are read from, but not written to. Writing is done at time of customisation, or, by special programming devices (programmable ROM). Any Boolean expression can be implemented using ROM. Procedure: Obtain a truth table, treat the inputs as addresses and outputs as data. Advantage: Boolean functions directly implemented. Disadvantages: Don’t care conditions not used, and limited input variables (e.g. 10 inputs – 1K, 16 inputs – 64K, 20 inputs – 1M). CS1104-10 Read-Only Memory (ROM)

Read-Only Memory (ROM) Different types of ROM devices available: ROM: Read-Only Memory Data written into memory by mask programming during manufacturing time. Expensive start-up cost but economical for high volume. Cannot be erased after data are programmed in. PROM: Programmable ROM Semi-custom chip. Fuses can be broken by special hardware programmer unit. Cost-effective for low volumes. Cannot be erased after programming. CS1104-10 Read-Only Memory (ROM)

Read-Only Memory (ROM) EPROM: Erasable PROM Similar to PROM except that data can be completely erased by exposure to ultra-violet light. EEPROM: Electrically Erasable PROM A PROM where data can be selectively erased by hardware programmer unit, rather than by ultra-violet light. Useful for remote devices which can be re-programmed from a distance. CS1104-10 Read-Only Memory (ROM)

Programmable Read-Only Memory (PROM) Devices with fixed AND array (which is a decoder) and programmable OR array. The AND array (decoder) generates all 2n possible minterm products of its n inputs (often referred to as n-to-2n decoder). n input lines, m output lines. Bit combination of input variables – address. Bit combination of output lines – word (each word contains m bits). CS1104-10 Programmable Read-Only Memory (PROM)

Programmable Read-Only Memory (PROM) I0 I1 I2 m0 m2 m3 m5 m4 m1 m7 Programmable OR array Fixed AND array X O1 O2 Ok m6 . Minterms Programmable read-only memory (PROM) can realize K functions f(I2,I1,I0). CS1104-10 Programmable Read-Only Memory (PROM)

Programmable Read-Only Memory (PROM) 2n x m ROM n inputs m outputs 2n x m ROM => 2n words, each word m bits => 2n x m bits CS1104-10 Programmable Read-Only Memory (PROM)

Programmable Read-Only Memory (PROM) 5 x 32 decoder A0 A1 A2 A3 A4 1 2 31 F1 ... . F2 F3 F4 Minterms Address input 128 fuses Logic construction of a 32 x 4 ROM. CS1104-10 Programmable Read-Only Memory (PROM)

Realising Logic Functions with PROMs Example (8 x 3 ROM): f1(A,B,C) = A.B + B'.C f2(A,B,C) = (A+B'+C).(A'+B) f3(A,B,C) = A + B.C First, we convert each function to canonical SOP form. f1(A,B,C) = A.B + B'.C = A.B.C' + A.B.C + A'.B'.C + A.B'.C = S m(1,5,6,7) = (A+B'+B).(A'+B+C').(A'+B+C) = P M(2,4,5) = S m(0,1,3,6,7) f3(A,B,C) = A + B.C = A.B'.C' + A.B'.C + A.B.C' + A.B.C + A'.B.C = S m(3,4,5,6,7) CS1104-10 Realising Logic Functions with PROMs

Realising Logic Functions with PROMs B A m0 m2 m3 m5 m4 m1 m7 Programmable OR array Fixed AND array X f1 = S m(1,5,6,7) f2 = S m(0,1,3,6,7) f3 = S m(3,4,5,6,7) m6 Minterms CS1104-10 Realising Logic Functions with PROMs

Realising Logic Functions with PROMs 3 x 8 decoder C B A 1 2 3 4 5 6 7 f1 = Sm(1,5,6,7) Minterms Address input f2 = Sm(0,1,3,6,7) f3 = Sm(3,4,5,6,7) 8 x 3 ROM 0: 0 1 0 1: 1 1 0 2: 0 0 0 3: 0 1 1 4: 0 0 1 5: 1 0 1 6: 1 1 1 7: 1 1 1 CS1104-10 Realising Logic Functions with PROMs

Programmable Array Logic (PAL) Introduced in late 1970s by Monolithic Memories Inc. as lower cost replacement for logic gates, PROMs, and PLAs. PAL has programmable AND array and fixed OR array. Less general than PLA but easier to manufacture and design. Product terms belong to different OR gates, cannot be shared. CS1104-10 Programmable Array Logic (PAL)

Programmable Array Logic (PAL) D P1 P2 P3 O1 P4 P5 P6 O2 Programmable AND array Fixed OR array CS1104-10 Programmable Array Logic (PAL)

Realising Logic Functions with PALs Procedure is to obtain minimal SOP expressions. Example: fa(A,B,C,D) = A'.B'.D' + B'.C.D' + A'.B.C.D fb(A,B,C,D) = A'.B + B'.C.D' fc(A,B,C,D) = A'.B'.D' + B'.C'.D' + A'.B.C.D CS1104-10 Realising Logic Functions with PALs

Realising Logic Functions with PALs fa(A,B,C,D) = A'.B'.D' + B'.C.D' + A'.B.C.D fb(A,B,C,D) = A'.B + B'.C.D' fc(A,B,C,D) = A'.B'.D' + B'.C'.D' PAL realisation of fa, fß and fr. A P1 P2 P3 fa P4 P5 P6 fb fc B C D x CS1104-10 Realising Logic Functions with PALs

End of segment