Turing Complete

Turing Complete

1
   
Award
Favorite
Favorited
Unfavorite
Caption
"Fast Adder with Delay of 26"
7 Comments
It's a me Mario :D 7 Apr, 2024 @ 2:45pm 
Keep on learning. I really admire and respect this trait of yours :)
It's a me Mario :D 7 Apr, 2024 @ 2:45pm 
Kinda swarmed with projects but definitely will check it out,eventually, thanks brother!
xcoder  [author] 25 Mar, 2024 @ 4:33pm 
Thanks for the offer, but it sounds like too much trouble. As you say, I can probably find something with a Google search. I'll start with the wiki I found before and see what it offers on the subject.

BTW check out a note I posted on the MHRD discussion.

https://gtm.steamproxy.vip/app/576030/discussions/0/4289188948007537743/

You might be interested.
It's a me Mario :D 25 Mar, 2024 @ 12:21pm 
We did about the "fast addition" in our course called Parallel Algorithms.
It's chapter 2 of the book Leighton, F. Thomson. Introduction to Parallel Algorithms and Architectures. I can screenshot and send you some material via steam messages for starters since I wouldn't try and find or buy the book for that alone.

I happen to major in hardware but I don't remember anything specific about, but I guess with few clicks or looking it up on youtube you most definitely will find material about cla adders.
xcoder  [author] 24 Mar, 2024 @ 6:25pm 
Mario, yes! I want to learn more about the logic of the Fast Adder.
It's a me Mario :D 15 Mar, 2024 @ 3:40pm 
Funny enough we did about it in class yesterday.

Basically there's hardware in row-cells doing the addition in parallel and calculating(basically predicting) whether you have a carry or not with 3 flags: G - S P (generate, stop, produce i think) and then there's an algorithm doing the calculation using binary trees. If you still wanna know about it I can refer you to some material :)
xcoder  [author] 2 Apr, 2023 @ 7:10pm 
I had help with this. After trying several solutions without success, I finally did a google search for "fast adder" and found a wiki page about a "Carry-lookahead adder" (CLA). It is used in electronics to improve the speed you get with a more straightforward "ripple-carry-adder" (RCA). It achieves the speed by allowing calculations to be carried out in parallel whereas the RCA component has to calculate each bit of the byte in succession.

I'm not sure how the lookahead works. That level of math is a bit beyond me. But it does work.

This is the wiki address: https://en.wikipedia.org/wiki/Carry-lookahead_adder