An UP-DOWN binary counter with input A is required. If A=0 the counter counts up, and if
Question:
An UP-DOWN binary counter with input A is required. If A=0 the counter counts up, and if A=1 it counts down. Design an implementation for 3 bits using T-type flipflops. [20 marks] 2 Describe the main components that make up a computer. [4 marks] Illustrate different ways of connecting these components together to span a range of performance requirements. [10 marks] For each of the performance categories that you identify state today's typical memory size, bus width and CPU speed. [6 marks] 3 Self-timed logic circuits may enable an existing technology to achieve higher performance. Explain the principle of self-timed circuits. [8 marks] Comment on the possible opportunities for improved performance. [6 marks] Is it likely that large logic systems will become easier to design using self-timed logic rather than more traditional arrangements? Explain.
Outline the design of a sequential divider which can divide 16-bit unsigned integers by 8-bit unsigned integers Probability In order to test the integrity of a network of ducting, engineers have developed an inspection device which can be introduced at a node and which then finds its way along a length of ducting to an adjacent node. In a particular case, eight nodes are sited at the vertices (corners) of a cube and 12 lengths of ducting are arranged along the edges of the cube. The inspection device is introduced at one node and equiprobably chooses one of the three lengths of ducting leading from that node for its first move. On arrival at the adjacent node the device equiprobably chooses one of the three lengths of ducting leading from that node (including the length it has just inspected). It continues in this fashion until the engineers stop its operation. Let An be the probability of the inspection device returning to the starting node after n moves, and deem A0 = 1. Let Dn be the probability of the inspection device visiting the node diagonally opposite the starting node after n moves. Clearly, D0 = 0. (a) Demonstrate that An = 0 for all odd n and that Dn = 0 for all even n. [4 marks] (b) Determine A2, A4 and A6 expressing all value
}}
Digital Systems Design Using Verilog
ISBN: 978-1285051079
1st edition
Authors: Charles Roth, Lizy K. John, Byeong Kil Lee