diff options
| -rw-r--r-- | phrase-circuit.src | 73 |
1 files changed, 52 insertions, 21 deletions
diff --git a/phrase-circuit.src b/phrase-circuit.src index 2a10c2d..6ccb8a5 100644 --- a/phrase-circuit.src +++ b/phrase-circuit.src @@ -1,4 +1,4 @@ -.W 60 +.W 40 .V 10 .CT Holden Rohrer .V 2 @@ -16,8 +16,8 @@ .LD 5| . |Berkeley's ABC .LD 6| . |Simplified Boolean Expressions .LD 7| . |Difficulties -.LD Appendix A: circ.ps| . |Logic Diagram -.LD Appendix B: schematic.{png,dxf}| . |LibreCAD Schematic +.LD circ.ps| . |Logic Diagram +.LD schematic.{png,dxf}| . |LibreCAD Schematic .FIL = .CT Problem Statement @@ -78,31 +78,31 @@ W X Y Z | VAL | A B C D E F G (1=OFF, 0=ON) .LS ___ __ _ _ _ _ __ A = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ -.ELS +.EG .LS __ _ _ _ __ __ _ _ _ __ ___ B = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ -.ELS +.EG .LS __ _ _ __ _ __ ___ C = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ -.ELS +.EG .LS ____ _ _ _ _ _ __ D = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ + WXYZ -.ELS +.EG .LS _ __ E = WXYZ -.ELS +.EG .LS _ _ _ F = WXYZ + WXYZ -.ELS +.EG .LS ___ __ _ _ _ _ __ G = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ -.ELS +.EG .FIL = .CT Karnaugh-like Depthy Mapping @@ -114,42 +114,73 @@ G = WXYZ + WXYZ + WXYZ + WXYZ + WXYZ !W X # # # # For reference, the "primitives" (dot=0): -W !W X !X +.NBSP ` +.LS +W````````` !W````````` X````````` !X````````` 1 1 1 1 . . . . 1 1 1 1 . . . . 1 1 1 1 . . . . . . . . 1 1 1 1 . . . . 1 1 1 1 . . . . 1 1 1 1 . . . . 1 1 1 1 1 1 1 1 . . . . +.EG -Y !Y Z !Z +.LS +Y````````` !Y````````` Z````````` !Z````````` 1 1 . . . . 1 1 1 . . 1 . 1 1 . 1 1 . . . . 1 1 1 . . 1 . 1 1 . 1 1 . . . . 1 1 1 . . 1 . 1 1 . 1 1 . . . . 1 1 1 . . 1 . 1 1 . +.EG And the objectives: -A B C D +.LS +A````````` B````````` C````````` D````````` . . . 1 1 1 1 1 1 . 1 . . 1 . 1 1 . . 1 1 . 1 1 1 . 1 1 . 1 . 1 1 . . 1 1 . . . 1 . . . . . 1 . . . . 1 . 1 1 . . 1 . . 1 . . . +.EG -E F G +.LS +E````````` F````````` G````````` . . . . . 1 . . . 1 . . . . . . . . . . . . . 1 . . . . . . . . . 1 . 1 . . 1 . . . . 1 . 1 . . +.EG +.NBSP The objectives were grouped into 1s, 2s, and 4s, to create the following simple boolean expressions (which are irrelevant to the final solution, but still required). .FIL = .CT Simplified Boolean Expressions +.LS + _ _ +A = YZ + XZ +.EG +.LS + _ _ +B = WY + WX + WZ + XYZ +.EG +.LS + _ __ __ _ _ +C = WYZ + XYZ + WXY + WYZ + WXYZ +.EG +.LS + _ _ ____ _ +D = WYZ + WYZ + WXYZ + WXYZ +.EG +.LS + _ __ +E = WXYZ +.EG +.LS + _ _ _ +F = WXYZ + WXYZ +.EG +.LS + __ _ _ _ +G = XYZ + WYZ + XYZ +.EG -A = !YZ + !XZ -B = W!Y + WX + WZ + !XYZ -C = WYZ + !XYZ + W!X!Y + W!Y!Z + !WXY!Z -D = WY!Z + W!YZ + !W!X!Y!Z + !WXYZ -E = !WX!Y!Z -F = WXY!Z + !WX!YZ -G = !X!YZ + !WY!Z + XY!Z .FIL = .CT Berkeley's ABC! I used Berkeley's ABC: github.com/berkeley-abc/abc. |