1 / 31

Ch. 7

Ch. 7. Memory and Programmable Logic. Memory and Programmable Logic. Random-Access Memory Memory Decoding Error Detection and Correction Read-Only Memory Programmable Logic Array Programmable Array Logic Sequential Programmable Devices. Memory. Memory

irma-nieves
Download Presentation

Ch. 7

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Ch. 7 Memory and Programmable Logic

  2. Memory and Programmable Logic • Random-Access Memory • Memory Decoding • Error Detection and Correction • Read-Only Memory • Programmable Logic Array • Programmable Array Logic • Sequential Programmable Devices

  3. Memory • Memory • A device to which binary information is transferred for storage. • Type of memory • random access memory , RAM • read-only memory, ROM • Write operation • Storing new information into memory • Read operation • Transferring the stored information out of memory

  4. RAM • RAM • The time it takes to transfer information to or from any desired random location is always the same • Storage unit–byte • byte：8 bits • Length of a word：multiple of 8 bits • word：represent a number, an instruction, alphanumeric character • Capacity of memory–total number of bytes

  5. Block diagram of memory unit k address lines：select one particular word read, write：specify the direction of transfer n data input line：provide the information to be stored in memory ndata output line：supplying the information coming out of memory

  6. Capacity of memory • Range of in memory size • 210~232words • bytes • K=210、 M=220、 G=230 。 • 64K=216、2M=221、4G=232 。 • Memory 1K x 16 • 10 bits address，16 bits in each word • Determine the no. of bits for address k: no. of address bits m: total number of words

  7. Control inputs to memory chip

  8. Memory cycle timing waveforms • access time • the time required to select a word and read it • cycle time • the time required to complete a write cycle • access time 、 cycle time • equal to a fixed number of CPU clock • See Fig. 7-4

  9. Types of memory • The mode of access of a memory • RAM-volatile • Static RAM(SRAM) • internal latch • easier to used and shorter read and write time • Dynamic RAM(DRAM) • electric charges on capacitor • less power consumption • larger storage capacity • ROM-nonvolatile • Read/write time depend on the distance between the magnetic reader/writer and the data

  10. Memory Decoding • Decoder • select the memory word specified by the input address • 2-dimensional coincident decoding is a more efficient decoding scheme for large memories

  11. Memory cell • One bit memory cell

  12. 4X4 RAM

  13. Coincident Decoding－ two-dimensional selection scheme • Decoder with k input and 2k output requires 2k AND gates with k input • k input decoder can be implemented by two k/2 input decoders with one for column and another for row • e.g., 10×1024 decoder can be implemented by two 5×32 decoders

  14. Example for two-dimensional decoder

  15. Address multiplexing • 64K-word memory

  16. Read-Only Memory • ROM：permanent binary information is stored • k input, n output ROM

  17. ROM • No data input • Integrated circuit ROM have one or more enable input • Sometimes come with three-state outputs to facilitate the construction of large arrays of ROM

  18. Internal logic of 32X8 ROM

  19. ROMtruth table • Table 7-3 32×8 ROMtruth table

  20. Programmomg the ROM according to Taable 7-3 • × denote a connection in place of a dot used for permanent connection

  21. Example 7-1 Design a combinational circuit with 3-input using a ROM. Output = square(input)

  22. ROMimplementation of Example 7-1

  23. Types of ROMs • The required path in a ROM may be programmed in four different ways. • mask programming (mask ROM) • Mask is done by Fab. company during the last fabrication • Customer must fill out the truth table • High cost • programmable read-only memory(PROM) • allows users to program in Lab. • the program is irreversible

  24. Types of ROMs • Erasable PROM(EPROM) • by ultraviolet light • electrically-erasable PROM(EEPROMor E²PROM)， • by electrical signal • can be erased without removing it from tis socket

  25. Types of PLD (Programmable Logic Device)

  26. Programmable Logic Array (PLA) • similar to PROM • does not provide full decoding and does not generate all the minterms • decoder is replaced by an array of AND gate

  27. PLAwith 3 inputs, 4 product terms, and two outputs

  28. PLA Programming Table • PLA Programming Table consists of three sections • 1st, list the product terms numerically • 2nd, specify the required path between inputs and AND gates • 3rd, specifies the paths between the AND and OR gates

  29. Example 7-2 • Implement the following two Boolean functions with a PLA: • Simplified by K-map：

  30. Solution of Example 7-2

More Related