logging in or signing up 17-Registers kapil99 Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINT lite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 146 Category: Education License: All Rights Reserved Like it (0) Dislike it (0) Added: November 17, 2010 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Registers : 10/29/2003 Registers 1 Registers Today we’ll see another common sequential device: registers. They’re a good example of sequential analysis and design. They are also frequently used in building larger sequential circuits. Registers hold larger quantities of data than individual flip-flops. Registers are central to the design of modern processors. There are many different kinds of registers. We’ll show some applications of these special registers. What good are registers? : 10/29/2003 Registers 2 What good are registers? Flip-flops are limited because they can store only one bit. We had to use two flip-flops for our two-bit counter examples. Most computers work with integers and single-precision floating-point numbers that are 32-bits long. A register is an extension of a flip-flop that can store multiple bits. Registers are commonly used as temporary storage in a processor. They are faster and more convenient than main memory. More registers can help speed up complex calculations. We’ll discuss RAM after next week, and later we’ll also see how registers are used in designing and programming CPUs. A basic register : 10/29/2003 Registers 3 A basic register Basic registers are easy to build. We can store multiple bits just by putting a bunch of flip-flops together! A 4-bit register from LogicWorks, Reg-4, is on the right, and its internal implementation is below. This register uses D flip-flops, so it’s easy to store data without worrying about flip-flop input equations. All the flip-flops share a common CLK and CLR signal. Adding a parallel load operation : 10/29/2003 Registers 4 Adding a parallel load operation The input D3-D0 is copied to the output Q3-Q0 on every clock cycle. How can we store the current value for more than one cycle? Let’s add a load input signal LD to the register. If LD = 0, the register keeps its current contents. If LD = 1, the register stores a new value, taken from inputs D3-D0. Clock gating : 10/29/2003 Registers 5 Clock gating We could implement the load ability by playing games with the CLK input, as shown below. When LD = 0, the flip-flop C inputs are held at 1. There is no positive clock edge, so the flip-flops keep their current values. When LD = 1, the CLK input passes through the OR gate, so the flip-flops can receive a positive clock edge and can load a new value from the D3-D0 inputs. Clock gating is bad : 10/29/2003 Registers 6 Clock gating is bad This is called clock gating, since gates are added to the clock signal. There are timing problems similar to those of latches. Here, LD must be kept at 1 for the correct length of time (one clock cycle) and no longer. The clock is delayed a little bit by the OR gate. In more complex scenarios, different flip-flops in the system could receive the clock signal at slightly different times. This “clock skew” can lead to synchronization problems. A better parallel load : 10/29/2003 Registers 7 A better parallel load Another idea is to modify the flip-flop D inputs and not the clock signal. When LD = 0, the flip-flop inputs are Q3-Q0, so each flip-flop just keeps its current value. When LD = 1, the flip-flop inputs are D3-D0, and this new value is “loaded” into the register. Shift registers : 10/29/2003 Registers 8 A shift register “shifts” its output once every clock cycle. SI is an input that supplies a new bit to shift “into” the register. For example, if on some positive clock edge we have: SI = 1 Q0-Q3 = 0110 then the next state will be: Q0-Q3 = 1011 The current Q3 (0 in this example) will be lost on the next cycle. Shift registers Q0(t+1) = SI Q1(t+1) = Q0(t) Q2(t+1) = Q1(t) Q3(t+1) = Q2(t) Shift direction : 10/29/2003 Registers 9 Shift direction The circuit and example make it look like the register shifts “right.” But it really depends on your interpretation of the bits. If you consider Q3 to be the most significant bit instead, then the register is shifting in the opposite direction! Q0(t+1) = SI Q1(t+1) = Q0(t) Q2(t+1) = Q1(t) Q3(t+1) = Q2(t) Shift registers with parallel load : 10/29/2003 Registers 10 Shift registers with parallel load We can add a parallel load, just like we did for regular registers. When LD = 0, the flip-flop inputs will be SIQ0Q1Q2, so the register shifts on the next positive clock edge. When LD = 1, the flip-flop inputs are D0-D3, and a new value is loaded into the shift register, on the next positive clock edge. Shift registers in LogicWorks : 10/29/2003 Registers 11 Shift registers in LogicWorks Here is a block symbol for the Shift Reg-4 from LogicWorks. The implementation is shown on the previous page, except the LD input here is active-low instead. Serial data transfer : 10/29/2003 Registers 12 Serial data transfer One application of shift registers is converting between “serial data” and “parallel data.” Computers typically work with multiple-bit quantities. ASCII text characters are 8 bits long. Integers, single-precision floating-point numbers, and screen pixels are up to 32 bits long. But sometimes it’s necessary to send or receive data serially, or one bit at a time. Some examples include: Input devices such as keyboards and mice. Output devices like printers. Any serial port, USB or Firewire device transfers data serially. Recent switch from Parallel ATA to Serial ATA in hard drives. Receiving serial data : 10/29/2003 Registers 13 Receiving serial data To receive serial data using a shift register: The serial device is connected to the register’s SI input. The shift register outputs Q3-Q0 are connected to the computer. The serial device transmits one bit of data per clock cycle. These bits go into the SI input of the shift register. After four clock cycles, the shift register will hold a four-bit word. The computer then reads all four bits at once from the Q3-Q0 outputs. serial device computer Sending data serially : 10/29/2003 Registers 14 Sending data serially To send data serially with a shift register, you do the opposite: The CPU is connected to the register’s D inputs. The shift output (Q3 in this case) is connected to the serial device. The computer first stores a four-bit word in the register, in one cycle. The serial device can then read the shift output. One bit appears on Q3 on each clock cycle. After four cycles, the entire four-bit word will have been sent. serial device computer Registers in Modern Hardware : 10/29/2003 Registers 15 Registers in Modern Hardware Registers store data in the CPU Used to supply values to the ALU. Used to store the results. If we can use registers, why bother with RAM? Answer: Registers are expensive! Registers occupy the most expensive space on a chip – the core. L1 and L2 are very fast RAM – but not as fast as registers. Registers summary : 10/29/2003 Registers 16 Registers summary A register is a special state machine that stores multiple bits of data. Several variations are possible: Parallel loading to store data into the register. Shifting the register contents either left or right. Counters are considered a type of register too! One application of shift registers is converting between serial and parallel data. Most programs need more storage space than registers provide. We’ll introduce RAM to address this problem. Registers are a central part of modern processors, as we will see in coming weeks. You do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.
17-Registers kapil99 Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINT lite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 146 Category: Education License: All Rights Reserved Like it (0) Dislike it (0) Added: November 17, 2010 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Registers : 10/29/2003 Registers 1 Registers Today we’ll see another common sequential device: registers. They’re a good example of sequential analysis and design. They are also frequently used in building larger sequential circuits. Registers hold larger quantities of data than individual flip-flops. Registers are central to the design of modern processors. There are many different kinds of registers. We’ll show some applications of these special registers. What good are registers? : 10/29/2003 Registers 2 What good are registers? Flip-flops are limited because they can store only one bit. We had to use two flip-flops for our two-bit counter examples. Most computers work with integers and single-precision floating-point numbers that are 32-bits long. A register is an extension of a flip-flop that can store multiple bits. Registers are commonly used as temporary storage in a processor. They are faster and more convenient than main memory. More registers can help speed up complex calculations. We’ll discuss RAM after next week, and later we’ll also see how registers are used in designing and programming CPUs. A basic register : 10/29/2003 Registers 3 A basic register Basic registers are easy to build. We can store multiple bits just by putting a bunch of flip-flops together! A 4-bit register from LogicWorks, Reg-4, is on the right, and its internal implementation is below. This register uses D flip-flops, so it’s easy to store data without worrying about flip-flop input equations. All the flip-flops share a common CLK and CLR signal. Adding a parallel load operation : 10/29/2003 Registers 4 Adding a parallel load operation The input D3-D0 is copied to the output Q3-Q0 on every clock cycle. How can we store the current value for more than one cycle? Let’s add a load input signal LD to the register. If LD = 0, the register keeps its current contents. If LD = 1, the register stores a new value, taken from inputs D3-D0. Clock gating : 10/29/2003 Registers 5 Clock gating We could implement the load ability by playing games with the CLK input, as shown below. When LD = 0, the flip-flop C inputs are held at 1. There is no positive clock edge, so the flip-flops keep their current values. When LD = 1, the CLK input passes through the OR gate, so the flip-flops can receive a positive clock edge and can load a new value from the D3-D0 inputs. Clock gating is bad : 10/29/2003 Registers 6 Clock gating is bad This is called clock gating, since gates are added to the clock signal. There are timing problems similar to those of latches. Here, LD must be kept at 1 for the correct length of time (one clock cycle) and no longer. The clock is delayed a little bit by the OR gate. In more complex scenarios, different flip-flops in the system could receive the clock signal at slightly different times. This “clock skew” can lead to synchronization problems. A better parallel load : 10/29/2003 Registers 7 A better parallel load Another idea is to modify the flip-flop D inputs and not the clock signal. When LD = 0, the flip-flop inputs are Q3-Q0, so each flip-flop just keeps its current value. When LD = 1, the flip-flop inputs are D3-D0, and this new value is “loaded” into the register. Shift registers : 10/29/2003 Registers 8 A shift register “shifts” its output once every clock cycle. SI is an input that supplies a new bit to shift “into” the register. For example, if on some positive clock edge we have: SI = 1 Q0-Q3 = 0110 then the next state will be: Q0-Q3 = 1011 The current Q3 (0 in this example) will be lost on the next cycle. Shift registers Q0(t+1) = SI Q1(t+1) = Q0(t) Q2(t+1) = Q1(t) Q3(t+1) = Q2(t) Shift direction : 10/29/2003 Registers 9 Shift direction The circuit and example make it look like the register shifts “right.” But it really depends on your interpretation of the bits. If you consider Q3 to be the most significant bit instead, then the register is shifting in the opposite direction! Q0(t+1) = SI Q1(t+1) = Q0(t) Q2(t+1) = Q1(t) Q3(t+1) = Q2(t) Shift registers with parallel load : 10/29/2003 Registers 10 Shift registers with parallel load We can add a parallel load, just like we did for regular registers. When LD = 0, the flip-flop inputs will be SIQ0Q1Q2, so the register shifts on the next positive clock edge. When LD = 1, the flip-flop inputs are D0-D3, and a new value is loaded into the shift register, on the next positive clock edge. Shift registers in LogicWorks : 10/29/2003 Registers 11 Shift registers in LogicWorks Here is a block symbol for the Shift Reg-4 from LogicWorks. The implementation is shown on the previous page, except the LD input here is active-low instead. Serial data transfer : 10/29/2003 Registers 12 Serial data transfer One application of shift registers is converting between “serial data” and “parallel data.” Computers typically work with multiple-bit quantities. ASCII text characters are 8 bits long. Integers, single-precision floating-point numbers, and screen pixels are up to 32 bits long. But sometimes it’s necessary to send or receive data serially, or one bit at a time. Some examples include: Input devices such as keyboards and mice. Output devices like printers. Any serial port, USB or Firewire device transfers data serially. Recent switch from Parallel ATA to Serial ATA in hard drives. Receiving serial data : 10/29/2003 Registers 13 Receiving serial data To receive serial data using a shift register: The serial device is connected to the register’s SI input. The shift register outputs Q3-Q0 are connected to the computer. The serial device transmits one bit of data per clock cycle. These bits go into the SI input of the shift register. After four clock cycles, the shift register will hold a four-bit word. The computer then reads all four bits at once from the Q3-Q0 outputs. serial device computer Sending data serially : 10/29/2003 Registers 14 Sending data serially To send data serially with a shift register, you do the opposite: The CPU is connected to the register’s D inputs. The shift output (Q3 in this case) is connected to the serial device. The computer first stores a four-bit word in the register, in one cycle. The serial device can then read the shift output. One bit appears on Q3 on each clock cycle. After four cycles, the entire four-bit word will have been sent. serial device computer Registers in Modern Hardware : 10/29/2003 Registers 15 Registers in Modern Hardware Registers store data in the CPU Used to supply values to the ALU. Used to store the results. If we can use registers, why bother with RAM? Answer: Registers are expensive! Registers occupy the most expensive space on a chip – the core. L1 and L2 are very fast RAM – but not as fast as registers. Registers summary : 10/29/2003 Registers 16 Registers summary A register is a special state machine that stores multiple bits of data. Several variations are possible: Parallel loading to store data into the register. Shifting the register contents either left or right. Counters are considered a type of register too! One application of shift registers is converting between serial and parallel data. Most programs need more storage space than registers provide. We’ll introduce RAM to address this problem. Registers are a central part of modern processors, as we will see in coming weeks.