registers and counters n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Registers and Counters PowerPoint Presentation
Download Presentation
Registers and Counters

Loading in 2 Seconds...

play fullscreen
1 / 46

Registers and Counters - PowerPoint PPT Presentation


  • 150 Views
  • Uploaded on

Registers and Counters. What is a Register?. A Register is a collection of n f lip-flops with some common function or characteristic Control signals - common clock, clear, load, etc. Function - part of multi-bit storage, counter, or shift register At a minimum, we must be able to:

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

Registers and 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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
    Presentation Transcript
    1. Registers and Counters

    2. What is a Register? • A Register is a collection of n flip-flops with some common function or characteristic • Control signals - common clock, clear, load, etc. • Function - part of multi-bit storage, counter, or shift register • At a minimum, we must be able to: • Observe the stored binary value • Change the stored binary value

    3. What is a Register?

    4. What is a Register? n bit output n bit input Load Clear Clock A Load input controls the transfer of data(input) to A. Load is controlled either by the clock or FF inputs.

    5. Parallel Load Register with clock gating Load is controlled by clock input-may cause ‘clock skew’: Clock arrives at different times to different FF’s C=Load’+Clock

    6. Kinds of Registers V+ CLR Q3 D3 D Q C Q Q3F Q2 D2 D Q C Q Q2F D1 Q1 D Q C Q Q1F Q0 D0 D Q C Q Q0F CLK Storage Register Group of storage elements read/written as a unit 4-bit register constructed from 4 D FFs Shared clock and clear lines Schematic Shape TTL 74171 Quad D-type FF with Clear (Small numbers represent pin #s on package)

    7. Kinds of Registers and Counters 377 11 CLK 1 EN 18 19 D7 Q7 17 16 D6 Q6 15 14 D5 Q5 12 13 D4 Q4 8 9 D3 Q3 7 6 D2 Q2 4 5 D1 Q1 3 2 D0 Q0 Input/Output Variations Selective Load Capability Tri-state or Open Collector Outputs True and Complementary Outputs 74377 Octal D-type FFs with input enable 74374 Octal D-type FFs with output enable EN enabled low and lo-to-hi clock transition to load new data into register OE asserted low presents FF state to output pins; otherwise high impedence

    8. FF input controlled load:This Register will not cause a clock skew

    9. Register Files • A Register File is a collection of m registers, like a very small memory. • All CPU’s have register files of varying sizes • A typical one is: 32 registers of 32 bits each • Consider a small, 4 register file • Each register is specified by a 2 bit code. • An input might be loaded to a register with a given code(select) • An output might be picked up from a register with a given code

    10. Register Files • a 4-register file: Load R1 R2 R3 R4 Register Select 2x4 decoder n-bit output Read/Write EN n-bit input

    11. Kinds of Registers Register Files Two dimensional array of flip-flops Address used as index to a particular word Word contents read or written Separate Read and Write Enables Separate Read and Write Address Data Input, Q Outputs Contains 16 D-ffs, organized as four rows (words) of four elements (bits) 74670 4x4 Register File with Tri-state Outputs

    12. Microoperations • Registers and transfers may be represented by standard symbols • A microoperation: an operation on registers or in other parts of a computer performed in one clock cycle. • Transfer, Arithmetic-Logic, Shift microoperations

    13. Data Transfer • Information is moved from register to register by: • Parallel data transfer • Serial data transfer • For example: • Older printers use parallel data transfer • USB devices use serial data transfer

    14. Parallel Data Transfer Parallel data transfer moves data from one register to another at one time Reg. A Reg. B clock When clock occurs, all bits of A are copied to B

    15. Register Transfer Microperations • R1 R2 means: Transfer the contents of Register R2 to register R1 at the edge of the clock in parallel. • We might also have: K1: R1 R2 which means: The transfer occurs only when the control condition T1 is 1.

    16. Register Transfer Microperations Register transfer- one to one

    17. Register Transfer-2 to one: K1: R0 R1 K1’K2: R0 R2 Assume K1 and K2 never becomes 1 at the same time We maY extend the idea to many to one

    18. Arithmetic Microoperations

    19. Implementation of add-subtract Microoperations: X’.K1: R1 R1+ R2 X .K1: R1 R1+R2’ +1

    20. Logic Microoperations

    21. Logic Microoperations Uses of Logic microoperations • Usually used to change the desired bits of a register • Use a ‘mask’ as the contents of the second operand for the logic operation • AND: masks and clears, OR: sets, XOR: complements desired bits(remember 1 EXOR X=X’, 0 EXOR X= X

    22. Logic Microoperations Examples: • R1: 0010 1101 R2: 0000 1111(mask register) R1 AND R2 : 0000 1101(clears left bits) • R1 OR R2: 0010 1111(sets right bits) • R1 EXOR R2: 0010 0010(left bits complemented)

    23. Shift Microoperations

    24. Vcc Q Q Q Q 1 2 3 4 Reset Shift Direction 1 0 0 0 Shift 0 1 0 0 J Q K Q J Q K Q J Q K Q J Q K Q CLK CLK CLK CLK Shift 0 0 1 0 Shift Shift 0 0 0 1 Reset Vcc Shift Registers Storage + ability to circulate data among storage elements Q2 Q1 Q3 Q4 Shift from left storage element to right neighbor on every lo-to-hi transition on shift signal Wrap around from rightmost element to leftmost element

    25. Serial Data Transfer Reg. R1 Serial transfer moves data bits from A to B one bit per clock Rx and Tx have single wire between the two. For ‘n’ bit registers, it takes ‘n’ clocks for data move 1 bit signal Reg. R2 clock Usual implementation is with a shift register.

    26. Serial Data Transfer • Typical serial transfer is a multi-step process • Load transmit shift register with data to send • Shift data bit by bit from transmit to receive SR • Transfer received data to other registers • The transmit SR must have parallel load • AKA parallel to serial shift register • The receive SR must have parallel outputs • AKA serial to parallel shift register • Other control/timing signals usually needed

    27. Serial Data Transfer Reg. B (S to P) Parallel Transmit Data ‘n’ bits load 1 bit signal (serial data) Reg. A (P to S) ‘n’ bits clock Parallel Receive Data

    28. Serial Data Transfer • Serial data transfer used where data rate is relatively slow and/or parallel bit transfer channels are expensive • PC serial port and USB interfaces • wireless/fiber optic data transmissions • Cell phones • Wireless networks • Satellite telephone/TV • Mars rover/orbiter communications

    29. Typical Multi-Function Shift Register S1 S0 LSI A B C D RSI CLK CLR QA QB QC QD Shift Register I/O Serial vs. Parallel Inputs Serial vs. Parallel Outputs Shift Direction: Left vs. Right Serial Inputs: LSI, RSI Parallel Inputs: D, C, B, A Parallel Outputs: QD, QC, QB, QA Clear Signal Positive Edge Triggered Devices S1,S0 determine the shift function S1 = 1, S0 = 1: Load on rising clk edge synchronous load S1 = 1, S0 = 0: shift left on rising clk edge LSI replaces element D S1 = 0, S0 = 1: shift right on rising clk edge RSI replaces element A S1 = 0, S0 = 0: hold state Multiplexing logic on input to each FF! 74194 4-bit Universal Shift Register Shifters well suited for serial-to-parallel conversions, such as terminal to computer communications

    30. Shift Register with Parallel Load Right shift only

    31. Shift Register with Parallel Load

    32. Serial Transfer with Shift Registers Shift Register Application: Parallel to Serial Conversion Parallel Inputs Parallel Outputs Serial transmission

    33. Counters Counters Proceed through a well-defined sequence of states in response to the count signal. 3 Bit Up-counter: 000, 001, 010, 011, 100, 101, 110, 111, 000, ... 3 Bit Down-counter: 111, 110, 101, 100, 011, 010, 001, 000, 111, ... The count sequence can be Binary or BCD or Gray Code or any other sequence you want. Usually there will be a set of control inputs (enable, load, reset) in addition to the clock. The basic counter is a sequential circuit where the state (the count value) is the output. The counter circuit may have no other input other than the clock. This is known as an autonomous sequential circuit.

    34. Counters A common 4-bit counter Synchronous Load and Clear Inputs Positive Edge Triggered FFs Parallel Load Data from D, C, B, A P, T Enable Inputs: both must be asserted to enable counting RCO: asserted when counter enters its highest state 1111, used for cascading counters "Ripple Carry Output" 74163 Synchronous 4-Bit Upcounter 74161: similar in function, asynchronous load and reset

    35. Counters Q Q Q Q 1 2 3 4 100 Shift Q1 Q2 Q3 Q4 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 Ring Counter +V +V +V End-Around \Reset 1 4 possible states, single bit change per state, useful for avoiding glitches Must be initialized 0 S S S S J J J J Q Q Q Q CLK CLK CLK CLK K Q K Q K Q K Q R R R R Shift V+

    36. Counters +V +V +V \Reset 1 0 Q Q Q Q S S S S 1 2 3 4 J J J J Q Q Q Q CLK CLK CLK CLK K Q K Q K Q K Q R R R R Shift Twisted Ring (Johnson, Mobius) Counter Inverted End-Around 8 possible states, single bit change per state, useful for avoiding glitches +V

    37. Counter Design : Synchronous Counters Introduction The process is a special case of the general sequential circuit design procedure. no decisions on state assignment or transitions current state is the output Example: 3-bit Binary Upcounter Decide to implement with Toggle Flipflops What inputs must be presented to the T FFs to get them to change to the desired state bit? We need to use the T FF excitation table to translate the present/next state values to FF inputs Present state Next state 000 111 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 001 110 010 101 011 100

    38. Self-Starting Counters Start-Up States At power-up, counter may be in any possible state Designer must guarantee that it (eventually) enters a valid state Especially a problem for counters that validly use a subset of states Self-Starting Solution: Design counter so that even the invalid states eventually transition to valid state S5 S6 S0 S4 S0 S4 S1 S3 S1 S3 S2 S2 S6 S7 S5 S7 Two Self-Starting State Transition Diagrams

    39. 4 bit syncronous binary counter

    40. Up-down counter with parallel load

    41. Asynchronous vs. Synchronous Counters Ripple Counters: Asynchronous 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

    42. Ripple Counters (Up or Down) • Three characteristics determine if a ripple counter counts up or down • FF clock input polarity • FF output to clock polarity • Counter output polarity • A ripple counter with negative clock polarity, Q to next FF clock, and Q counter outputs counts UP • Change an odd number of characteristics and the counter counts DOWN

    43. Cascaded Counters ET EP ET EP RCO RCO A B C D QA QB QC QD A B C D QA QB QC QD LD LD CLR CLR Cascaded Synchronous Counters with Ripple Carry Outputs First stage RCO enables second stage for counting 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

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

    45. Other Counter Sequences 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 Offset Counters Continued Ending Offset Counter: e.g., 0000, 0001, 0010, ..., 1100, 1101, 0000 Decode state to determine when to reset to 0000 Clear signal takes effect on the rising count edge Replace '163 with '161, Counter with Async Clear Clear takes effect immediately!