数字逻辑精品教学资料（华南理工大学）8-Combinational practices 1.pptVIP

Digtial Logic Combinational Arithmetic Circuits 1 Addition: Half Adder (HA). Full Adder (FA). Carry Ripple Adders. Carry Look-Ahead Adders. Subtraction: Half Subtractor. Full Subtractor. Borrow Ripple Subtractors. Subtraction using adders. Multiplication: Combinational Array Multipliers. Half Adder Adding two single-bit binary values, X, Y produces a sum S bit and a carry out C-out bit. This operation is called half addition and the circuit to realize it is called a half adder. X 0 0 1 1 Y 0 1 0 1 S 0 1 1 0 C-out 0 0 0 1 Half Adder Truth Table Inputs Outputs S(X,Y) = S (1,2) S = X’Y + XY’ S = X ? Y C-out(x, y, C-in) = S (3) C-out = XY X Y Sum S C-out Half Adder X Y S C-OUT Full Adder Adding two single-bit binary values, X, Y with a carry input bit C-in produces a sum bit S and a carry out C-out bit. X 0 0 0 0 1 1 1 1 Y 0 0 1 1 0 0 1 1 S 0 1 1 0 1 0 0 1 C-out 0 0 0 1 0 1 1 1 C-in 0 1 0 1 0 1 0 1 Full Adder Truth Table S(X,Y, C-in) = S (1,2,4,7) C-out(x, y, C-in) = S (3,5,6,7) Inputs Outputs Sum S C-in X 0 1 00 01 11 10 Y C-in XY 0 1 2 3 6 7 4 5 1 1 1 1 C-in X 0 1 00 01 11 10 Y C-in XY 0 1 2 3 6 7 4 5 1 1 1 1 Carry C-out S = X’Y’(C-in) + XY’(C-in)’ + XY’(C-in)’ + XY(C-in) S = X ? Y ? (C-in) C-out = XY + X(C-in) + Y(C-in) Full Adder Circuit Using AND-OR XY YC-in C-out XC-in X X Y C-in Y C-in Y Y’ Y X X’ X C-in C-in’ C-in X’Y’C-in XY’C-in’ Sum S X’YC-in’ XYC-in X’ X’ X X Y’ Y Y’ C-in Y C-in’ C-in’ C-in’ Full Adder X Y S C-in C-out Full Adder Circuit Using XOR Full Adder X Y S C-in C-out XY YC-in C-out XC-in X X Y C-in Y C-in Sum S X Y C-in n-bit Carry Ripple Adders（串行进位） An n-bit adder used to add two n-bit binary numbers can built by connecting in series n full adders. Each full adder represents a bit position j (from 0 to n-1). Each carry out C-out from a full adder at position j is connected to the carry in C-in of the full adder at the h