2. We want to design a counter that counts both up and down between the numbers 1 and 5. But this counter will be a saturating counter, i.e., if it’s at 1 and is told to count down, it will stay at 1. If it’s at 5 and it’s told to count up, it will stay at 5. There will be two control signals: U (for up) and D (for down). If neither is asserted, then the count value stays where it is. If both are asserted, they cancel each other out and the count value stays where it is. Capture this behavior in the form of a state diagram.
2. We want to design a counter that counts both up and down between the numbers...
2. We want to design a counter that counts both up and down between the numbers 1 and 5. But this counter will be a saturating counter, i.e., if it's at 1 and is told to count down, it will stay at 1. If it's at 5 and it's told to count up, it will stay at 5. There will be two control signals: U (for up) and D (for down). If neither is asserted, then the count value stays...
Up-Down counter with enable using JK flip-flops: Design, construct and test a 2-bit counter that counts up or down. An enable input E determines whether the counter is on or off. If E = 0, the counter is disabled and remains in the present count even though clock pulses are applied to the flip-flops. If E= 1, the counter in enabled and a second input, x, determines the count direction. If x= 1, the circuit counts up with the sequence...
2. Synchronous Counters: a. Design a count up/count down counter that counts from 0 up to 4, then 4 down to 0 using D flip flop. b. Design a count up counter that counts from 0 up to 12 using JK flip flops.
Design (and then verify your design by simulating it) a two-bit counter that counts up or down. Use an enable input E to determine whether the counter is on or off: if E = 0 the counter is disabled and remains at its present count even if clock pulses are applied. If E = 1, the counter is enabled and a second input, x, determines the direction of the count: if x = 1 the circuit counts upward 00, 01,...
Please show process and I will rate faster!!! 2. Design a two-bit up/down binary counter using T-fip-flops that can count in binary from 0 to 3. When the control input x is 0, the circuit counts up and when it is 1, the circuit counts down. (a) Obtain the state table of the two-bit counter (P. S., Input, N. S., Output). (b) Obtain the state diagram. (c) Draw the logic diagram of the circuit.
1. Suppose you want to design a 2-bit binary up-counter. Construct the state table using A1 and AO as the previous state of bits and A1+, A0+ as the next bit states, ie, to count from 00 to 01, A1 stays at 0, but AO changes from 0 to 1. Let the counter wrap-around, such that 11 -> 00. Draw the state diagram. 2. Next, add in a third input, En, for enable. The counter can only count up when...
Design a two-bit up/down binary counter using D flip-flops that can count in binary from 0 to 7. When the control input x is 0, the circuit counts down, and when it is 1, the circuit counts up. (a) Obtain the state table of the two-bit counter. (b) Obtain the state diagram (c) Draw the logic diagram of the circuit.
Use a behavioral Verilog model to design a 3-bit fault tolerant up-down counter. For each flip-flop (FF) include asynchronous reset and preset signals. Refer to Example 4.3 on page 160 for an example of a single FF with both reset and preset signals as well as with an enable signal. For this project, you don't need to use FFs with enables. You don't also need not-q (nq) in this assignment. Use active-high signals for reset and present signals. The example...
Problem 4 [40 Points]: Finite State Machines Show the FSM diagram of a 3-bit up/down counter that counts through the sequence 0, 1, 2, 3, 4, 5, 6, 7, 0, 1,2, The counter has two input signals a co up and a count down. Thus, the counter can with a change of input count 5, 4, 3,
2. To demonstrate a Mealy state machine, let's design a simple arbiter between two requesting entities. We're going to have two request inputs: reqA and reqB. And two outputs: grantA and grantB. Any combination of requests can be asserted at any time: one of them, both of them, or neither. But at most only one grant can be asserted in any given cycle; if neither request is asserted then neither grant should be asserted. We'll need a state machine to...