1 / 24

Asynchronous vs. Synchronous Counters

Asynchronous vs. Synchronous Counters. Ripple Counters. Deceptively attractive alternative to synchronous design style. Count signal ripples from left to right. State transitions are not sharp!. Can lead to "spiked outputs" from combinational logic decoding the counter's state.

camila
Download Presentation

Asynchronous vs. Synchronous Counters

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. Asynchronous vs. Synchronous Counters Ripple Counters Deceptively attractive alternative to synchronous design style Count signal ripples from left to right State transitions are not sharp! Can lead to "spiked outputs" from combinational logic decoding the counter's state

  2. (2) RCO goes high (3) High order 4-bits are incremented (1) Low order 4-bits = 1111 Asynchronous vs. Synchronous Counters Cascaded Synchronous Counters with Ripple Carry Outputs + P T P T count RCO RCO count clk clk First stage RCO enables second stage for counting QD QC QB QA D C B A H G FE D C B A QD QC QB QA + D C B A LOAD RCO asserted soon after stage enters state 1111 also a function of the T Enable Downstream stages lag in their 1111 to 0000 transitions Affects Count period and decoding logic LOAD CLR CLR

  3. Asynchronous vs. Synchronous Counters The Power of Synchronous Clear and Load Starting Offset Counters: e.g., 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1111, 0110, ... D C B A R Q Q Q Q 1 C D C B A L 6 O O C C L K 3 A L P T D C B A D R 0 1 + + Load Use RCO signal to trigger Load of a new state Since 74163 Load is synchronous, state changes only on the next rising clock edge 0110 is the state to be loaded

  4. CLR B A D C Q Q Q Q R 1 D C B A L C 6 C O C O 3 L A L K P T D C B A D R 1 0 + Asynchronous vs. Synchronous Counters Offset Counters Continued Ending Offset Counter: e.g., 0000, 0001, 0010, ..., 1100, 1101, 0000 Clear signal takes effect on the rising count edge Decode state to determine when to reset to 0000 Replace '163 with '161, Counter with Async Clear Clear takes effect immediately!

  5. Memory technology types • Read-Only Memory (ROM) • Non-volatile storage • ROM, PROM, EPROM, EEPROM • Random Access Memory (RAM) • Static RAM (SRAM) • Dynamic RAM (DRAM)

  6. ROM types • OT-PROM (one time programmable) • Mask ROM • Fuse ROM • PROM • EPROM • EEPROM Word Line Word Line Word Line Floating gate Bit Line Bit Line Bit Line Mask ROM Fuse ROM EPROM EEPROM Flash Memory

  7. Word Line Bit Line Bit Line Word Line Bit Line SRAM • Hold data without external refresh • Simplicity : don’t require external refresh circuitry • Speed: SRAM is faster than DRAM • Cost: several times more expensive than DRAMs • Size: take up much more space than DRAMs • Power: consume more power than DRAMs • Usage: level 1 or level 2 cache

  8. Random Access Memories Static RAM Transistor efficient methods for implementing storage elements Small RAM: 256 words by 4-bit Large RAM: 4 million words by 1-bit We will discuss a 1024 x 4 organization Static RAM Cell Words = Rows Static RAM Cell Static RAM Cell Columns = Bits (Double Rail Encoded)

  9. Random Access Memories Static RAM Organization Chip Select Line (active lo) Write Enable Line (active lo) 10 Address Lines 4 Bidirectional Data Lines

  10. Random Access Memories RAM Organization Long thin layouts are not the best organization for a RAM 64 x 64 Square Array Some Addr bits select row Some Addr bits select within row Amplifers & Mux/Demux

  11. Random Access Memories RAM Timing Simplified Read Timing Simplified Write Timing

  12. Word Line Bit Line Random Access Memories Dynamic RAMs 1 Transistor (+ capacitor) memory element Read: Assert Word Line, Sense Bit Line Write: Drive Bit Line, Assert Word Line Destructive Read-Out Need for Refresh Cycles: storage decay in ms Internal circuits read word and write back

  13. Random Access Memories DRAM Organization Long rows to simplify refresh Two new signals: RAS, CAS Row Address Strobe Column Address Strobe replace Chip Select

  14. Random Access Memory RAS, CAS Addressing Even to read 1 bit, an entire 64-bit row is read! Separate addressing into two cycles: Row Address, Column Address Saves on package pins, speeds RAM access for sequential bits! Read Cycle Read Row Row Address Latched Read Bit Within Row Column Address Latched Tri-state Outputs

  15. Random Access Memory Write Cycle Timing (1) Latch Row Address Read Row (2) WE low (3) CAS low: replace data bit (4) RAS high: write back the modified row (5) CAS high to complete the memory cycle

  16. Random Access Memory RAM Refresh Refresh Frequency: 4096 word RAM -- refresh each word once every 4 ms Assume 120ns memory access cycle This is one refresh cycle every 976 ns (1 in 8 DRAM accesses)! But RAM is really organized into 64 rows This is one refresh cycle every 62.5 ms (1 in 500 DRAM accesses) Large capacity DRAMs have 256 rows, refresh once every 16 ms RAS-only Refresh (RAS cycling, no CAS cycling) External controller remembers last refreshed row Some memory chips maintain refresh row pointer CAS before RAS refresh: if CAS goes low before RAS, then refresh

  17. DRAM Technologies • Conventional DRAM • Fast Page Mode (FPM) DRAM • Extended Data Out (EDO) DRAM • Synchronous DRAM (SDRAM) • Double Data Rate SDRAM (DDR SDRAM) • Direct Rambus DRAM (DRDRAM) • Synchronous-Link DRAM (SLDRAM)

  18. Fast Page Mode (FPM) DRAM • Sending the row address just once for many accesses to memory in locations near each other, improving access time • Page mode • Burst mode access • Memory is not read one byte at a time (32 or 64 bits at a time) • Several consecutive chunks of memory • “x-y-y-y” for four consecutive accesses

  19. Synchronous DRAM • Tied to the system clock • Burst mode • System timing : 5-1-1-1 • Internal interleaving • New memory standard for modern PCs • Speed • Access time: 10ns, 12ns,… • MHz rating: 100 MHz, 133MHz

  20. Synchronous DRAM, cont’d • Latency • SDRAMs are still DRAMs • 5-1-1-1 (10ns means the second, third and fourth access times) • 2-clock and 4-clock Circuitry • 2-clock: 2 different DRAM chips on the module • 4-clock: 4 different DRAM chips • Packaging • Usually comes in DIMM packaging • Buffered and unbuffered, 3.3 V and 5.0V

  21. SDRAM DIMM • 64Mx64 SDRAM DIMM based on 32Mx8, 4 banks 3.3v SDRAMs with SPD • SPD: serial presence detect chip: speed and design information about the module

  22. Direct Rambus DRAM (DRDRAM) • Direct Rambus channel • High speed 16-bit bus, 400MHz • Transfers at rising and falling edges, 1.6Gbytes/second • Rambus Inline Memory module (RIMM)

  23. Synchronous-Link DRAM (SLDRAM) • SLDRAM Consortium • Evolutionary design • 64bit bus running at a 200 MHz clock speed (effective speed of 400 MHz) • 3.2 Gbytes/second • Open standard

  24. Chapter Summary • The Variety of Sequential Circuit Packages • Registers, Shifters, Counters, RAMs • Counters as Simple Finite State Machines • Counter Design Procedure • 1. Derive State Diagram • 2. Derive State Transition Table • 3. Determine Next State Functions • 4. Remap Next State Functions for Target FF Types • Using Excitation Tables; Implement Logic • Different FF Types in Counters • J-K best for reducing gate count in packaged logic • D is easiest design plus best for reducing wiring and area in VLSI • Asynchronous vs. Synchronous Counters • Avoid Ripple Counters! State transitions are not sharp • Beware of potential problems when cascading synchronous counters • Offset counters: easy to design with synchronous load and clear • Never use counters with asynchronous clear for this kind of application

More Related