arc/notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2025-02-03 11:09:09

Browse Source
This commit is contained in:
arc
2025-02-03 11:09:09 -07:00
parent 8d046bb2a6
commit ba1c7d92b6
2 changed files with 30 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
education/computer engineering/ECE2700/Adders.md
View File

@ -1,6 +1,6 @@
# Half Adder
#
# Full Adder
# Ripple Carry Adder
@ -10,4 +10,6 @@ A carry select adder is built using two ripple carry adders, and multiplexing th
The delay is calculated like so:
1. Given the delay of a full adder is $k$, and the delay of a 2 to 1 mux is $\frac{1}{m}k$,
2. then the delay of a 4 bit ripple carry adder is $4k$, because it's 4 full adders chained together, running sequentially.
3. This means that the delay of a 4 bit carry select adder is $4k + \frac{k}{m}$
3. This means that the delay of a 4 bit carry select adder is $4k + \frac{k}{m}$
# Carry-lookahead adder