Four bit adder: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: simplified program, added/changed whitespace and comments, used a template for the output section.) |
m (enclosed the titles of the illustrations in parenthesis to help identify the different parts of the illustration.) |
||
Line 15: | Line 15: | ||
{| |
{| |
||
|+Schematics of the "constructive blocks" |
|+Schematics of the "constructive blocks" |
||
!Xor gate done with |
!(Xor gate done with ANDs, ORs and NOTs) |
||
!(A half adder) |
|||
!A half adder |
|||
!(A full adder) |
|||
!A full adder |
|||
!A 4-bit adder |
!(A 4-bit adder) |
||
|- |
|- |
||
|[[File:xor.png|frameless|Xor gate done with ands, ors and nots]] |
|[[File:xor.png|frameless|Xor gate done with ands, ors and nots]] |
||
Line 25: | Line 25: | ||
|[[File:4bitsadder.png|frameless|A 4-bit adder]] |
|[[File:4bitsadder.png|frameless|A 4-bit adder]] |
||
|} |
|} |
||
Solutions should try to be as descriptive as possible, making it as easy as possible to identify "connections" between higher-order "blocks". |
Solutions should try to be as descriptive as possible, making it as easy as possible to identify "connections" between higher-order "blocks". |
||
It is not mandatory to replicate the syntax of higher-order blocks in the atomic "gate" blocks, i.e. basic "gate" operations can be performed as usual bitwise operations, or they can be "wrapped" in a ''block'' in order to expose the same syntax of higher-order blocks, at implementers' choice. |
It is not mandatory to replicate the syntax of higher-order blocks in the atomic "gate" blocks, i.e. basic "gate" operations can be performed as usual bitwise operations, or they can be "wrapped" in a ''block'' in order to expose the same syntax of higher-order blocks, at implementers' choice. |
||