Clock Generator 82C84A
|
|
- Esmond Hopkins
- 6 years ago
- Views:
Transcription
1 Clock Generator 82C84A The Intel Clock Generator chip 82C84A includes three functional blocks: Clock Generation circuitry Ready Synchronization Circuitry ivide by 3 Reset Synchronization Circuitry 1. Clock requirements of the 8088/8086 processor: T CLCH = ns min. T CHCL = 68.66ns min. T CLCL = 200 ns min.; 500 ns max Frequency = 5MHz max; 2MHz min. Note: : is about 2:1 T CLCH = ns min T CHCL = 68.66ns min T CLCL = 200 ns min; 500 ns max 8086 processor designer may be performing sub-clock operations (example: ALE, /EN, etc.) So, duty cycle of 33% for the clock may be the best for the processor. 33% uty Cycle is not a requirement. We can satisfy all three requirements, T CLCH min, T CHCL min, and T CLCL min by choosing 50% duty cycle clock of clock period 400ns! processor vs. 80C86 processor: What does that C mean? Why there is a minimum frequency (2 MHz) requirement for the 8086 processor? 8086 HMOS up HMOS = High Performance MOS technology ynamic 80C86 80C86-2.C. Note:.C. Static.C. 80C86 CHMOS up High performance CMOS 1/29/
2 CMOS is known as static logic to differentiate from the dynamic logic. In the case of dynamic sequential logic, data sometimes stays on the capacitors. So if the frequency is too low, the data will be lost due to leakage on the capacitors. More in EE477A/577A. φ 1 φ 2 C1 C2 φ 1 φ 2 C1 shall hold charge for this time Non-overlapping phases of 3. How to generate a 33% duty clock The piezoelectric crystal oscillator produces 50% duty clock. So to produce 33% duty cycle 4.77 MHz clock (as in the case of PC XT), they started with MHz crystal, produced MHz 50%.C. clock and then passed it through a divide-by-3 counter MHz 50%.C. ivide- -by MHz 33%.C Asynchronous Inputs: Examples of asynchronous inputs: Inputs from human, inputs from other subsystems working on a different independent clock If the asynchronous input changes too late into the clock, the system can go into wrong states! A 1 0 X = X = 1 C B Wrong state reached due to X changing rather late. X Asynchronous Next State Logic * * 0 1 State Memory 0 1 1/29/
3 5. Synchronization of asynchronous signals by using a synchronizing FF: XA X_Asynchronous Synchronizing flip-flop Sample-and-hold flip-flop XS X_Synchronized Next State Logic * * 0 1 State Memory 0 1 Should this sampling edge be the same or opposite of the significant edge of the system? Simple intuitive answer: Well if it is the same edge we create a RACE condition. So it should be opposite edge. That is in fact a naive answer! A more thoughtful answer is that we use the same edge. Because of the finite propagation delay of the synchronizing FF (which is made sure to be greater than the hold time requirements of the receiving system/ffs), the RACE condition is carefully overcome in EVERY digital design. A 16-bit shift register needs only one clock to shift all 16 bits by 1-bit right. It does not need 16 clocks or 16 half-clocks! It works on one single edge of a clock because of the finite propagation delay of the left side FF exceeding the hold time requirement of the right-side FF. More on timing design in EE560. Serial_In Remember for your life if you want to be a digital designer t P > t h What if the above relation is not satisfied? How do you fix it? 6. The clock for synchronization shall be the (sending/receiving) system's clock. Example from EE201L homework: System-33 System-44 System-33 System-44 System-33 System-44 System based on 33 MHZ Clock O-IT ONE System based on 44 MHZ Clock System based on 33 MHZ Clock O_IT 33 MHZ S_ONE S_O_IT ONE 44 MHZ System based on 44 MHZ Clock System based on 33 MHZ Clock O_IT S_O_IT 44 MHZ S_ONE ONE 33 MHZ System based on 44 MHZ Clock esign # 1 esign # 2 esign # 3 1/29/
4 esign # 1 experiences synchronization problems as the O-IT signal is asynchronous to the (System-33/ System-44) and also the ONE signal is asynchronous to the (System-33/ System-44). Between esign #2 and # 3, is right and is wrong. 7. Metastability Even the sampling and hold flip-flop may not be able to help, if the asynchronous input actually changes right at the time of sampling. The output of the sampling flip-flop may go into metastability (a state which is neither a 1 nor a 0 ). To understand this, analyze what happens when you try to set a simple cross connected NANpair bistable, but do not hold the set input active long enough. S R If this pulse is short, then, may go into a metastable state In the case of a master-slave -FF, the master can go into a metastable state if the input changes during the setup time; and consequently, the slave goes into a metastable state. 8. What is meant by flip-flops hardened against metastability? S = 1=>0=>1 =0=>1 =1=>0 It should be noted that even if a flip-flop goes into a metastable state, it is generally difficult for it to remain in such a state. It is like... even if you manage to make a knife stand on its edge for a second, it is likely to fall one way or other very soon. By making the edge of the knife sharper, you reduce the probability of its standing on its edge for notable length of time. Similarly, by increasing the loop gain of the cross connected pair of NAN gates/nor gates making a bistable, any small disturbance (disturbance to the precarious metastable state) will get amplified and push the system to go into one of the two stable states of the bistable. Such flip-flops, which are made to very quickly come out of the metastable state even if they very rarely went in are called flip-flops hardened against metastability. R = 1 9. ouble-synchronization helps to reduce the probability of failure due to metastability: XA Increases MTBF (Mean Time Between failures) XS XSS Next State Logic * * 0 1 State Memory Here we employ two Synchronizing flip-flops. Even if the first one goes into a metastable state, it is expected that it would come out of the metastable state by the time the second flip-slop tries to sample the output of the first flip-flop. More in EE552/EE560: What do we do if we received a multi-bit asynchronous data? No, we do not use multiple synch. FFS /29/
5 10. Why does RES (asynchronous RESET) need to be synchronized to produce synchronous RESET? Isn t it true that if we are resetting the system anyway, we are aborting whatever we are doing and going into the INITIAL state. If so, does it matter if we abort synchronously or asynchronously? It is not about when you go into reset. It is about when you come out of reset. The RESET signal is usually generated using an R-C network. Hence it is an asynchronous signal. After the R-C time constant, if the reset signal becomes inactive just before (or at) the significant edge of the clock, then some flip-slops in the state memory may be able to come out of the reset state and start honoring the next-state bits standing at their -inputs, while some other flip-flops may still be in the reset state. This causes the system to go into wrong/illegal states. Let us first explain the problem using the 5-state dish-washer state-machine of EE201L. Let us assume that the ~RESET is asynchronous and becomes inactive just before (or at) the significant edge of the clock (positive edge in this problem). Also assume that the START happens to be true at that time. It is possible for the one-hot flip-flop ONE to continue to remain in the reset state ( ONE = 1), while at the same time the A_WATER flip-flop may come out of reset and go to 1 ( A_WATER = 1). So we have two FFs hot in the one-hot system! Solution: synchronize the asynchronous ~RESET to produce a synchronous reset signal ~SYNC_RESET CS= ~RESET S= START = 0 A WATER CS= S= RINSE RAIN RY ONE Too close to clock edge START = 1 ~RESET ONE A_WATER RAIN CS START NSL START S S CS A_WATER RINSE NSL RAIN RY NSL ONE ONE ~RESET ~RESET ~SYNC_RESET Better to replace this with this. 1/29/
6 11. Why does RY need to be synchronized? It depends on whether RY is synchronous are asynchronous. Why do you expect that it would be asynchronous? Isn t it true that the WSG (wait state generator) ( which is a state machine) is clocked by the same clock as the processor? Yes and No! If the WSG is clocked by the same clock as the processor, then the RY is synchronous. Then we can choose to avoid going through the synchronizing FFs in the 82C84A and go directly to the input of the processor. same WSG up RY irect, bypassing FFs in 82C84A Or, alternatively, the RY output of the WSG can be taken through one or two flip-flops in the 82C84A before going to the input of the processor. In that case, we simply treat the synchronizing FFs in the 82C84 as simple delay flip-flops and accordingly design our WSG. 82C84A FF1 FF2 same up RY WSG If you want to pass through only ONE flip-flop, should it be FF1 or FF2 or any one of the two? If the WSG is clocked by a different clock (different from the processor clock), then the RY is asynchronous. If it is asynchronous, then it needs to be synchronized (perhaps by going through one of the two FFs in the 82C84A). 82C84A FF1 FF2 It is very common to have multiple clock domains in a major system such as a PC. The board runs at one clock and the PCI bus runs at a different clock for example. So it is possible that the WSG is running at a clock different from the clock of the processor. 12. If the WSG is working on a different clock, then it shall be designed as a NORMALLY NOT SYSTEM (NNR). Why? How about in the case of the same clock situation? (NR / NNR) up different RY WSG NORMALLY NOT SYSTEM 1/29/
7 13. When should an input such as, INTR, HOL, etc. be valid and stable? Based on the bus activity sensed on the pins of the processor (as seen on logic analyzer in lab #4), we can assume that the BIU of 8088/8086 follows the simplified State iagram given on the side. Then, in the case of, you (the board-level designer) would expect that you need to provide a VALI and STABLE input to the processor well-in advance (or reasonably in advance) for the NSL (Next State Logic) of the BIU to produce proper desired next state after T3 (as T4 or TW) and after TW (as T4 or TW). Based on our synchronous system design experience in EE201L, we would expect that the should be valid and stable starting from Tsu (T setup time) before the state transition edge of the clock (negative-edge of the clock here) to Th (T hold time) after the edge. Simplified State iagram for the BIU of 8088/8086 P TI P P P T1 T2 T3 T4 TW P = There is a PENING bus-cycle to perform So the following is our expectation for the timing requirements imposed on the input: ALE T1 T2 T3 TW TW T4 Tsu Th Tsu Th Tsu Th While the expectation is reasonable and justified, the actual timing requirements published in the data sheets are quite different. It may be because, the actual design may not be following pure synchronous design principles, may be using sub-clock operations, may be affecting circuitry other than the simplified state machine for the BIU that we assumed. 1/29/
8 14. A Normally Ready (NR) System and a Normally Not Ready (NNR) System Minus? -8 ns setup time 119ns setup time 30ns hold time Middle edge of T3! 119ns setup time 30ns hold time Reproduced above are diagrams from the 8086/8088 user manual. Several things to notice are: 1. There are two systems, NR and NNR, with different timing requirements. 2. The setup time and hold time are specified sometimes with respect to the middle-edge (positive-edge) of a T-state rather than the significant (state-transition) edge namely the negativeedge. 3. In the case of NNR, the setup time requirement is strangely negative (- 8 ns)! 1/29/
9 14.1.A What is NR and what is NNR? Which is safe? Control room Field Let us take an example of a repair work in a chemical Pump On plant. There are 2 operators A and B and one assistant Off C. After detecting that the water pump in the field is not coming on (even after a low-water alarm from the water tank), operators A switches off power to the A B C pump and sends B and C to the field to open the pump and fix it. They estimated that it would take 30 minutes to fix the pump. Assume that there were no cell phones (or walkie-talkies) in those days! After B and C fix the pump, A needs to switch-on power so that the operator B in the field can see if the pump is now starting. Consider the following two understandings (protocols) among the operators. Normally Ready system: If the fixing job does not seem to be finishing in 30 minutes, B should send the assistant C to the control room to tell A not to switch-on power. In the absence of any such communication, A can assume that the job is done in 30 minutes (Normally Ready in the expected time) and A may switch-on power at the end of 30 minutes. Normally Not Ready system: Here A assumes that B and C are Normally Not Ready and will not switch-on power until there is a positive confirming message from B (through the messenger C) that he is done. While both systems can work, which is safe? And why? 14.1.B Well, we said that the Normally Not Ready system is safe because we do not want B and C to get hurt if they get so involved in fixing the pump that they forget to tell A that they are not done. So we are taking into account the human forgetfulness and consequent safety aspects. But if we are considering designing a wait-state generator, which is the safe system? First consider the following definitions of a NR and a NNR system in the context of a WSG (Wait State Generator). A Normally Ready System: The wait-state generator keeps the line by default active (i.e. normally = 1 during T1 and T2 for example) and will inactivate it (make = 0) if needed (i.e. if the WSG determines that the current bus cycle is addressing a slow memory or I/O device needing one or more wait states) and will eventually activate the ( = 1). See fig A Normally Not Ready System: The wait-state generator keeps the line by default inactive (i.e. normally = 0 during T1 and T2 for example) and will activate it (make = 1) as needed (i.e. if the WSG determines that the current bus cycle is addressing a fast or slow memory or I/O device decides when to make the active). See fig Safety? Preference? Well, unlike a human, who tends to be forgetful, an electronic system is not expected to be forgetful. It can malfunction and if it does malfunction, anyway we need to fix it. 1/29/
10 But how about multiple clock-domains and synchronization across clock domains? What do you mean? Well, what if the processor is working on a clock different from the wait state generator? A simple example of such a situation is in the context of a multi-processor system where is each processor is working on its own clock and the global memory has its own clock. Even in a single-processor system, in current day systems, the processor often works at a very high frequency (say, 3 GHz) compared to memory and I/O. Subsystems such as RAM subsystem, EPROM subsystem, and PCI subsystem have their own clocks. Even if all these clocks are related to each other (perhaps derived from one primary clock source), we can not guarantee good phase relation between them because of varying delays on clock traces on PCB. So these clocks have to be treated as asynchronous to each other. So a signal originating from one subsystem is an asynchronous signal input to another subsystem. OK, how would we judge if NR is better or NNR is better (or neither is good enough!) if the WSG is using a clock different from the processor s clock. Whenever, we convey information (such as active or inactive) from one subsystem to another subsystem working on a different clock, we need to go through the synchronizing flipflops (sample and hold flip-flops). The synchronizing flip-flop may miss to capture the latest value if the latest value has arrived at or around receiving systems sampling. You have heard the phrase, err on the safe side. It means that even if we are making an error, it should only be increasing safety rather than decreasing it. So a loss of a clock or two in synchronizing (in producing the synchronous output from the asynchronous RY input) should not result in producing wrong results. It is fine if we end up adding a couple more wait states where we O NOT need, because it only wastes a couple of clocks but still produces correct result. However, you should never end up missing to add the necessary wait states because then you will be reading/writing wrong data from/into memory. Please note that the NNR system is safe as you started with saying that you are NOT. After sometime you say that you are ready. This new information may reach sometimes quickly and sometimes with an additional clock delay of the receiver s clock. That means you will have either the exact number of wait states or sometimes one extra wait state (which is safe). You will never have one less wait state We notice that the setup is measured with respect to the middle edge (positive-edge) of TW (and T3 in the case of NNR system) where as we were expecting that it should be measured with respect to the ending-edge (negative-edge) of these T states. True, but then we do not know the actual internal design of the 8086/8088 CPU. They may have some of the internal circuitry sensitive to positive edges, they may be doing gated-clock operations (covered in EE560), and so on. So we need to just go by the data sheet and meet all timing requirements stated there (collectively and individually). 1/29/
11 14.3 In the case of NR system, setup time requirement was stated as -8 (negative 8, minus 8) with respect to the beginning of T3 (end of T2). How is it negative??!! Well, let us go through the EE201L homework problem below. 6.1 The setup and hold time of a flip-flop are 0.3ns and 0.1ns, respectively; but because of the routing issues, some delay may happen on one or both input signals ( and ). The amount of this delay which can be modeled by a buffer is 0.04ns. In the presence of this delay, the setup and hold time of the whole circuit may change. t setup = 0.3ns t hold = 0.1ns A 0.04ns 0.04ns B delay=0.04ns C 0.04ns 0.04ns The setup and hold time of circuit A are t setup = ; t hold = The setup and hold time of circuit B are t setup = ; t hold = The setup and hold time of circuit C are t setup = ; t hold = So now you agree that even though the internal FF has +20 ns setup time, due to a 28 ns delay in the clock buffer, externally it looks like a FF with -8 ns (negative 8 ns) setup time! i.e. The external input can start 8 ns after the external clock and yet be 20 ns before the internal clock because the 28 ns delay incurred by the clock signal. delay = 28 ns t setup = 20 ns t setup (overall) = - 8 ns 1/29/
12 15. F/C and EFI inputs to 82C84A: You see a 2-to-1 mux controlled by the select line F/C (Frequency/Crystal) to select between the External Frequency Input (EFI) and clock produced by the crystal oscillator. In a multiprocessor system of (say) 2 processors, to keep the two processors to work of the same frequency, you employ two 82C84A chips (one in each processor subsystem), but you would use a crystal with one of the two and use EFI for the other as shown below. The common CSYNC (which is active initially for a short time) will start the two divide-by-3 counters in the same phase. V GN Common CSYNC 16. ouble synchronization and the ASYNC input:. to P0 to P1 The system designer (boardlevel designer) has a choice of using two Flip-Flops or FF1 one Flip-Flop for synchronization by tying the ASYNC FF2 input to GN or V. Also note that they used a positive-edge triggered flip-flop for FF1 (flip-flop1). It means that they are allowing only one-half of a clock (to be precise one-third of a clock if we are using a 33%.C. clock) for the FF1 to come out of metastable condition (if it ever goes into metastable condition). That is reasonable because the clocks at that time were very slow. A clock with 210 ns clock period will provide 70ns for the FF1 to settle. In some of the current high-speed designs, sometimes they do one of the following two: (i) allow multiple clocks for the synchronizing flip-flops to settle by clocking them by a derived clock of say one-fourth frequency. (ii) use three or four flip-flops to make sure that even if the first could not come out of the metastable condition at the end of a clock, hopefully the second, which consequently goes into a metastable condition, would come out of that condition in one clock. The expectation is that we shouldn t be that unlucky to have a series of flip-flops to go into metastability and not come out of this condition in one clock! Refer to the book, igital esign - Principles and Practices by Wakerly for a detailed discussion on this issue. 1/29/
13 17. To satisfy the timing requirements of the input on the CPU, we can choose the severe most requirement of the multiple requirements and satisfy the same. ALE T1 T2 T3 TW T4 Out of the three cases shown here, the severe most requirement comes from the normally ready system which requires that the input be stable latest by 8ns into T3. So if we make sure that we follow this requirement by using the synchronizing Flip- Flop FF2 in 82C84A (triggered by the neg. edge of ), then the input will be Tsu1= -8ns should go low latest by 8ns into T3 Tsu2 = 119ns Normally Ready System valid from the beginning of T3 (and Tw). And since FF2 updates the sample at every neg-edge, the output of FF2 is definitely stable at the positive edges. This explains how the 82C84A (with FF2 producing ) satisfies the requirements of the input of the CPU. Th = 30ns T1 T2 T3 TW T4 T1 T2 T3 T4 T4 ALE ALE Tsu2 = 119ns Th = 30ns Tsu2 = 119ns Th = 30ns Normally NOT Ready System 35ns RY 0ns 8ns 1/29/
14 oes the fig depict the timing requirements for the RY input assuming that it is lead to the FF#2 directly or it is led to FF#1 and FF#2? How do you tell? How would you draw a timing requirements diagram for the other? 18. Wait State Generator (WSG) design: 18.1 Here, in our EE454L, most of the time, we are using the processor clock or some clock derived from the processor clock to control the WSG. So it is possible to bypass the RY synchronization circuit in the 82C84A. Or if we go through the synchronization Flip-Flop in the 82C84A, we can accordingly produce an appropriate RY (appropriately timed RY) While we can generally say that if we are planning to go through an intermediate stage/ff, we need to say whatever we would like to say a little early, we should be careful in deciding whether it should be early by one clock or half clock or one and a half clock or zero clocks! o not make a hasty decision Basic design idea we use here is as follows: The WSG is a state machine. It gets initialized at the beginning of a bus cycle (i.e. during T1 state). The special signal which identifies the T1 state is the ALE (Address Latch Enable). When the BIU in the CPU) is going though the T1 state the ALE puts the WSG in a state called (let us call) WT1 (Wait State Generator s T1 state). We want the WSG to track the CPU. So when the CPU moves to T2, the WSG shall move to WT2. Whether WT2 matches T2 exactly in time or with a half clock delay or a full clock delay depends on your design. It depends upon two aspects: 1. when is WSG coming out of asynchronous/synchronous resetting and 2. what significant clock edge is used for WSG state transitions A simple design would use a shift register asynchronously initialized by the ALE when it is active. We can first clear the shift register using ALE, then we can start shifting a 1 from one end of the shift register. So the shift register s outputs provide a step-like waveform (0 goes high, then 1 goes high, so on and so forth) Note that, once the CPU (the BIU, the Bus Interface Unit) reaches T4 state, it does not care what your WSG is telling and what value it sees on until the T3 of the next bus cycle. So, it is fine to have = 1 or = 0 constantly during T4 and subsequent Ti (T_idle state of the BIU). It is fine even to make the signal go up and down! 18.6 While ALE initialization of WSG is common to bring the WSG to WT1 state (Wait-State Generator s T1 state), some designers may use the inactive-state of the R and WR signals (both inactive together, i.e. R = 1 and WR = 1) to initialize the WSG Consider the interrupt acknowledge (INTA) bus cycles also in designing the WSG and note that the address (A19-A0) is unknown during the INTA bus cycle. You can use (R = 1 and WR = 1 and INTA = 1) as a better initialization mechanism. You can consider producing a different 1/29/
15 number of wait-states for the read bus cycles and another different number of wait-states for the write bus cycles. For example, a design problem statement could be as follows: The address range of FFFF is occupied by a memory which needs one wait state for the read bus cycles and two wait states for the write bus cycle. In the same system, the address range of FFFF is occupied by a memory which needs two wait states for the read bus cycles and one wait state for the write bus cycle. uring the interrupt acknowledge (INTA) bus cycles we need 2 wait states. Note that the address is unknown during the interrupt acknowledge (INTA) bus cycles. In most of the problems in the homework on the WSG design, we do not bring-in the interrupt acknowledge (INTA) bus cycles, as interrupts are covered much later One could think of using a regular state machine instead of a shift register to have greater flexibility in what to do in what bus cycle. ALE=1 WT2_REA else R = 0 WT1 WR = 0 ALE=1 INTA = 0 ALE=1 ALE=1 WT2_WRITE WT2_INTA WT2_REA WT2_delayed_REA WT3_REA WTx_REA WTy_WRITE WTz_INTA 18.9 ALE, (which goes active consequent to the beginning negative edge of in the T1 state), goes inactive consequent to the middle positive edge of. So it is important to understand that at the middle positive edge of the T1 state, the FFs in the shift register of the WSG can not start shifting data from the inputs as they are still forced to remain in the initialization state. Similarly, if you are using R = 1 and WR = 1 as an initialization mechanism, since one of them goes inactive only consequent to the beginning edge of T2 state, the initialization is in force at the beginning negative edge of T2. ALE R T1 T2 T3 T4 Ti T1 T2 T3 T4 Ti 1/29/
16 18.10 An example design of a WSG using a shift register: raw the waveforms of 1, 2, 3, 4 and 5. If 4 is used as RY1 and is passed through FF2 (only FF2) in the 82C84A (i.e. with ASYNC tied to V) how many wait states are inserted in each bus cycle. VCC VCC VCC VCC VCC V PRE PRE PRE PRE PRE CLR CLR CLR CLR CLR ALE 82C Explain why you need an inverter here. 4 RY1 T1 T2 T3 TW T V ASYNC ALE (RY1) Now consider a slightly modified version of the above problem. RY1 is passed through FF1 and FF2 by tying the ASYNC input to GN. Are we violating any setup time or hold time? 1/29/
17 In the problem, if we used negative-edge triggered flip-flops instead of positive-edge triggered flip-flops and passed RY1 through FF1 and FF2 by tying the ASYNC input to GN, what happens? ALE T1 T2 T3 TW T 4 82C84 RY1 ASYNC GN (RY1) 5 1/29/
Chapter 9. Timing Design. (Based on Chapter 7 and Chapter 8 of Wakerly)
Chapter 9 Timing esign (Based on Chapter 7 and Chapter 8 of Wakerly) 1 Metastability in bistables, latches, and flip-flops Bistable uestion: How long the set or reset control should be active before becoming
More informationChapter 9. Timing Design. (Based on Chapter 7 and Chapter 8 of Wakerly) Data Path Comb. Logic. Reg. Reg. Reg C <= A + B
Chapter 9 Timing esign (Based on Chapter 7 and Chapter 8 of Wakerly) Timing Check X State machine Next State Logic * * 0 1 State Memory 0 1 EN Counter * 0 * Incrementer 1 0 1 A B Reg Reg ata Path Comb.
More informationDigital Fundamentals
igital Fundamentals Tenth Edition Floyd Chapter 7 Modified by Yuttapong Jiraraksopakun Floyd, igital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Summary Latches A latch is a temporary
More information2.6 Reset Design Strategy
2.6 Reset esign Strategy Many design issues must be considered before choosing a reset strategy for an ASIC design, such as whether to use synchronous or asynchronous resets, will every flipflop receive
More informationCombinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationIntroduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1
2007 Introduction BK TP.HCM FLIP-FLOP So far we have seen Combinational Logic The output(s) depends only on the current values of the input variables Here we will look at Sequential Logic circuits The
More informationECEN454 Digital Integrated Circuit Design. Sequential Circuits. Sequencing. Output depends on current inputs
ECEN454 igital Integrated Circuit esign Sequential Circuits ECEN 454 Combinational logic Sequencing Output depends on current inputs Sequential logic Output depends on current and previous inputs Requires
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
More informationReview of digital electronics. Storage units Sequential circuits Counters Shifters
Review of digital electronics Storage units Sequential circuits ounters Shifters ounting in Binary A counter can form the same pattern of 0 s and 1 s with logic levels. The first stage in the counter represents
More informationLec 24 Sequential Logic Revisited Sequential Circuit Design and Timing
Traversing igital esign EECS - Components and esign Techniques for igital Systems EECS wks 6 - Lec 24 Sequential Logic Revisited Sequential Circuit esign and Timing avid Culler Electrical Engineering and
More informationPGT104 Digital Electronics. PGT104 Digital Electronics
1 Part 5 Latches, Flip-flop and Timers isclaimer: Most of the contents (if not all) are extracted from resources available for igital Fundamentals 10 th Edition 2 Latches A latch is a temporary storage
More informationChapter 6. Flip-Flops and Simple Flip-Flop Applications
Chapter 6 Flip-Flops and Simple Flip-Flop Applications Basic bistable element It is a circuit having two stable conditions (states). It can be used to store binary symbols. J. C. Huang, 2004 Digital Logic
More informationLogic Gates, Timers, Flip-Flops & Counters. Subhasish Chandra Assistant Professor Department of Physics Institute of Forensic Science, Nagpur
Logic Gates, Timers, Flip-Flops & Counters Subhasish Chandra Assistant Professor Department of Physics Institute of Forensic Science, Nagpur Logic Gates Transistor NOT Gate Let I C be the collector current.
More informationKeeping The Clock Pure. Making The Impurities Digestible
Keeping The lock Pure or alternately Making The Impurities igestible Timing is everything. ig ir p. 99 Revised; January 13, 2005 Slide 0 arleton University Vitesse igital ircuits p. 100 Revised; January
More informationCS8803: Advanced Digital Design for Embedded Hardware
Copyright 2, 23 M Ciletti 75 STORAGE ELEMENTS: R-S LATCH CS883: Advanced igital esign for Embedded Hardware Storage elements are used to store information in a binary format (e.g. state, data, address,
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring Chapter 3 :: Sequential Logic Design
igital Logic & Computer esign CS 4341 Professor an Moldovan Spring 21 Copyright 27 Elsevier 3- Chapter 3 :: Sequential Logic esign igital esign and Computer Architecture avid Money Harris and Sarah
More information11. Sequential Elements
11. Sequential Elements Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 11, 2017 ECE Department, University of Texas at Austin
More informationEngr354: Digital Logic Circuits
Engr354: igital Circuits Chapter 7 Sequential Elements r. Curtis Nelson Sequential Elements In this chapter you will learn about: circuits that can store information; Basic cells, latches, and flip-flops;
More informationSoftware Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits
Software Engineering 2DA4 Slides 9: Asynchronous Sequential Circuits Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of
More informationBUSES IN COMPUTER ARCHITECTURE
BUSES IN COMPUTER ARCHITECTURE The processor, main memory, and I/O devices can be interconnected by means of a common bus whose primary function is to provide a communication path for the transfer of data.
More informationFSM Cookbook. 1. Introduction. 2. What Functional Information Must be Modeled
FSM Cookbook 1. Introduction Tau models describe the timing and functional information of component interfaces. Timing information specifies the delay in placing values on output signals and the timing
More informationFlip-Flops. Because of this the state of the latch may keep changing in circuits with feedback as long as the clock pulse remains active.
Flip-Flops Objectives The objectives of this lesson are to study: 1. Latches versus Flip-Flops 2. Master-Slave Flip-Flops 3. Timing Analysis of Master-Slave Flip-Flops 4. Different Types of Master-Slave
More informationChapter 7 Sequential Circuits
Chapter 7 Sequential Circuits Jin-Fu Li Advanced Reliable Systems (ARES) Lab. epartment of Electrical Engineering National Central University Jungli, Taiwan Outline Latches & Registers Sequencing Timing
More informationClocking Spring /18/05
ing L06 s 1 Why s and Storage Elements? Inputs Combinational Logic Outputs Want to reuse combinational logic from cycle to cycle L06 s 2 igital Systems Timing Conventions All digital systems need a convention
More informationMore on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98
More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 98 Review: Bit Storage SR latch S (set) Q R (reset) Level-sensitive SR latch S S1 C R R1 Q D C S R D latch Q
More informationLecture 8: Sequential Logic
Lecture 8: Sequential Logic Last lecture discussed how we can use digital electronics to do combinatorial logic we designed circuits that gave an immediate output when presented with a given set of inputs
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationLecture 11: Sequential Circuit Design
Lecture 11: Sequential Circuit esign Outline q Sequencing q Sequencing Element esign q Max and Min-elay q Clock Skew q Time Borrowing q Two-Phase Clocking 2 Sequencing q Combinational logic output depends
More informationRS flip-flop using NOR gate
RS flip-flop using NOR gate Triggering and triggering methods Triggering : Applying train of pulses, to set or reset the memory cell is known as Triggering. Triggering methods:- There are basically two
More informationBasis of sequential circuits: the R-S latch
equential logic Asynchronous sequential logic state changes occur whenever state inputs change (elements may be simple wires or delay elements) ynchronous sequential logic state changes occur in lock step
More informationSequential Circuit Design: Part 1
Sequential Circuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking Clocked inverters James Morizio 1 Sequential Logic FFs
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Summer 2016 State-Holding Elements Bistable Elements S Latch Latch Positive-Edge-Triggered Flip-Flop Flip-Flop with
More informationEL302 DIGITAL INTEGRATED CIRCUITS LAB #3 CMOS EDGE TRIGGERED D FLIP-FLOP. Due İLKER KALYONCU, 10043
EL302 DIGITAL INTEGRATED CIRCUITS LAB #3 CMOS EDGE TRIGGERED D FLIP-FLOP Due 16.05. İLKER KALYONCU, 10043 1. INTRODUCTION: In this project we are going to design a CMOS positive edge triggered master-slave
More informationChapter 2. Digital Circuits
Chapter 2. Digital Circuits Logic gates Flip-flops FF registers IC registers Data bus Encoders/Decoders Multiplexers Troubleshooting digital circuits Most contents of this chapter were covered in 88-217
More informationChapter 5 Flip-Flops and Related Devices
Chapter 5 Flip-Flops and Related Devices Chapter 5 Objectives Selected areas covered in this chapter: Constructing/analyzing operation of latch flip-flops made from NAND or NOR gates. Differences of synchronous/asynchronous
More informationYEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall
YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall Objective: - Dealing with the operation of simple sequential devices. Learning invalid condition in
More informationUnit 11. Latches and Flip-Flops
Unit 11 Latches and Flip-Flops 1 Combinational Circuits A combinational circuit consists of logic gates whose outputs, at any time, are determined by combining the values of the inputs. For n input variables,
More informationRS flip-flop using NOR gate
RS flip-flop using NOR gate Triggering and triggering methods Triggering : Applying train of pulses, to set or reset the memory cell is known as Triggering. Triggering methods:- There are basically two
More informationDigital Fundamentals 11/2/2017. Summary. Summary. Floyd. Chapter 7. Latches
igital Fundamentals Tenth Edition Floyd hapter 7 2009 Pearson Education, Upper 2008 Pearson Saddle iver, Education N 07458. All ights eserved A latch is a temporary storage device that has two stable states
More informationSequential Circuit Design: Part 1
Sequential ircuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking locked inverters Krish hakrabarty 1 Sequential Logic FFs
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Fall 2012 State-Holding Elements Bistable Elements Equivalent circuits; right is more traditional. Two stable states:
More informationCSE115: Digital Design Lecture 23: Latches & Flip-Flops
Faculty of Engineering CSE115: Digital Design Lecture 23: Latches & Flip-Flops Sections 7.1-7.2 Suggested Reading A Generic Digital Processor Building Blocks for Digital Architectures INPUT - OUTPUT Interconnect:
More informationDEDICATED TO EMBEDDED SOLUTIONS
DEDICATED TO EMBEDDED SOLUTIONS DESIGN SAFE FPGA INTERNAL CLOCK DOMAIN CROSSINGS ESPEN TALLAKSEN DATA RESPONS SCOPE Clock domain crossings (CDC) is probably the worst source for serious FPGA-bugs that
More informationIT T35 Digital system desigm y - ii /s - iii
UNIT - III Sequential Logic I Sequential circuits: latches flip flops analysis of clocked sequential circuits state reduction and assignments Registers and Counters: Registers shift registers ripple counters
More informationINTRODUCTION TO SEQUENTIAL CIRCUITS
NOTE: Explanation Refer Class Notes Digital Circuits(15EECC203) INTRODUCTION TO SEQUENTIAL CIRCUITS by Nagaraj Vannal, Asst.Professor, School of Electronics Engineering, K.L.E. Technological University,
More information6. Sequential Logic Flip-Flops
ection 6. equential Logic Flip-Flops Page of 5 6. equential Logic Flip-Flops ombinatorial components: their output values are computed entirely from their present input values. equential components: their
More informationSequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1
Sequential Logic E&CE 223 igital Circuits and Systems (A. Kennings) Page 1 Sequential Circuits Have considered only combinational circuits in which circuit outputs are determined entirely by current circuit
More informationCHAPTER 1 LATCHES & FLIP-FLOPS
CHAPTER 1 LATCHES & FLIP-FLOPS 1 Outcome After learning this chapter, student should be able to; Recognize the difference between latches and flipflops Analyze the operation of the flip flop Draw the output
More informationEECS150 - Digital Design Lecture 10 - Interfacing. Recap and Topics
EECS150 - Digital Design Lecture 10 - Interfacing Oct. 1, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John Wawrzynek)
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationCOMP sequential logic 1 Jan. 25, 2016
OMP 273 5 - sequential logic 1 Jan. 25, 2016 Sequential ircuits All of the circuits that I have discussed up to now are combinational digital circuits. For these circuits, each output is a logical combination
More informationhttps://daffy1108.wordpress.com/2014/06/08/synchronizers-for-asynchronous-signals/
https://daffy1108.wordpress.com/2014/06/08/synchronizers-for-asynchronous-signals/ Synchronizers for Asynchronous Signals Asynchronous signals causes the big issue with clock domains, namely metastability.
More informationThe outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both).
1 The outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both). The value that is stored in a flip-flop when the clock pulse occurs
More informationSystem IC Design: Timing Issues and DFT. Hung-Chih Chiang
System IC esign: Timing Issues and FT Hung-Chih Chiang Outline SoC Timing Issues Timing terminologies Synchronous vs. asynchronous design Interfaces and timing closure Clocking issues Reset esign for Testability
More informationChapter 11 Latches and Flip-Flops
Chapter 11 Latches and Flip-Flops SKEE1223 igital Electronics Mun im/arif/izam FKE, Universiti Teknologi Malaysia ecember 8, 2015 Types of Logic Circuits Combinational logic: Output depends solely on the
More informationOutline. EECS150 - Digital Design Lecture 27 - Asynchronous Sequential Circuits. Cross-coupled NOR gates. Asynchronous State Transition Diagram
EECS150 - Digital Design Lecture 27 - Asynchronous Sequential Circuits Nov 26, 2002 John Wawrzynek Outline SR Latches and other storage elements Synchronizers Figures from Digital Design, John F. Wakerly
More informationUNIT-3: SEQUENTIAL LOGIC CIRCUITS
UNIT-3: SEQUENTIAL LOGIC CIRCUITS STRUCTURE 3. Objectives 3. Introduction 3.2 Sequential Logic Circuits 3.2. NAND Latch 3.2.2 RS Flip-Flop 3.2.3 D Flip-Flop 3.2.4 JK Flip-Flop 3.2.5 Edge Triggered RS Flip-Flop
More informationName Of The Experiment: Sequential circuit design Latch, Flip-flop and Registers
EEE 304 Experiment No. 07 Name Of The Experiment: Sequential circuit design Latch, Flip-flop and Registers Important: Submit your Prelab at the beginning of the lab. Prelab 1: Construct a S-R Latch and
More informationSequential Logic and Clocked Circuits
Sequential Logic and Clocked Circuits Clock or Timing Device Input Variables State or Memory Element Combinational Logic Elements From combinational logic, we move on to sequential logic. Sequential logic
More informationFundamentals of Computer Systems
Fundamentals of omputer Systems Sequential Logic Martha A. Kim olumbia University Spring 2016 1/1 2/1 Bistable Elements Equivalent circuits; right is more traditional. Two stable states: 0 1 1 0 3/1 S
More informationSEQUENTIAL LOGIC. Satish Chandra Assistant Professor Department of Physics P P N College, Kanpur
SEQUENTIAL LOGIC Satish Chandra Assistant Professor Department of Physics P P N College, Kanpur www.satish0402.weebly.com OSCILLATORS Oscillators is an amplifier which derives its input from output. Oscillators
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationTopic D-type Flip-flops. Draw a timing diagram to illustrate the significance of edge
Topic 1.3.2 -type Flip-flops. Learning Objectives: At the end of this topic you will be able to; raw a timing diagram to illustrate the significance of edge triggering; raw a timing diagram to illustrate
More informationSequencing. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall,
Sequencing ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2013 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Introduction Sequencing
More informationMemory, Latches, & Registers
Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) How to save a few bucks at toll booths 5) Edge-triggered Registers L13 Memory 1 General Table Lookup Synthesis
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2009 opic Notes: Sequential Circuits Let s think about how life can be bad for a circuit. Edge Detection Consider this one: What is
More informationLogic Design ( Part 3) Sequential Logic (Chapter 3)
o Far: Combinational Logic Logic esign ( Part ) equential Logic (Chapter ) Based on slides McGraw-Hill Additional material 24/25/26 Lewis/Martin Additional material 28 oth Additional material 2 Taylor
More informationSlide Set 7. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 7 for ENEL 353 Fall 216 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 216 SN s ENEL 353 Fall 216 Slide Set 7 slide
More informationEE 447/547 VLSI Design. Lecture 9: Sequential Circuits. VLSI Design EE 447/547 Sequential circuits 1
EE 447/547 VLSI esign Lecture 9: Sequential Circuits Sequential circuits 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time Borrowing Two-Phase Clocking Sequential
More informationCPE/EE 427, CPE 527 VLSI Design I Sequential Circuits. Sequencing
CPE/EE 427, CPE 527 VLSI esign I Sequential Circuits epartment of Electrical and Computer Engineering University of Alabama in Huntsville Aleksandar Milenkovic ( www.ece.uah.edu/~milenka ) Combinational
More informationDigital System Design
Digital System Design by Dr. Lesley Shannon Email: lshannon@ensc.sfu.ca Course Website: http://www.ensc.sfu.ca/~lshannon/courses/ensc350 Simon Fraser University Slide Set: 8 Date: February 9, 2009 Timing
More informationDigital Circuits 4: Sequential Circuits
Digital Circuits 4: Sequential Circuits Created by Dave Astels Last updated on 2018-04-20 07:42:42 PM UTC Guide Contents Guide Contents Overview Sequential Circuits Onward Flip-Flops R-S Flip Flop Level
More informationDigital Integrated Circuits EECS 312
14 12 10 8 6 Fujitsu VP2000 IBM 3090S Pulsar 4 IBM 3090 IBM RY6 CDC Cyber 205 IBM 4381 IBM RY4 2 IBM 3081 Apache Fujitsu M380 IBM 370 Merced IBM 360 IBM 3033 Vacuum Pentium II(DSIP) 0 1950 1960 1970 1980
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationProject 6: Latches and flip-flops
Project 6: Latches and flip-flops Yuan Ze University epartment of Computer Engineering and Science Copyright by Rung-Bin Lin, 1999 All rights reserved ate out: 06/5/2003 ate due: 06/25/2003 Purpose: This
More informationLaboratory 1 - Introduction to Digital Electronics and Lab Equipment (Logic Analyzers, Digital Oscilloscope, and FPGA-based Labkit)
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6. - Introductory Digital Systems Laboratory (Spring 006) Laboratory - Introduction to Digital Electronics
More informationFigure 1 shows a simple implementation of a clock switch, using an AND-OR type multiplexer logic.
1. CLOCK MUXING: With more and more multi-frequency clocks being used in today's chips, especially in the communications field, it is often necessary to switch the source of a clock line while the chip
More informationFLIP-FLOPS AND RELATED DEVICES
C H A P T E R 5 FLIP-FLOPS AND RELATED DEVICES OUTLINE 5- NAND Gate Latch 5-2 NOR Gate Latch 5-3 Troubleshooting Case Study 5-4 Digital Pulses 5-5 Clock Signals and Clocked Flip-Flops 5-6 Clocked S-R Flip-Flop
More informationAsynchronous (Ripple) Counters
Circuits for counting events are frequently used in computers and other digital systems. Since a counter circuit must remember its past states, it has to possess memory. The chapter about flip-flops introduced
More informationPRE J. Figure 25.1a J-K flip-flop with Asynchronous Preset and Clear inputs
Asynchronous Preset and Clear Inputs The S-R, J-K and D inputs are known as synchronous inputs because the outputs change when appropriate input values are applied at the inputs and a clock signal is applied
More informationLecture 10: Sequential Circuits
Introduction to CMOS VLSI esign Lecture 10: Sequential Circuits avid Harris Harvey Mudd College Spring 2004 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time
More informationEE 121 June 4, 2002 Digital Design Laboratory Handout #34 CLK
EE 2 June 4, 22 igital esign Laboratory Handout #34 Midterm Examination #2 Solutions Open book, open notes. Time limit: 75 minutes. (2 points) Setup and hold times. The flip-flops below have setup time
More informationEECS150 - Digital Design Lecture 15 Finite State Machines. Announcements
EECS150 - Digital Design Lecture 15 Finite State Machines October 18, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://www-inst.eecs.berkeley.edu/~cs150
More informationDigital Integrated Circuits EECS 312. Review. Combinational vs. sequential logic. Sequential logic. Introduction to sequential elements
14 12 8 6 IBM ES9000 Bipolar Fujitsu VP2000 IBM 3090S Pulsar 4 IBM 3090 IBM RY6 CC Cyber 20 IBM 4381 IBM RY4 2 IBM 3081 Apache Fujitsu M380 IBM 370 Merced IBM 360 IBM 3033 Vacuum Pentium II(SIP) 0 190
More informationSynchronous Sequential Logic
Synchronous Sequential Logic -A Sequential Circuit consists of a combinational circuit to which storage elements are connected to form a feedback path. The storage elements are devices capable of storing
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 opic Notes: Sequential Circuits Let s think about how life can be bad for a circuit. Edge Detection Consider this one: What is
More informationEEC 118 Lecture #9: Sequential Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation
EEC 118 Lecture #9: Sequential Logic Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation Outline Review: Static CMOS Logic Finish Static CMOS transient analysis Sequential
More informationEECS 270 Group Homework 4 Due Friday. June half credit if turned in by June
EES 270 Group Homework 4 ue Friday. June 1st @9:45am, half credit if turned in by June 1st @4pm. Name: unique name: Name: unique name: Name: unique name: This is a group assignment; all of the work should
More informationEECS 270 Midterm Exam Spring 2011
EES 270 Midterm Exam Spring 2011 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Page # Points 2 /15 3 /10 4 /6 5 /12
More informationDEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING DIGITAL DESIGN
DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING DIGITAL DESIGN Assoc. Prof. Dr. Burak Kelleci Spring 2018 OUTLINE Synchronous Logic Circuits Latch Flip-Flop Timing Counters Shift Register Synchronous
More information(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement
Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 7 (07 Feb 2008) 1 Announcement 2 1 Combinational vs. Sequential Logic Combinational Logic Memoryless Outputs
More informationLogic Devices for Interfacing, The 8085 MPU Lecture 4
Logic Devices for Interfacing, The 8085 MPU Lecture 4 1 Logic Devices for Interfacing Tri-State devices Buffer Bidirectional Buffer Decoder Encoder D Flip Flop :Latch and Clocked 2 Tri-state Logic Outputs
More informationCSE140: Components and Design Techniques for Digital Systems. More D-Flip-Flops. Tajana Simunic Rosing. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and esign Techniques for igital Systems More -Flip-Flops Tajana Simunic Rosing Where we are now. What we covered last time: SRAM cell, SR latch, latch, -FF What we ll do next: -FF review,
More informationgive sequence to events have memory (short-term) use feedback from output to input to store information
Chapter 3 :: equential Logic esign Chapter 3 :: Topics igital esign and Computer Architecture avid Money Harris and arah L. Harris Introduction Latches and Flip-Flops ynchronous Logic esign Finite tate
More informationECE 25 Introduction to Digital Design. Chapter 5 Sequential Circuits ( ) Part 1 Storage Elements and Sequential Circuit Analysis
EE 25 Introduction to igital esign hapter 5 Sequential ircuits (5.1-5.4) Part 1 Storage Elements and Sequential ircuit Analysis Logic and omputer esign Fundamentals harles Kime & Thomas Kaminski 2008 Pearson
More informationDALHOUSIE UNIVERSITY Department of Electrical & Computer Engineering Digital Circuits - ECED 220. Experiment 4 - Latches and Flip-Flops
DLHOUSIE UNIVERSITY Department of Electrical & Computer Engineering Digital Circuits - ECED 0 Experiment - Latches and Flip-Flops Objectives:. To implement an RS latch memory element. To implement a JK
More informationSynchronizing Multiple ADC08xxxx Giga-Sample ADCs
Application Bulletin July 19, 2010 Synchronizing Multiple 0xxxx Giga-Sample s 1.0 Introduction The 0xxxx giga-sample family of analog-to-digital converters (s) make the highest performance data acquisition
More informationEMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP
EMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP 1 Chapter Overview Latches Gated Latches Edge-triggered flip-flops Master-slave flip-flops Flip-flop operating characteristics Flip-flop applications
More informationESE 570 STATIC SEQUENTIAL CMOS LOGIC CELLS. Kenneth R. Laker, University of Pennsylvania, updated 25Mar15
ESE 570 STATIC SEQUENTIAL CMOS LOGIC CELLS 1 Classes of Logic Circuits two stable op. pts. Latch level triggered. Flip-Flop edge triggered. one stable op. pt. One-shot single pulse output no stable op.
More informationEITF35: Introduction to Structured VLSI Design
EITF35: Introduction to Structured VLSI Design Part 4.2.1: Learn More Liang Liu liang.liu@eit.lth.se 1 Outline Crossing clock domain Reset, synchronous or asynchronous? 2 Why two DFFs? 3 Crossing clock
More information