Fichas
03 Handout 1
Fichas del conjunto (10)
- 1Karnaugh Mapalso known as the Veitch diagram or the K-map, was first proposed by Edward Veitch and modified by Maurice Karnaugh (a telecommunications engineer at Bell Labs) while designing digital logic-based telephone switching circuits in 1953.
- 2Karnaugh MapIt is an arrangement of boxes or squares called cells, where each cell corresponds to one line of a truth table (shown below)
- 3Karnaugh Mapit represents a different combination of the variables (either in minterm or maxterm) of a Boolean function.
- 4Gray codethe ordering where the Karnaugh map's input values are ordered as 00, 01, 11, and 10 such that one bit changes from one cell to the next.
- 5Two-Variable Mapfor this case, we form a map consisting of 22 = 4 (2-by-2 matrix), as shown below, where B is along the top, and A is down the left-hand side
- 6n is the total number of possible input variable combinationswhat n represents?
- 7Three-Variable MapIn this case, we form a map consisting of 23 = 8 cells (2-by-4 or 4-by-2 matrix
- 8Four-Variable MapIn this, we form a map consisting of 24 = 16 cells (4-by-4 matrix), as shown below.
- 9don’t careSometimes, a situation arises in which some input variable combinations are not allowed. These are the unallowed states treated in conditions.
- 10don’t careA condition (which is often represented with an “X” in a K-map) can either be 0 or 1. where It does not affect the result of the expression, since it is assumed that the combinations of the inputs leading to this condition will never occur.
Información
- Descripción
- hard Logic Circuits and Design Fichas sobre 03 Handout 1, creado por Eljin Aguilar el 25/09/2024.
- Creado por
- Eljin Aguilar
- Visitas
- 0
- Valoración