At the n-th step, it calculates the sum and carry at the most significant bit position (i.e., i = n – 1). It starts at the least significant bit position (i.e., i = 0) and each successive next step it sequentially moves to the next more significant bit position where it calculates the sum and carry. The serial adder, at each step, calculates the sum and carry at one bit position. A serial adder operates similarly to manual addition.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |