
Design a 8x4 ROM with the following contents. Address 000 001 010 011 100 101 110...
Given a language ? = {000, 001, 010, 011, 100, 101, 110}. Prove that this language is regular.
Design a synchronous counter that has the following sequence: 000, 010, 101, 110 and repeat. The undesired states 001, 011, 100 and 111 must always go to 000 on the next clock pulse.
Q3) (10 points] Tabulate the truth table of an 8x4 ROM that implements the following functions: F. (A,B,C) = A'B + AC F1 (A,B,C) = A'B'C' +C F2 (A,B,C) = A'B' + AB F3 (A,B,C) = AB + AC + BC F1 F2 F3 Address Fo ABC 000 001 010 011 100 101 110 111
XYZ f(x,y,z) 111 110 101 100 011 010 001 000 Based on this truth table. What is the sum of products form? How to use a K-map to figure out the minimal form for this boolean function. What is the circuit digram for the minimized form?
(2+2+1 5 points) Problem 10.1: simple cpu machine code = The following program has been written for the simple central processing unit introduced in class. The table below shows the initial content of the 16 memory cells. The first column denotes the memory address. Machine Code Assembly Code Description 001 1 0001 0 010 0 1111 1 001 1 0000 3 101 1 0100 110 1 0110 4 111 1 0000 5 6 001 0 001 1 100 1 0001...
-Design a synchronous counter using D FFs that has the following sequence: 000, 010, CBA 101, 110, and repeat. The undesired (unused) states must always go to 000 on the next clock pulse. СВА 001 0,1,2 3,4,5 6,7,8,9 100 111
The first eight elements of binary and Gray code are given below: Binary | Gray 000 | 000 001 | 001 010 | 011 011 | 010 100 | 110 101 | 111 110 | 101 111 | 100 Design a circuit that converts from binary to Gray code.
Verilog! NOT VHDL Please
(4 pts) Write a behavioral Verilog module to implement a counter that counts in the following sequence: 000, 010, 100, 110, 001, 011, 101, 111, (repeat) 000, etc. Use a ROM and D flip-flops. Create a test bench for your counter design and run functional simulation in ModelSim.
(4 pts) Write a behavioral Verilog module to implement a counter that counts in the following sequence: 000, 010, 100, 110, 001, 011, 101, 111, (repeat) 000, etc....
Please solve
the problems from Ch1 Q11and Ch2 2b,3,8,12,14a
Digital
system
11. Decode the following ASCII messages. (100 1001)2 (010 0000)2 (110 11002 I (110 1111)2 (111 0110)2 (110 0101)2 (a) (010 0000)2 (100 0101)2 (100 0011)2 (100 0101)2 (011 0010)2 (011 0001)2 (011 0101)2 Show transcribed image text 2. Prove the following properties. (a) Prove the distributive property of the AND () operation over the OR (+). (b) Prove that x +n/-: + y. (c) Prove the absorption law...
Design a counter that counts in the sequence assigned to you. 000, 011, 101, 111, 010, 110, (repeat) 000, ... Use D flip-flops, NAND gates, and inverters. Draw your circuit explicitly showing all connections to gate and flip-flop inputs. Explicitly means that you should draw in all wires, don’t just label the inputs and outputs. Show switches connected to the Preset and Clear inputs of the flip-flops. Use one switch for all clears and a separate switch for each preset....