Elementary operations performed on numeric data stored in registers - the foundation of digital computer arithmetic
These are the fundamental building blocks for more complex arithmetic functions like multiplication and division:
| Symbolic Designation | Description |
|---|---|
| R3 ā R1 + R2 | Contents of R1 plus R2 transferred to R3 |
| R3 ā R1 - R2 | Contents of R1 minus R2 transferred to R3 |
| R2 ā R2' | Complement the contents of R2 (1's complement) |
| R2 ā R2' + 1 | 2's complement of R2 (negate) |
| R3 ā R1 + R2' + 1 | Add contents of R1 and 2's complement of R2 (Subtraction) |
| R1 ā R1 + 1 | Increment the contents of R1 by one |
| R1 ā R1 - 1 | Decrement the contents of R1 by one |
Constructed by connecting n full-adders in cascade. The carry output of each stage becomes the carry input of the next stage, enabling multi-bit addition operations.
Uses XOR gates and 2's complement method. Control input M determines operation: M=0 for addition (A+B), M=1 for subtraction (A-B) using 2's complement.
Adds one to a register using half-adders in cascade. The least significant bit receives '1' as input carry, propagating through subsequent stages.
Composite circuit with parallel adders and multiplexers. Selection inputs (S1, S0) and carry input (Cin) determine the specific arithmetic operation performed.
Complete operation table showing how selection inputs and carry determine the output:
| Select (S1 S0) | Cin | Input Y | Output D = A + Y + Cin | Microoperation |
|---|---|---|---|---|
| 00 | 0 | B | D = A + B | Add |
| 00 | 1 | B | D = A + B + 1 | Add with carry |
| 01 | 0 | B' | D = A + B' | Subtract with borrow |
| 01 | 1 | B' | D = A + B' + 1 | Subtract (A - B) |
| 10 | 0 | 0 | D = A | Transfer A |
| 10 | 1 | 0 | D = A + 1 | Increment A |
| 11 | 0 | 1 | D = A - 1 | Decrement A |
| 11 | 1 | 1 | D = A | Transfer A |
Experience how a composite arithmetic circuit performs various operations using multiplexers and full-adders!