Shields Terrace

awesome explanation❤

thanks

Thank you!

He is a very good teacher 🎉😊

How to get the code for counter both design and testbench ??

8:54 AND 11:48 WHEN U DO SIGN EXTENSION U WROTE 1 FOR 5X-7 AND O'S FOR -5 X -7 CANT UNDRTAND CAN U EXPLAIN ME

Hi I'm bit confused regarding pointer based synchronization scheme and Handshaking based Synchronization scheme, Can you please help me understand these things easily?

Hey karthik, the example you have shown for glitch possibility is incorrect, during synchronization there is no guaranty to maintain same pulse width from source to dst domain, ofcource because of difference in time period. Glitch is possible due to different propagation delays to 'and' gate and signal K,L are supposed to change at same time but L changes bit late, causing glitch. This would have been taken care in synthesis timing but we set false path b/w src and dst domains, so this path would not be analyzed. Cheers. I know you in person and I like your content.

Explanation is great but English is Dangerous, simple makes more attraction then rubbbich.

Why the accent

не понял, где такую конструкцию можно применить

Acha h pr muh se paan thuk kr video banaya kro

❤❤

Do we use gray code encoding in synchronous FIFO? or only in Async FIFO? if possible please make a video on Sync FIFO Design.

I stopped the video at 0:25 and spent a bit over 5 minutes (shoulda been faster) and came up with: Zero Gate Solution: BCD input bits: in3, in2, in1, in0 BCD output bits most sig nibble, least sig nibble: msn_2, msn1, msn0, lsn3, lsn2, lsn1, lsn0 Solution: msn2 = in3, msn1 = in2, msn0 = in1 lsn3, lsn1 = 0. lsn2, lsn0 = in0 To change the multiplier that gets applied to the multiplicand, a soldering iron and possibly some gates will be needed.

THANK U I FORGOT HOW TO DO THAT PART AT 1:30 VERY NICE

Thankyou sir Can we use or gate instead of mux 2x1

what if in the example explained.. instead of negative level Latch, there was a positive level Latch? Is this design possible or it is not practical?

How can we say that 2 stage synchronization is enough for avoid metastability,is their any relationship between number of stages and mtbf

thanks, man:) love you, Bro,

So, the summary is: for unsigned representation: Overflow = C_out for sigend representation: Overflow = C_out ^ C_in Am I correct??

how int h can take the argument run which is actually a string ?

Sir, in every case, you have taken the correct logic level after the flipflop came from a metastable state, but it's not true in every case, right? Because when a flipflop comes from a metastable state it can take either zero or 1, if we get the wrong stable state, then total functionality changed? then what is its use?

when you are IN class and you don't understand shit 🥰🥰

Last nt befor the exam

this is very easy to draw ..can you please give me another example with complexity like more than 3 variables

Thanks for this video

thank you for your wonderful explanation

great video thankyou

This tutorial is good for basic gates, problems will occur when you try to make stick diagram of exor or exnor yow will need to find Euler's path.

9:51 🤣

You names the edges and the combinational block as A and B. Its soo confusing.

Nice explanation. Thank you so much sir🎉

Plz also draw the layout diagram

is your background Palani by any chance??

You explained this in a very good way Can you please make such more videos related to verilog implementation of all these things

Not understanding particular why are u taking input as 1 at s1 and making remains at s1 only, why are you not taking as 0 input at s1 state

Am not understood what written with black sketch who they happened, at u took 0 at ideal, s1 state going to but how s11 state it self happened

9:50 DID HE SAY DON'T FUC..

Perfect

Really Really Nice Video Man........I have seen many videos of FIFO, but this one cleared all my doubts.... Kudos man

bandha- indian accent- american lol😆

Hi Karthik! Since we are only interested in finding the number which occurs once, I think using a series of XOR operations alone should suffice. My understanding is that a counter (or any sequential for that matter) won't be needed - this is very similar to a binary to gray conversion, where you shift the bits and keep doing XOR. Also, the problem statement does not put a constraint on the max size of the elements which the array can have, so attention has to be paid here as well.

Is there any software where we can directly write code and execute them without using cmd?

you're gawd 🙏🏼🙏🏼🤲🏼🤲🏼

Vikram Tina Roles top secret good example 😂😂

Thank you so much❤

More videos needed...❤

explained with a very simple way