Special Cases of Carry Propagation
The average time necessary to add numbers by local parallel computation is directly related to the length of the longest carry propagation chain in the sum. The mean length of longest carry propagation chain when adding two independent uniform random n bit numbers is a well studied topic, and useful...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2007
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/197 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1200&context=hmc_theses |