Adder (BCT): Difference between revisions
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
== Ripple Carry Adder == | == Ripple Carry Adder == | ||
The ripple carry adder is the simplest of adders but it's also the slowest. The results ripple through all the [[Full Adder (BCT)|Full Adders]] one after another. The output delay is the total of all Full Adders.[[File:Ripple-Adder-BCT.png|none|thumb|848x848px|BCT Ripple Carry Adder]] | The ripple carry adder is the simplest of adders but it's also the slowest. The results ripple through all the [[Full Adder (BCT)|Full Adders]] one after another. The output delay is the total of all Full Adders. The current design takes 56 delays.[[File:Ripple-Adder-BCT.png|none|thumb|848x848px|BCT Ripple Carry Adder]] | ||
== Carry Lookahead Adder == | |||
I already have a design for a fast balanced ternary lookahead increment/decrementer. It's can add or subtract one from a Tryte in single digit delay. | |||
However, I have not figured out a working carry lookahead adder. A balanced ternary design might actually not be practical or possible. | |||
== Carry Select Adder == | |||
Another fast adder design is the carry select adder. This design uses MUXs to select the correct answer from sections that pre-calculate possible carry answers in parallel. The delays | |||
Revision as of 10:59, 30 July 2025
Adder can add (or subtract) two numbers together. Negating the B input will result in a subtraction.
Ripple Carry Adder
The ripple carry adder is the simplest of adders but it's also the slowest. The results ripple through all the Full Adders one after another. The output delay is the total of all Full Adders. The current design takes 56 delays.
Carry Lookahead Adder
I already have a design for a fast balanced ternary lookahead increment/decrementer. It's can add or subtract one from a Tryte in single digit delay.
However, I have not figured out a working carry lookahead adder. A balanced ternary design might actually not be practical or possible.
Carry Select Adder
Another fast adder design is the carry select adder. This design uses MUXs to select the correct answer from sections that pre-calculate possible carry answers in parallel. The delays
