How Do You Fill in a K-Map from a Table with Missing States?

  • Thread starter stosw
  • Start date
  • Tags
    Table
In summary, the conversation discusses filling in a k-map with missing states and using don't cares for the next states. The individual mentions having difficulty filling in the k-map from a given table and asks for hints. Another person responds that there are actually 8 squares in the k-map and suggests using don't cares for the missing states.
  • #1
stosw
21
0

Homework Statement



I don't know how to fill in the following k-maps
[PLAIN]http://img502.imageshack.us/img502/7339/dsc00767mn.jpg

Homework Equations





The Attempt at a Solution



The onyl way I know how to fill in a k-map from a table like that is to go down the present state and the next state and fill in the boxes. But on this one there are 5 of each and only 4 spots on the k-map. Any hints would be great.
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
You have three missing states for which there is no next state specified. That gives 8 states for 3 ff's, and I see 8 squares in the map, not 4. Put the three missing states in and use don't cares for the next states for them.
 

FAQ: How Do You Fill in a K-Map from a Table with Missing States?

What is a K-Map and how is it used?

A K-Map, or Karnaugh Map, is a graphical representation of a truth table used for simplifying Boolean expressions in digital logic. It is used to identify patterns and groupings in the truth table, which can then be used to simplify the expression.

What is the purpose of filling in a K-Map from a truth table?

The purpose of filling in a K-Map from a truth table is to simplify the Boolean expression, making it easier to understand and implement in digital logic circuits. By identifying patterns and groupings in the truth table, we can reduce the number of terms in the expression, resulting in a more efficient circuit design.

How do you fill in a K-Map from a truth table?

To fill in a K-Map from a truth table, you first need to identify the variables and their corresponding values in the truth table. Then, you can plot these values on the K-Map, grouping them according to their corresponding binary values. The resulting groups can then be used to simplify the Boolean expression.

What are the rules for filling in a K-Map?

There are a few rules to follow when filling in a K-Map:

  • Each cell in the K-Map should have only one variable changing between adjacent cells.
  • All cells in the K-Map should be filled in with a 1 or a 0.
  • The groups formed in the K-Map should have a size of 1, 2, 4, 8, etc. (powers of 2).
  • All groups in the K-Map should be as large as possible.

What are the benefits of using a K-Map to simplify Boolean expressions?

Using a K-Map to simplify Boolean expressions has several benefits. It allows for a more visual and intuitive approach to simplification, making it easier to understand and implement. It also helps to minimize the number of terms in the expression, resulting in a more efficient digital logic circuit design. Additionally, using a K-Map can help identify errors and inconsistencies in the truth table or expression.

Similar threads

Question about finding min. sum of product using K-maps?
Replies
1
Views
2K
Need help with a mod-6 counter using JK flip flops w/ control bit
Replies
1
Views
2K
Probability Question -- Choosing red and white coins from two tables
Replies
1
Views
1K
Creating a Bit Detector with Mealy Machine: State Diagrams & Tables
Replies
1
Views
3K
Designing a 4-bit non-sequential synchronous counter
Replies
25
Views
11K
K-map for a 4-bit synchronous decade counter.
Replies
4
Views
10K
ROM Troubleshooting and K-Maps: 16x4 ROM Truth Table Homework Problem
Replies
2
Views
4K
Designing an XOR Gate from NOR Gates: Truth Tables and Boolean Algebra
Replies
4
Views
5K
How Do You Identify XOR in Karnaugh Maps?
Replies
3
Views
31K
How to Set Up a Karnaugh Map with Three Inputs and Binary Outputs?
Replies
2
Views
6K

Hot Threads

Recent Insights

Back
Top