Question

. After drawing the K-map for the sum of minterm expression F(A,B,C,D)=Σ(0,2,3,7,8,10,11,15) (a) Derive a NAND-NAND implementation diagram b) Derive a NOR-NOR implementation diagram c) Derive a NAND-AND implementation diagram (d) Derive a NOR-OR implementation diagram (e) State which of the implementations provided in parts a)-d) is the fastest

Answer 1

اه | | اه دي 888 | أحه هرکی هم د د ة6 = | | )) الا ا دا Š ŏ + CD Call FLA, B, C,D) = ال10 له را AS ) = (ها) (5 ) - (O + 5ة - ) لما لمحارو,ايكيكيا TT = (وہلو، لہلہحہعره ه ا اه وه معهم زمرے (ه + ) د ه اه * | 0 10 ق ) + (همة)| CBD CCD ع - (د ) (هم ل = رقم (6 ق دمه - [ ( فقط ل قاء هكه مالك م ) م (م + 1 8 و 4

considering all gates have equal propagation delays - c4d are fastest I both . halle equal no. of gates per stage (figure).

112A U?A 7 LSID TDTD UPA 719 <TEXT UPA TEXT U?:A TILSTS

If we assume delay of 10ns for every gate, we find that both the circuits in c and d give equal and the least propagation delays. Those in a and b have more number of gates, they will obviously have greater delay.

I have used De'Morgan's laws to reduce the Boolean expression.

Minterms and maxterms are complementary to each other. The terms absent in minterm expression will be present in maxterm expression and vice versa.  

..

.

I have answered all your questions with all necessary steps and details.

Please rate a thumbs up if satisfied .

Have a nice time ahead :)