Jump to navigation
Jump to search
(cleanup) |
m (fix) |
||
| Line 4: | Line 4: | ||
Implement an array of [[../Full Adder/]] circuits. Make sure you use the second half-adder of the full adder for the carry to get decently good performance. | Implement an array of [[../Full Adder/]] circuits. Make sure you use the second half-adder of the full adder for the carry to get decently good performance. | ||
==Delay optimal | ==Delay optimal== | ||
Implement a "carry lookahead adder". | Implement a "carry lookahead adder". | ||
{{Footer Nav|game=Turing Complete|prevpage=Full Adder|nextpage=Negative Numbers}} | {{Footer Nav|game=Turing Complete|prevpage=Full Adder|nextpage=Negative Numbers}} | ||
Latest revision as of 22:27, 20 April 2024
Gate optimal[edit]
Implement an array of Full Adder circuits. Make sure you use the second half-adder of the full adder for the carry to get decently good performance.
Delay optimal[edit]
Implement a "carry lookahead adder".