i wasn't spying on you,sir marce... nagkataon lang po na nung tiningnan ko po ang Who's Online, sa K-mapping thread kayo.and matagal kayong nag-stay sa thread na yun kaya i assumed na pinag-aaralan nyo ang k-map but the question is what for? kasi po hindi nyo naman kailangan ang k-map sa ginagawa niyo.hehe dito pala...
Bell - no. 1 hijacker.
hehehehe sorry. ngayon ko lang din nakita... mali pala ang connection ko ng outputs ko... nabaliktad ko yung connection sa BCD to sevensegment decoder.here is the corrected.
sir marcelino.. tama po ba ung gagawin ko? kukunin ko lng ung output dun sa Q(underlined).. then, magiging synchronous(down) counter na xa?tia
JK flip flop Excitation TableTransition JK =========================0 → 0 0X0 → 1 1X1 → 0 X11 → 1 X0=========================
Present Next JK[3] JK[2] JK[1] JK[0]================================================================0 0000 0001 0X 0X 0X 1X1 0001 0010 0X 0X 1X X1
after completing the table, isa-isahin mo nang isolve (kmap or boolean). solve for J3, K3, J2, K2, J1, K1, J0 and K0... i use kmap para madali. just get all the values of J(X) in its column. put the values 1,0 and X to its appropriate location then reduce it.
JK flip flop Excitation TableTransition JK =========================0 > 0 0X0 > 1 1X1 > 0 X11 > 1 X0========================= Present Next JK[3] JK[2] JK[1] JK[0]===================================================F 1111 XXXX XX XX XX XXE 1110 XXXX XX XX XX XXD 1101 XXXX XX XX XX XXC 1100 XXXX XX XX XX XXB 1011 XXXX XX XX XX XXA 1010 XXXX XX XX XX XX===================================================9 1001 1000 X0 0X 0X X18 1000 0111 X1 1X 1X 1X7 0111 0110 0X X0 X0 X16 0110 0101 0X X0 X1 1X5 0101 0100 0X X0 0X X14 0100 0011 0X X1 1X 1X3 0011 0010 0X 0X X0 X12 0010 0001 0X 0X X1 1X1 0001 0000 0X 0X 0X X10 0000 1001 1X 0X 0X 1X===================================================AFTER K-MAPPING:J[3] = B'C'D'K[3] = D'J[2] = AD'K[2] = C'D'J[1] = BD' + AD'k[1] = D'J[0] = 1;K[0] = 1;
Present Next J[3]=========================F 1111 XXXX XE 1110 XXXX XD 1101 XXXX XC 1100 XXXX XB 1011 XXXX XA 1010 XXXX X=========================9 1001 1000 X8 1000 0111 X7 0111 0110 06 0110 0101 05 0101 0100 04 0100 0011 03 0011 0010 02 0010 0001 01 0001 0000 00 0000 1001 1=========================
ahh.. hehe.. ganun pala.. tnx sir marce.. +1 ulit wait lang.. hmm.. ung D natin, nakakabit sa A ng 7448? tama po ba? ung U1:A sa schem un ang D sa reduce equation natin? tama po ba?
ang least significant bit ng BCD to seven segment decoder ay ang A. MSb naman ang D. Whereas sa derivation natin, MSB yung A. ikaw na ang bahala magRename ng mga variables... hehehe