(b) A synchronous counter counts through 3-bit prime numbers downwards. Assume the counter starts with initial prime value set to 010 as its first 3-bit prime number. The undesired states will go with their next state to be don't cares. (i) Draw the state transition diagram of a state machine. (ii) Build the excitation table for the state machine. (iii) Find the simplest Boolean expression for the circuit using Karnaugh map. (iv) Implement the circuit diagram with implementation of JK flip flops and logic gates.

(b) A synchronous counter counts through 3-bit prime numbers downwards. Assume the counter starts with initial prime value set to 010 as its first 3-bit prime number. The undesired states will go with their next state to be don't cares. (i) Draw the state transition diagram of a state machine. (ii) Build the excitation table for the state machine. (iii) Find the simplest Boolean expression for the circuit using Karnaugh map. (iv) Implement the circuit diagram with implementation of JK flip flops and logic gates.

Electric Motor Control

10th Edition

ISBN:9781133702818

Author:Herman

Publisher:Herman

Chapter22: Sequence Control

Section: Chapter Questions

Problem 6SQ: Draw a symbol for a solid-state logic element AND.

See similar textbooks

Similar questions

What is an MSDS?
Draw the Moore and Mealy State Diagram of a Finite State Machine thatfunctions as a Binary Sequence Detector for the following sequence:a. 01011b. 101 and/or 010Obtain the State Table for each of your diagrams?
Scenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most positive number?
a) Kindly design a Master-slave J-K flip-flop using NAND gates only and state race-around condition, and how it can be eliminated in a Master-slave J-K flipflop? A multiplexer (MUX) also known as data selector, is a logic circuit which allows the digital information from multi-inputs to a single output line(b) Design a 8 to 1 multiplexer by using the four variable function given by F (A, B, C, D) = ∑m = (013489 15) (c) OUR school AIT has lockers in all the campus that she often rent them out to students who needs them, upon graduation they are taken back by the school authorities. Kindly express the process of opening this locker in terms of digital operation.
Consider two microprocessors having 8-bit and 16-bit wide external data buses, respectfully. The two processors are identical otherwise and their bus cycles are the same speed. Suppose all instructions and operands are two Bytes. By what factor do the maximum data transfer rates vary? Suppose all instructions and operands are one Byte. By what factor do the maximum data transfer rates vary? Discuss your answers.
Draw a truth table, Karnaugh diagram and logical gates circuit to show the functionof an even number detection circuit. That is, the output of the circuit will be one only ifthe value of the binary input is even. Assume three inputs.
Consider two binary numbers where the first is made of three bits whichcan be represented by X, Y, and Z, while the second is two bits and isrepresented by A and B. Design a logic circuit that multiplies X Y Z timesA B, using two half adders, one full adder in addition to AND gates.
Draw the block diagram for a common bus system for 16 registers of 32 bits each. The bus is constructed with multiplexers.
Question 5 a) Briefly explain the Nyquist theorem in the context of digital sampling. b) Using logic gates, design an active low chip select for the memory a 256 K memory device starting at address 38000016 in a 16 Megabyte memory space. c) Convert each of the following 8-bit signed magnitude binary numbers to decimal. i) 10110101(base 2) ii) 01000101(base 2) iii) 11101010(base 2) iv) 01011110(base 2)
You are asked to design a synchronous counter that will count the sequence 1 > 2>3>1. (a) Represent these decimal numbers in 2 bits binary numbers. (b) Write down the state table. (c) Find the functions for the next state of the state table using K-map. (d) Draw the circuit (You need to consider D flip-flops as memory unit).
c) Consider a 4 bit Johnson Counter whose initial value is set as per the sequence 1001. Now design the counter and also show all the states till it resets to its initial value
A circuit which takes a binary-coded decimal (BCD) number as input s to be designed such that the single output Q is true if the input is a prime number (remerber that 0 and 1 count as prime numbers). (a)Draw a truth table that specifies the above circuit (b)Using the truth table you have constructed and the Karnaugh map method find the minimised Boolean expression for the output Q. (c)Implement the digital circuit using the minimum number of 2-input logic AND, OR gates and inverters (NOT.