Progetto di un convertitore di segno
1) Truth Table
| In2 | In1 | In0 | Out2 | Out1 | Out0 | Neg |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
2) K-Maps:
Function: Out2 ————————————————– Function: Out1
Function: Neg ————————————————— Function: Out0
3) Boolean expression of outputs:
[example: W = Z and (!A or B)]
Out1 = (In1 and In2) or (!In0 and In1) or ( !In1 and !In2 and In0)
Out2 = In0 or In1 or In2
Out0 = In0 Neg = In2
4) Schematics
5) Timing diagram
