12.1(d) - Carry Look Ahead (CLA) Adders

[@MasterFragger101]

Man, this professor is great. So peppy and explains it pretty well while keeping it entertaining.

[@abdelrahmanyasser5720]

you can't imagine how thankful am i right now thanks so much sir .

[@juanandresnunez9865]

Jesus this is the best video in youtube period

[@Charge11]

What an absolutely fantastic video. The library of Congress needs to preserve this video

[@minagawargious]

Holy crap this makes so much more sense now. Thank you.

[@christopherburke7038]

fantastic description of something everyone else makes extremely complicated, many thanks!

[@gpsaranya8578]

🙏

[@mat_wal]

I love this video. I'm not a circuit designer but wanted a basic understanding of how non-cascading adders work, and that's exactly what I got. Thank you!

[@crimsonred2085]

ZERO DISLIKE - THATS THE LEVEL OF TEACHING

[@GamesCourier]

Really really thank you for this great and in-depth video. I didnt understand it in my lecture that was held in German, but here it seemed way clearer. I also love your energy, that you bring to the lesson. Thank you again Sir, you are a great teacher!

[@mostafa2199]

His enthusiasm and energy

[@solacekairos]

This is great! I just found this channel and I love it.

[@srujanjoshi3780]

Finally makes sense, thank you so much!

[@gauravchaudhari3843]

beauifuly explained sir thank you I learned 2 or 4 times before finally understood here

[@hamzaelhawary6808]

Amazing, simple and very straight forward

[@DinHamburg]

Anybody else noticing, that the p and g expressions at 5:30 are the same as min/max in the comparator elements in a sorting network?

[@_jmeg_3436]

Which textbook are you using? Thank you for this video, by the way!!

[@51Chen]

Really really thank you save my digital logic, thank you!!

[@kennethchan2803]

Thank you so much for making this video!

[@seb0216]

THANK YOU

[@xDontStarve]

Very nice video, thank you professor

[@amitnehra1457]

Man.... you are so cool.....😎🤌🤌

[@NhiNguyen-yo2pm]

Thank you so so much. You are the best

[@tombouie]

Thk you oh so much. I'm interested in adding a pair of irrational numbers exactly. A pair of irrational numbers can not be traditionally added from their right-to-leftward placeholder digits because there are infinite placeholder digits to the right of the decimal point of each irrational number. But they might be added from left-to-rightward placeholder digits. However still there's the problem of a cumulative ripple carry-over add delay. As you pointed-out, the carry-over from one placeholder to another is a function of the pair of irrational numbers (aka carry-look-ahead). Thus carry-look-ahead addition would avoid that cumulative ripple leftward carry-over delay. Although carry-look-ahead addition would still take an infinite time to add a pair of irrational numbers, it would be infinitely better than an carry-over adder. I’m an optimistic person & would like to consider this progress towards my goal :)

[@riyadhhossain8733]

can you please upload a video for Carry look ahead Subtractor?

[@nitinbhattacharyya8784]

Put the initial Cin as 1 ,then put B through not gate as the input for CLA

[@nancyma1332]

can you just make videos for an entire CSO class pls.

[@anhd1507]

this lecture is great, but whatever

[@gpsaranya8578]

😇🙌

[@tekunalogy]

You sound like a mixture of Chris Evans and RDJ.

[@gpsaranya8578]

Parabolic past arch

[@gpsaranya8578]

I. P distinguisher from alp varia

[@gpsaranya8578]

ChifFEeeeeeee

[@gpsaranya8578]

Tooth precC

[@gpsaranya8578]

#

[@gpsaranya8578]

Ohawh

[@gpsaranya8578]

Kraked@C

[@gpsaranya8578]

Logf

[@gpsaranya8578]

NOT SUMOR

[@gpsaranya8578]

Odds evend

[@gpsaranya8578]

Carrd

[@gpsaranya8578]

Hyper