ROMs, PLAs and FPGAs October 5, 2006 Typeset by Foil T EX Why - - PowerPoint PPT Presentation

roms plas and fpgas
SMART_READER_LITE
LIVE PREVIEW

ROMs, PLAs and FPGAs October 5, 2006 Typeset by Foil T EX Why - - PowerPoint PPT Presentation

ROMs, PLAs and FPGAs October 5, 2006 Typeset by Foil T EX Why Programmable Logic? Programmable logic technologies: Read-Only Memory (ROM) Programmable Logic Array (PLA) Programmable Array Logic (PAL) Field Programmable


slide-1
SLIDE 1

ROMs, PLAs and FPGAs

October 5, 2006

– Typeset by FoilT EX –

slide-2
SLIDE 2

Why Programmable Logic?

Programmable logic technologies:

  • Read-Only Memory (ROM)
  • Programmable Logic Array (PLA)
  • Programmable Array Logic (PAL)
  • Field Programmable Gate Arrays (FPGA)

– Typeset by FoilT EX – 1

slide-3
SLIDE 3

Why Programmable Logic?

  • Facts:

– It is most economical to produce an IC in large volumes – Many designs required only small volumes of ICs

  • Need an IC that can be:

– Produced in large volumes – Handle many designs required in small volumes

  • A programmable logic part can be:

– made in large volumes – programmed to implement large numbers of different low-volume designs

– Typeset by FoilT EX – 2

slide-4
SLIDE 4

Some Characteristics

  • Permanent - Cannot be erased and reprogrammed

– Mask programming – Fuse – Antifuse

  • Reprogrammable

– Volatile - Programming lost if chip power lost – Single-bit storage element – Non-Volatile ∗ Erasable (EPROM with UV light) ∗ Electrically erasable (EEPROM) ∗ Flash (as in Flash Memory)

– Typeset by FoilT EX – 3

slide-5
SLIDE 5

Programmable Logic

  • Read Only Memory (ROM) – a fixed array of AND gates and a programmable

array of OR gates.

  • Programmable Array Logic (PAL) – a programmable array of AND gates feeding

a fixed array of OR gates.

  • Programmable Logic Array (PLA) – a programmable array of AND gates feeding

a programmable array of OR gates.

  • Complex Programmable Logic Device (CPLD)/Field- Programmable Gate Array

(FPGA) - complex enough to be called “architectures”

– Typeset by FoilT EX – 4

slide-6
SLIDE 6

ROMs

  • Read Only Memories (ROM) or Programmable Read Only Memories (PROM)

have: – N input lines, M output lines, and 2N decoded minterms.

  • Fixed AND array with 2N outputs implementing all N-literal minterms.
  • Programmable OR Array with M outputs lines to form up to M sum of minterm

expressions.

  • A program for a ROM or PROM is simply a multiple-output truth table

– If a 1 entry, a connection is made to the corresponding minterm for the corresponding output. If a 0, no connection is made.

  • Can be viewed as a memory with the inputs as addresses of data (output values),

hence ROM or PROM names!

– Typeset by FoilT EX – 5

slide-7
SLIDE 7

An Example

Example: A 8 × 4 ROM (N=3 input lines, M=4 output lines)

  • The fixed “AND” array is a “decoder” with 3

inputs and 8 outputs implementing minterms.

  • The programmable “OR” array uses a single

line to represent all inputs to an OR gate. An “X” in the array corresponds to attaching the minterm to the OR

  • Read Example: For input (A2,A1,A0) = 001,
  • utput is (F3,F2,F1,F0 ) = 0011.

A B C A2 A1 A0 D7 D6 D5 D4 D3 D2 D1 D0 F3 F2 F1 F0

What are functions F3, F2 , F1 and F0 in terms of (A2, A1, A0)?

– Typeset by FoilT EX – 6

slide-8
SLIDE 8

PLAs

  • Programmable Logic Arrays (PLAs) implement a number of Sum-of-Product

expressions

  • PLAs are specified by

– the number of inputs (variables) – the number of product terms (AND gates) – the number of functions (OR gates)

  • Every input variable (or its complement) may be included in a product term by

setting a programmable switching element.

  • Every function (output) can include any or all of the product terms by setting

a programmable switching element.

– Typeset by FoilT EX – 7

slide-9
SLIDE 9

PLA Structure

– Typeset by FoilT EX – 8

slide-10
SLIDE 10

PLA Example

W = AB’C’ + A’CD + ACD X = A’BC’ + ACD’ + A’CD + BCD Y = A’C’D’ + ACD + BCD

– Typeset by FoilT EX – 9

slide-11
SLIDE 11

PALs

  • Programmable Array Logic (PAL) chips implement a number of Sum-of-Product

expressions

  • PALs are specified by

– the number of inputs (variables) – the number of product terms (AND gates) – the number of functions (OR gates)

  • Every input variable (or its complement) may be included in a product term by

setting a programmable switching element.

  • Every function (output) has a fixed number of product terms.

– Typeset by FoilT EX – 10

slide-12
SLIDE 12

PAL Structure

– Typeset by FoilT EX – 11

slide-13
SLIDE 13

PAL Example

W = AB’C’ + CD X = A’BC’ + ACD’ + A’CD + {BCD or ABC} Y = A’C’D + ACD + {A’BD or BCD}

– Typeset by FoilT EX – 12