Википедија:Песак — разлика између измена
Садржај обрисан Садржај додат
Ред 71:
}}</ref>
===Carry-lookahead сабирач (CLA)===
[[File:4-bit carry lookahead adder.svg|thumb|right|4-bit adder with carry lookahead]]
Да би смањили време израчунавања, инжењери су осмислили бржи начин сабирања два бинарна броја познатији као '''carry-lookahead''' сабирач.
Неке друге архитектуре
Some other multi-bit adder architectures break the adder into blocks. It is possible to vary the length of these blocks based on the [[propagation delay]] of the circuits to optimize computation time. These block based adders include the [[carry-skip adder|carry-skip (or carry-bypass) adder]] which will determine ''P'' and ''G'' values for each block rather than each bit, and the [[carry select adder]] which pre-generates the sum and carry values for either possible carry input (0 or 1) to the block, using multiplexers to select the appropriate result ''when'' the carry bit is known.
|