Manchester Carry Chain
The Manchester carry chain is a variation of the carry-lookahead adder that uses shared logic to lower the transistor count. As can be seen above in the implementation section, the logic for generating each carry contains all of the logic used to generate the previous carries. A Manchester carry chain generates the intermediate carries by tapping off nodes in the gate that calculates the most significant carry value. Not all logic families have these internal nodes, however, CMOS being a major example. Dynamic logic can support shared logic, as can transmission gate logic. One of the major downsides of the Manchester carry chain is that the capacitive load of all of these outputs, together with the resistance of the transistors causes the propagation delay to increase much more quickly than a regular carry lookahead. A Manchester-carry-chain section generally won't exceed 4 bits.
Read more about this topic: Carry-lookahead Adder
Famous quotes containing the words manchester, carry and/or chain:
“The [nineteenth-century] young men who were Puritans in politics were anti-Puritans in literature. They were willing to die for the independence of Poland or the Manchester Fenians; and they relaxed their tension by voluptuous reading in Swinburne.”
—Rebecca West (1892–1983)
“Ends in themselves, my letters plot no change;
They carry nothing dutiable; they won’t
Aspire, astound, establish or estrange.”
—Philip Larkin (1922–1986)
“By this unprincipled facility of changing the state as often, and as much, and in as many ways as there are floating fancies or fashions, the whole chain and continuity of the commonwealth would be broken. No one generation could link with the other. Men would become little better than the flies of a summer.”
—Edmund Burke (1729–1797)