Karnaugh map - Revision history

Rice at 21:48, 9 May 2024

2024-05-09T21:48:15Z

← Older revision		Revision as of 21:48, 9 May 2024
Line 1:		Line 1:
	The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to ''minimize the number of gates'' in a circuit. For this conversation, ''all gates are considered equal'' in value.		The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to ''minimize the number of gates'' in a circuit. For this conversation, ''all gates are considered equal'' in value.

	~~= Minterm =~~
	~~A '''minterm''' is a term that consists of all inputs, complemented or not.~~

	= Matrix =		= Matrix =
	Kmap minimize equations graphically. Each cell represent a minterm and its output. There cannot be more than one bit change from one column to the next.		Kmap minimize equations graphically. Each cell represent a [[minterm]] and its output. There cannot be more than one bit change from one column to the next.

	If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.		If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.

Rice: /* How it works */

2024-05-09T21:47:44Z

How it works

← Older revision		Revision as of 21:47, 9 May 2024
Line 16:		Line 16:
	Groupings can also include only 0's, using product of sums instead of sums of products.		Groupings can also include only 0's, using product of sums instead of sums of products.

	= How it works =		Ǐ= How it works =
	Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter for a particular term. A simplification is then found.		Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter for a particular term. A simplification is then found.
	[[Category:Computer Architecture]]		[[Category:Computer Architecture]][[Category:ECS154A Midterm]]

Rice at 15:43, 19 April 2024

2024-04-19T15:43:27Z

← Older revision		Revision as of 15:43, 19 April 2024
Line 1:		Line 1:
	The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to ~~reduce digital circuits~~.		The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to ''minimize the number of gates'' in a circuit. For this conversation, ''all gates are considered equal'' in value.

	= Minterm =		= Minterm =

Rice: /* Matrix */

2024-04-17T15:47:20Z

Matrix

← Older revision		Revision as of 15:47, 17 April 2024
Line 5:		Line 5:

	= Matrix =		= Matrix =
	Kmap minimize equations graphically. Each cell represent ~~an input~~. There cannot be more than one bit change from one column to the next.		Kmap minimize equations graphically. Each cell represent a minterm and its output. There cannot be more than one bit change from one column to the next.

	If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.		If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.

Rice: /* Simplify */

2024-04-17T15:45:13Z

Simplify

← Older revision		Revision as of 15:45, 17 April 2024
Line 13:		Line 13:

	Don't-cares can be included or excluded depending on whether it minimizes the equation.		Don't-cares can be included or excluded depending on whether it minimizes the equation.

			Groupings can also include only 0's, using product of sums instead of sums of products.

	= How it works =		= How it works =
	Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter for a particular term. A simplification is then found.		Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter for a particular term. A simplification is then found.
	[[Category:Computer Architecture]]		[[Category:Computer Architecture]]

Rice: /* Simplify */

2024-04-17T15:43:19Z

Simplify

← Older revision		Revision as of 15:43, 17 April 2024
Line 10:		Line 10:

	= Simplify =		= Simplify =
	Circle 1's in adjacent squares. Every grouping represents a term. A grouping has to be a power of 2 and be as large as possible.		Circle 1's in adjacent squares. Every grouping represents a term. A grouping has to be a power of 2 and be as large as possible. A grouping can wrap around edges.

	Don't-cares can be included or excluded depending on whether it minimizes the equation.		Don't-cares can be included or excluded depending on whether it minimizes the equation.

Rice: /* How it works */

2024-04-17T15:43:03Z

How it works

← Older revision		Revision as of 15:43, 17 April 2024
Line 15:		Line 15:

	= How it works =		= How it works =
	Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter. A simplification is then found.		Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter for a particular term. A simplification is then found.
	[[Category:Computer Architecture]]		[[Category:Computer Architecture]]

Rice at 15:40, 17 April 2024

2024-04-17T15:40:42Z

← Older revision		Revision as of 15:40, 17 April 2024
Line 8:		Line 8:

	If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.		If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.

			= Simplify =
			Circle 1's in adjacent squares. Every grouping represents a term. A grouping has to be a power of 2 and be as large as possible.

			Don't-cares can be included or excluded depending on whether it minimizes the equation.

			= How it works =
			Adjacent columns/rows have one bit difference. If two 1's are adjacent, it means that that particular one bit difference does not matter. A simplification is then found.
	[[Category:Computer Architecture]]		[[Category:Computer Architecture]]

Rice: Created page with "The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to reduce digital circuits. = Minterm = A '''minterm''' is a term that consists of all inputs, complemented or not. = Matrix = Kmap minimize equations graphically. Each cell represent an input. There cannot be more than one bit change from one column to the next. If there are more variables, multiple is placed for an axis. Note the restriction regarding b..."

2024-04-17T15:29:58Z

Created page with "The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to reduce digital circuits. = Minterm = A '''minterm''' is a term that consists of all inputs, complemented or not. = Matrix = Kmap minimize equations graphically. Each cell represent an input. There cannot be more than one bit change from one column to the next. If there are more variables, multiple is placed for an axis. Note the restriction regarding b..."

New page

The '''Karnaugh map (Kmap)''' is a matrix that represent output values of a boolean function. It is primarily used to reduce digital circuits.

= Minterm =
A '''minterm''' is a term that consists of all inputs, complemented or not.

= Matrix =
Kmap minimize equations graphically. Each cell represent an input. There cannot be more than one bit change from one column to the next.

If there are more variables, multiple is placed for an axis. Note the restriction regarding bit change means that conventional order of inputs is invalid.
[[Category:Computer Architecture]]