Published Jul 24th, 2011, 7/24/11 9:18 am
- 2,049 views, 1 today
- 135 downloads, 0 today
3
BY THE GREATS: TOMYS AND BAZILSHEP
world's fastest adder. adds in 3.3 seconds. get it now.
How this works: its a ripple carry that propagates a carry through 4 adders in 1 tick. revolutionary. More details in schematic, get it now!
world's fastest adder. adds in 3.3 seconds. get it now.
How this works: its a ripple carry that propagates a carry through 4 adders in 1 tick. revolutionary. More details in schematic, get it now!
Progress | 100% complete |
Tags |
87745
2
Create an account or sign in to comment.
and just the fact you THINK that "technically not the world's fastest, but very nice. i assume you used carry select with block partitioning?" contains an ARGUMENT proves you're practically illiterate.
and you didn't answer my question, which is rude. and i'm not saying it sucks, "but very nice" was literally in my first comment. and i DID make a faster one, with some additional logic the calculation speed is brought to about 1sec for any length. which makes your system faster for about 40 bits, but for this length it is NOT the world's fastest. do i have to make an adder just to prove you wrong? that would be rather annoying, as i don't like copy/pasting stuff mindlessly. i like working on new concepts, stuff others haven't made before.
edit: for clarification, i meant one of yours.