1 / 25

Shift Register

Shift Register. Register. A register is a group of flip-flops, each one of which is capable of storing one bit of information. Issues: You do not have an option hold the output when you don’t want to outputs updated. 4 D flip-flops=4 bits of storage=4-bit register.

river
Télécharger la présentation

Shift Register

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. Shift Register

  2. Register • A register is a group of flip-flops, each one of which is capable of storing one bit of information. • Issues: • You do not have an option hold the output when you don’t want to outputs updated. 4 D flip-flops=4 bits of storage=4-bit register

  3. 4-bit Register with Parallel Load Control

  4. Load=“1”→Update I0 is fed to DFF when Load is a 1. “0” “1” “1” “0” “I0” “I0”

  5. Load=“0”→Hold! A0 is fed to DFF when Load is a 0. So the output is holding! “1” “0” “0” “A0” “A0” “0”

  6. Four Bit Shift Register 1 2 3 4 Q of DFF1 gets SI after the first rising edge of the CLK Q of DFF2 gets SI after the second rising edge of the CLK Q of DFF3 gets SI after the third rising edge of the CLK Q of DFF4 gets SI after the fourth rising edge of the CLK

  7. Linear Feedback Shift Register

  8. Serial Transfer Using Shift Register Information in A is made to circulate by connecting SO to SI.

  9. Parallel Transfer Versus Serial Transfer (Serial Transfer) Take multiple clock cycles to transfer data. Assume n=4, each shift Register has 4 DFF. Parallel Transfer Transfer all the bit in one clock cycle. Require combinatorial circuits.

  10. Augend, Addend & Sum 1011 +1001 ______ 10100 Augend Addend Sum

  11. Serial Adder Assuming a shift-right register, the left most position becomes available for storage after the second rising edge of the clock. 1 0 (Augend) 1 1 Feed “1” to z at the next rising edge of the CLK (Addend) Note that The sum can be stored in a third register. But if you want to save shift register, you can store it in A since more and more slots in SRA become available.

  12. Serial Adder At the end of T4 S3 S2S1S0A3 Co D2D1D0B3 A3A2A1A0 B3B2B1B0 ________________ CoS3S2S1S0

  13. Allowing the Serial Adder to Accumulate T3 T2T1T0S3 Ro X2X1X0D3 Co S3 S2 S1S0 D3D2D1D0 ________________ Ro T3 T2 T1 T0

  14. Accumulate with a Shift Register • A, B and D, each represents a 4 bit sequence. • We want to perform A+B+D • Store A in shift register A. • Store B in shift register B. • Allow the CLK to go on for a couple of cycles. • Store the sum bits of A+B in Shift A and allow D to enter shift register B. • Allow more cycles of CLK. • Add D to A+B, and allow A+B+C to enter shift register A.

  15. Block Diagram of a Universal Shift Register This is called the universal shift register because it has both shifts and parallel load capabilities.

  16. Detail Implementation

  17. Four-to-one-line Mux

  18. Mode Control

  19. S0=0, S1=0 [No Change Mode] S0=0, S1=0

  20. S0=1, S1=0 [Shift Right Mode] S1=0 , S0=1

  21. S0=0, S1=1 [Shift Left Mode] S1=1 , S0=0

  22. S0=1, S1=1 [Parallel Load Mode] S1=1 , S0=1

  23. Breadboard Implementation Universal shift regsiter Random Number Generator

  24. Waveform Random A3 A2 A1 A0 CLK

More Related