<h4 class="headings" id="heading1">Quick Overview -</h4>
Excess -3 to BCD code Converter / Conversion using K-map.
Solved using K-map.
How to write/make truth table and find output expressions ?
Why first 4 and last 3 output rows are represented ' X ' (don't care conditions).
How to find don't care ? Output Dependencies?
Beginner's Guide to understand Conversion.&nbsp;
<h4 class="headings" id="heading2">Truth Table -</h4>
<img src="../static/attachments_public_temp/28032021063905038462.PNG" alt="" width="343" height="526">
&nbsp;
<h4 class="headings" id="heading3">Expression For Solving K-map -</h4>
B3 = Σm(11, 12) + dm(0, 1, 2, 13, 14, 15)
B2 = Σm(7, 8, 9, 10) + dm(0, 1, 2, 13, 14, 15)
B1 = Σm(5, 6, 9, 10) + dm(0, 1, 2, 13, 14, 15)
B0 = Σm(4, 6, 8, 10, 12) + dm(0, 1, 2, 13, 14, 15)
&nbsp;
<h5 class="headings" id="heading4">K-map for B3&nbsp;-</h5>
B3 = Σm(11, 12) + dm(0, 1, 2, 13, 14, 15)
<img src="../static/attachments_public_temp/01042021155712737736.PNG" alt="" width="375" height="347">
B3 = E2E3 + E0E1E3
&nbsp;
<h5 class="headings" id="heading5">K-map for B2 -</h5>
B2 = Σm(7, 8, 9, 10) + dm(0, 1, 2, 13, 14, 15)
<img src="../static/attachments_public_temp/01042021160600063231.PNG" alt="" width="356" height="340">
B2 = E0'E2' + E1'E2' + E0E1E2
&nbsp;
<h5 class="headings" id="heading6">K-map for B1 -</h5>
B1 = Σm(5, 6, 9, 10) + dm(0, 1, 2, 13, 14, 15)
<img src="../static/attachments_public_temp/01042021160626378865.PNG" alt="" width="329" height="351">
B1 = E0E1' + E0'E1
&nbsp;
<h5 class="headings" id="heading7">K-map for B0 -</h5>
B0 = Σm(4, 6, 8, 10, 12) + dm(0, 1, 2, 13, 14, 15)
<img src="../static/attachments_public_temp/01042021160647802462.PNG" alt="" width="344" height="349">
B0 = E0'
&nbsp;
<h4 class="headings" id="heading8">Output Boolean Expression -</h4>
B3 = E2E3 + E0E1E3
B2 = E0'E2' + E1'E2' + E0E1E2
B1 = E0E1' + E0'E1
B0 = E0'
&nbsp;
<h4 class="headings" id="heading9">Implementation using Basic Gates -</h4>
<h4 class="headings" style="padding-left: 10pt;" id="heading10"><img src="../static/attachments_public_temp/11042021032732447731.png" width="1008" height="708"></h4>

Excess-3 to BCD Code Converter

How to desgin a loop in digital electronics using counter.
Implementation using gates in proteus.
<h4 class="headings" id="heading1">Loop Introduction -</h4>
Loop is a set of tasks in which these set of tasks executed many times.
Loop is a popular term of programming languages.
for example if you want add two numbers 10 times what you will do to perform this task.
Will you make 2 bit adder 10 times using logic gates ?
The answer is " No ".
You should use loop to solve this problem.
&nbsp;
<h4 class="headings" id="heading2">What we need -</h4>
<ol>
<li>Counter&nbsp;</li>
<li>Magnitude comparator</li>
<li>Decoder</li>
</ol>
<h4 class="headings" id="heading3">Circuit Diagram -</h4>
<img src="../static/attachments_public_temp/01052021120728637753.png" width="1098" height="614">
Use Decoder output to perform your task.
I have used only three outputs of counter and 3 to 8 line decoder. You can use all outputs of counter with 4 to 8 line decoder .
<h5 class="headings" style="padding-left: 10pt;" id="heading4"><a style="background-color: #ffffff; color: #3598db;" title="Github Link" href="https://github.com/saurabh-git-dev/DigitalElectronics_Loop">Proteus File Download</a></h5>
!!!!!!&nbsp; Soon I will upload a demonstration video&nbsp; !!!!!!!!

How To Make Conditional Loop Circuit Using Logic Gates

What is serial adder ?
Difference between parllel and serial adder.
How it works?
Implementation using IC's and Proteus File.&nbsp;
Adavantage and Disadvantage over Parllel adder.
&nbsp;
<h4 class="headings" id="heading1">What is Serial Adder -</h4>
Serial adder is combinational circuit that performs binary addition in serialized manner instead of parllel.&nbsp;
I will take a example to explain it -
<img src="../static/attachments_public_temp/19042021161142194844.png" width="145" height="196">
In the avobe example i have taken two decimal numbers . Now assume you have to add these two numbers. What you will do . You will start adding but wait how ?
How to add two numbers ? You will start from taking rightmost digit of both number and add them write down carry and sum . Next you will take 2nd digits from right and add them. this procedure continues till we reached at leftmost digit.
In similar manner, Serial adder works.
<img src="../static/attachments_public_temp/19042021161326333456.png" width="113" height="187">
We start taking left digits of both number and continue this step. take one digit at a time from both number and add them write sum and transfer the carry to the next.
&nbsp; &nbsp;
<h4 class="headings" id="heading2">Block Diagram of Serial Adder -</h4>
<img src="../static/attachments_public_temp/19042021160908162299.png" width="778" height="528">
&nbsp;
<h4 class="headings" id="heading3">How to Design Serial Adder using IC's -</h4>
<img src="../static/attachments_public_temp/20042021115203299495.png" width="876" height="577">
<h4 class="headings" style="padding-left: 10pt;" id="heading4"></h4>
<h6 class="headings" style="padding-left: 10pt;" id="heading5"><a title="Github" href="https://github.com/saurabh-git-dev/Serial-Adder.git" target="_blank" rel="noopener">Proteus File Download</a></h6>
&nbsp;
<h4 class="headings" id="heading6">Advantages and Disadvantages -</h4>
Since it add numbers in serial manner, it can add very long bit numbers also.&nbsp;
It takes more time in comparison to parllel adder.

Serial Adder Introduction, Designing with 74LS Series IC's in Proteus Simulator.

<h3 class="headings" id="heading1">Quick Overview -</h3>
Beginner's Guide to understand Conversion,
BCD to Excess -3 code Converter / Conversion using K-map,
Making truth table and find output expressions,
Finding Don't care conditions,
Output Dependencies,
Implementation using gates.
<h3 class="headings" id="heading2">Truth Table -</h3>
<img src="../static/attachments_public_temp/27032021174130519902.PNG" alt="" width="395" height="579">
Since BCD code is from 0 to 9. So for each BCD input there will be output +3 greater than the bcd. So for BCD ( 0 0 0 0 ) there will be output (0 0 0 0 + 0 0 1 1) which is equals to (0 0 1 1).
To get output table (truth table) add 3 (0 0 1 1) in each BCD input.
Now, Once truth table is ready go for next step.
<h3 class="headings" id="heading3">Method -</h3>
From table we will make ouput expressions which can be solved using k-map (Karnaugh Map).
To get expression. Start taking one output bit. lets take E3 (You are free to choose anyone first).
Now, look at the truth table and&nbsp;find 1's in E3 column and corresponding&nbsp; BCD code.
find decimal value for this BCD code.
Now, write it as E3 = Σm(6,7,8,9) .
Similarly E2 ,E1 ,E0 can be found .
E3 = Σm(6,7,8,9)
E2 = Σm(2,3,4,5)
E1 = Σm(0,1,4,5,8,9)
E0 = Σm(1,3,5,7,9)&nbsp;
&nbsp;
Since BCD is only from 0 to 9, therefore for input 10 to 15 output will be don't care terms.
So, write outputs also in terms of don't care conditions -
E3 = Σm(6,7,8,9) + dm(10,11,12,13,14)
Similarly&nbsp; E2 ,E1 ,E0&nbsp;can be expressed.
<h3 class="headings" id="heading4">Output Expressions -</h3>
E3 = Σm(6,7,8,9) + dm(10,11,12,13,14)
E2 = Σm(2,3,4,5) + dm(10,11,12,13,14)
E1 = Σm(0,1,4,5,8,9) + dm(10,11,12,13,14)
E0 = Σm(1,3,5,7,9) + dm(10,11,12,13,14)
&nbsp;
<h4 class="headings" id="heading5">K-map For E3 -</h4>
E3 = Σm(6,7,8,9) + dm(10,11,12,13,14)
<img src="../static/attachments_public_temp/27032021174153211243.PNG" alt="" width="382" height="361">
E3 = B2B0 + B2B1 + B3
&nbsp;
<h4 class="headings" id="heading6">K-map For E2 -</h4>
E2 = Σm(2,3,4,5) + dm(10,11,12,13,14)
<img src="../static/attachments_public_temp/27032021174215891586.PNG" alt="" width="392" height="352">
E2 =B2'B0 + B2'B1 + B2B1'B0'
&nbsp;
<h4 class="headings" id="heading7">K-map For E1 -</h4>
E1 = Σm(0,1,4,5,8,9) + dm(10,11,12,13,14)
<img src="../static/attachments_public_temp/27032021174236836750.PNG" alt="" width="382" height="306">
E1 = B1B0 + B1'B0'
&nbsp;
<h4 class="headings" id="heading8">K-map For E0 -</h4>
E0 = Σm(1,3,5,7,9) + dm(10,11,12,13,14)
<img src="../static/attachments_public_temp/27032021174255462580.PNG" alt="" width="383" height="371">
E0 = B0'
&nbsp;
<h4 class="headings" id="heading9">Boolean Expressions For Outputs E3 , E2&nbsp; , E1 , E0&nbsp;-</h4>
E3 = B2B0 + B2B1 + B3
E2 = B2'B0 + B2'B1 + B2B1'B0'
E1 = B1B0 + B1'B0'
E0 =&nbsp;B0'
&nbsp;
<h4 class="headings" id="heading10">Implementation Using Basic Gates -</h4>
<img src="../static/attachments_public_temp/27032021174313246050.PNG" alt="" width="620" height="594">

BCD to Excess-3 Code Converter

Conversion of Gray Code to Binary using K-map method.
Finding Truth table and expressions for K-map.
Implementation using logic gates.
&nbsp;
<h4 class="headings" id="heading1">Truth Table -</h4>
To find truth table first it is neccessary to know about gray code and binary code then it can be found easily.
I have made truth table for your simplicity.
<img src="../static/attachments_public_temp/02042021092616029061.PNG" alt="" width="400" height="594">
&nbsp;
<h4 class="headings" id="heading2">How To Solve -</h4>
Now, To solve it we need truth table which i have already made.
Lets consider first for output B3 , see&nbsp; column B3 and find the rows where B3 is 1 and notedown corresponding input values.
Now, for this corresponding value write decimal value.
Now, once you got all of these things you are ready for writing your first expression -&nbsp;
write it as , &nbsp;B3 = Σm( 8, 9, 10, 11, 12, 13, 14, 15 )
Similarly take output B2 and find 1's in the column and for input find corresponding decimal value and write it.
&nbsp;
<h4 class="headings" id="heading3">Output Expression For K-map -</h4>
&nbsp;B3 = Σm( 8, 9, 10, 11, 12, 13, 14, 15 )
&nbsp;B2 = Σm( 4, 5, 6, 7, 12, 13, 14, 15 )
&nbsp;B1 = Σm( 2, 3, 4, 5, 8, 9, 14, 15 )
&nbsp;B0 = Σm( 1, 2, 4, 7, 8, 11, 13, 14)
&nbsp;
<h4 class="headings" id="heading4">K-map for B3 -</h4>
&nbsp;B3 = Σm( 8, 9, 10, 11, 12, 13, 14, 15 )
<img src="../static/attachments_public_temp/02042021093109805058.PNG" alt="" width="392" height="331">
&nbsp;B3 = G3&nbsp;
&nbsp;
<h4 class="headings" id="heading5">K-map for B2 -</h4>
&nbsp;B2 = Σm( 4, 5, 6, 7, 8, 9, 10, 11 )
<img src="../static/attachments_public_temp/02042021093145280140.PNG" alt="" width="409" height="336">
B2 = G3'G2 +G3G2'&nbsp;
<h4 class="headings" id="heading6">K-map for B1 -</h4>
&nbsp;B1 = Σm( 2, 3, 4, 5, 8, 9, 14, 15 )
<img src="../static/attachments_public_temp/02042021093224904596.PNG" alt="" width="413" height="347">
&nbsp;B1 = G3G2'G1' + G3'G2G1' + G3'G2'G1 + G3G2G1&nbsp;
&nbsp;
<h4 class="headings" id="heading7">K-map for B0 -</h4>
&nbsp;B0 = Σm( 1, 2, 4, 7, 8, 11, 13, 14)
<img src="../static/attachments_public_temp/02042021093319165627.PNG" alt="" width="375" height="339">
&nbsp;B0 = G0G1'G2'G3' + G0'G1G2'G3' + G0'G1'G2G3' + G0G1G2G3' + G0G1'G2G3 + G0'G1G2G3 + G0G1G2'G3 + G0G1'G2'G3
&nbsp;
<h4 class="headings" id="heading8">Output Boolean Expression -</h4>
&nbsp;B3 = G3&nbsp;
&nbsp;
&nbsp;B2 = G3'G2 +G3G2' = G3 ⊕ G2&nbsp;
&nbsp;
&nbsp;B1 = G3G2'G1' + G3'G2G1' + G3'G2'G1 + G3G2G1&nbsp;
&nbsp; &nbsp; &nbsp; &nbsp;= G1'&nbsp;( G3G2’&nbsp;+ G3’G2 ) + G1 ( G3’G2’&nbsp;+ G3G2 )&nbsp;
&nbsp; &nbsp; &nbsp; = G1'&nbsp;( G3 ⊕ G2&nbsp;) + G1 ( G3 ⊕ G2&nbsp;)'&nbsp;
&nbsp; &nbsp; &nbsp; = G3 ⊕ G2 ⊕ G1&nbsp;
&nbsp;
&nbsp;B0 = G0G1'G2'G3' + G0'G1G2'G3' + G0'G1'G2G3' + G0G1G2G3' + G0G1'G2G3 + G0'G1G2G3 + G0G1G2'G3 + G0G1'G2'G3
&nbsp; &nbsp; &nbsp; = G2'G3' ( G0G1' + G0'G1 ) + G2G3' (G0'G1' + G0G1 ) + G2G3 ( G0G1' + G0'G1 ) + G2'G3 (G0'G1' + G0G1 )&nbsp;
&nbsp; &nbsp; &nbsp; = G2'G3' ( G0&nbsp;⊕ G1 ) + G2G3' ( G0&nbsp;⊕ G1 )' + G2G3 ( G0&nbsp;⊕ G1 )&nbsp;+ G2'G3 ( G0&nbsp;⊕ G1 )'
&nbsp; &nbsp; &nbsp; = ( G0&nbsp;⊕ G1 ) [&nbsp;G2'G3' + G2G3 ] + ( G0&nbsp;⊕ G1 )' [ G2G3' + G2'G3 )&nbsp;
&nbsp; &nbsp; &nbsp; = ( G0&nbsp;⊕ G1 ) ( G2&nbsp;⊕ G3 )' + &nbsp;( G0&nbsp;⊕ G1 )' ( G2&nbsp;⊕ G3 )&nbsp;
&nbsp; &nbsp; &nbsp; = G3 ⊕ G2 ⊕ G1 ⊕ G0&nbsp;
&nbsp;
<h4 class="headings" id="heading9">Implementation using Basic Gates -</h4>
<img src="../static/attachments_public_temp/11042021042523562959.png" width="761" height="737">

How to Convert Gray Code To Binary? Solve using K-map. 

Sending Email using ESP8266 Wi-Fi (Node MCU) Module via SMTP

Designing adder circuit using multiplexers and also from decoders.
Full Adder Demonstration.
Full adder using logic gates.
&nbsp;
<h4 class="headings" id="heading1">Full Adder Introduction -</h4>
Full Adder is logic of addition in which two numbers are added along with carry input. It means there will be three input in which one is carry input. It will help when we have a carry from some another logics or from any previous addition.
&nbsp;
<h4 class="headings" id="heading2">Full Adder Truth Table -</h4>
<table style="border-collapse: collapse; max-width: 23rem; width: 80%; height: 47px; background-color: #f8cac6; border-color: #000000; border-style: solid;" border="1">
<tbody>
<tr>
<td style="width: 19.6748%; text-align: center;">A</td>
<td style="width: 19.7561%; text-align: center;">B</td>
<td style="width: 19.7561%; text-align: center;">Cin</td>
<td style="width: 19.7561%; text-align: center;">S</td>
<td style="width: 19.7561%; text-align: center;">Cout</td>
</tr>
</tbody>
</table>
<table style="border-collapse: collapse; max-width: 23rem; width: 80%; height: 437px; background-color: #c2e0f4; border-color: #000000; border-style: solid; float: left;" border="1">
<tbody>
<tr>
<td style="width: 19.6748%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">0</td>
<td style="width: 19.7561%; text-align: center;">1</td>
</tr>
<tr>
<td style="width: 19.6748%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
<td style="width: 19.7561%; text-align: center;">1</td>
</tr>
</tbody>
</table>
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
<h4 class="headings" id="heading3">Full Adder K-map Solutions -</h4>
K-map Expression for outputs from truth table -
&nbsp;Sum ,&nbsp; &nbsp; &nbsp; &nbsp;S ( A, B, Cin ) = ∑m ( 1, 2, 4, 7 )&nbsp;
&nbsp;Carry ,&nbsp; Cout ( A, B, Cin ) = ∑m ( 3, 5, 6, 7 )&nbsp;
<h4 class="headings" style="padding-left: 10pt;" id="heading4">•&nbsp; K-map for S -</h4>
<img src="../static/attachments_public_temp/16052021114225541212.png">
From K-map, S = A'BC' + AB'C' + A'B'C + ABC
<h4 class="headings" style="padding-left: 10pt;" id="heading5">•&nbsp; K-map for Cout -</h4>
<img src="../static/attachments_public_temp/16052021114240945350.png">
From K-map, Cout = AB + BC + AC
K-map Solutions -
S&nbsp; &nbsp;= A'BC' + AB'C' + A'B'C + ABC
or&nbsp; &nbsp;= C'( A'B + AB' ) + C( A'B' + AB )&nbsp;
or&nbsp; &nbsp;= C'( A ⊕ B ) + C( A ⊕ &nbsp;B ) '
&nbsp;S&nbsp;&nbsp; =&nbsp; A ⊕ B ⊕ C&nbsp;
&nbsp;
&nbsp;Cout = AB + BC + AC&nbsp;
or&nbsp; &nbsp; &nbsp; = ABC' + A'BC + AB'C + ABC
or&nbsp; &nbsp; &nbsp; = ABC' + ( A'B + AB' ) C + ABC
or&nbsp; &nbsp; &nbsp; = AB( C' + C ) + ( A'B + AB' ) C&nbsp;
Cout &nbsp; &nbsp; &nbsp;= AB + ( A ⊕ B ) C&nbsp;
<h4 class="headings" id="heading6">Implementation using basic gates -</h4>
<img src="../static/attachments_public_temp/16052021123623701090.png" width="563" height="218">
<h4 class="headings" id="heading7">Implementation using Multiplexers -</h4>
<img src="../static/attachments_public_temp/16052021142520680484.png" width="459" height="459">
<h4 class="headings" id="heading8">Implementation using Decoder -</h4>
<img src="../static/attachments_public_temp/16052021142541314168.png" width="459" height="459">

How to make adder circuit using multiplexer and decoder

How to make Truth Table .
Solve this problem using K-Map.
Implement it with gates and find Expressions.
&nbsp;
<h4 class="headings" id="heading1">Quick Overview -</h4>
In&nbsp;computing&nbsp;and&nbsp;electronic&nbsp;systems,&nbsp;binary-coded decimal&nbsp;(BCD) is a class of&nbsp;binary&nbsp;encodings of&nbsp;decimal&nbsp;numbers where each&nbsp;digit&nbsp;is represented by a fixed number of bits, usually four or eight. It is from&nbsp;0 to 9&nbsp;. This is also called "8421".
BCD takes advantage of the fact that any one decimal numeral can be represented by a four bit pattern.&nbsp;
<a title="Wikipedia" href="https://en.wikipedia.org/wiki/Binary-coded_decimal" target="_blank" rel="noopener">Read More</a>
&nbsp;
<h4 class="headings" id="heading2">Understand the need -</h4>
In some application if we want to whether user input is correct BCD or not then we will perform operation according to the user input either will terminate the execution or do warn the user to input correct BCD value .
&nbsp;
<h4 class="headings" id="heading3">How we are going to detect -</h4>
To solve this problem lets assume if input is from 0(0 0 0 0) to 9( 1 0 0 1) then it should indiacte true (means it is valid BCD) and if input is from 11( 1 0 1 1) to 15( 1 1 1 1) then it should inidicate false (Invalid BCD) . Now for indicaton if i assume one output , which will be high(1) for valid BCD and low(0) for Invalid , then&nbsp; it can solve the problem.
So consider 4 input( BCD input) and one output to detect and make truth table .
&nbsp;
<h4 class="headings" id="heading4">Truth table -</h4>
<img src="../static/attachments_public_temp/09042021081316306267.PNG" alt="" width="372" height="532">
&nbsp;
<h4 class="headings" id="heading5">Expression For K-Map -</h4>
Now from truth table , output Y will be -
Y = Σm&nbsp;( 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 )
&nbsp;
<h4 class="headings" id="heading6">Solve K-Map For O/P (Y) -</h4>
Y = Σm&nbsp;( 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 )
Represent it in 4 variable K-map.
<img src="../static/attachments_public_temp/09042021081356509242.PNG" alt="" width="478" height="387">
Now From K-map we will obtain -
&nbsp;Y = B3' + B2'B1'&nbsp;
&nbsp;
<h4 class="headings" id="heading7">Boolean Expression For Y -</h4>
&nbsp;Y = B3' + B2'B1'&nbsp;
&nbsp;
<h4 class="headings" id="heading8">Implementation using Basic Gates -</h4>
<img src="../static/attachments_public_temp/09042021083408891158.PNG" alt="" width="765" height="477">

Latest

Excess-3 to BCD Code Converter

How To Make Conditional Loop Circuit Using Logic Gates

Serial Adder Introduction, Designing with 74LS Series IC's in Proteus Simulator.

BCD to Excess-3 Code Converter

How to Convert Gray Code To Binary? Solve using K-map.