Member since: 3 years
Educational Institution: MEPCO SCHLENK ENGINNERING COLLEGE,SIVAKASI
Country: India
16:1 MUX
16:1 MUXBINARY TO GRAY CODE
BINARY TO GRAY CODE4 bit synchronous counter
4 bit synchronous counter4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counter4 BIT UNIVERSAL SHIFT REGISTER
4 BIT UNIVERSAL SHIFT REGISTERSIPO
SIPOEX OR USING 2 TO 1 MUX
EX OR USING 2 TO 1 MUXEXP 8.1
EXP 8.1Untitled
Untitled2X1 MUX
2X1 MUX8:1 MUX
8:1 MUXHALF ADDER USING BASIC GATES
HALF ADDER USING BASIC GATESFULL SUBTRACTOR USING XOR GATE
FULL SUBTRACTOR USING XOR GATE3 BIT PARITY CHECKER
3 BIT PARITY CHECKER4 BIT PARITY CHECKER
4 BIT PARITY CHECKER1:4 DEMUX
1:4 DEMUX1:2 DEMUX
1:2 DEMUX1:8 DEMUX
1:8 DEMUX24:1 MUX USING 8:1 MUX
24:1 MUX USING 8:1 MUX4:1 IMPLEMENTATION
4:1 IMPLEMENTATION2:1 ENCODER
2:1 ENCODER4:2 ENCODER
4:2 ENCODER4:2 PRIORITY ENCODER
4:2 PRIORITY ENCODER16:1 MUX IMPLEMENTATION
16:1 MUX IMPLEMENTATIONHALF SUBTRACTOR USING NOR GATE
HALF SUBTRACTOR USING NOR GATEHALF ADDER USING NOR GATE
HALF ADDER USING NOR GATE4 BIT PARITY GENERATOR
4 BIT PARITY GENERATORHALF SUBTRACTOR USING XOR GATE
HALF SUBTRACTOR USING XOR GATE4:1 MUX
4:1 MUXFULL ADDER USING NOR GATES
FULL ADDER USING NOR GATESHALF SUBTRACTOR USING NAND GATE
HALF SUBTRACTOR USING NAND GATEVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWS3 BIT PARITY GENERATOR
3 BIT PARITY GENERATORHALF SUBTRACTOR USING BASIC GATES
HALF SUBTRACTOR USING BASIC GATES3 TO 8 DECODER
3 TO 8 DECODERD FF USING OTHER FF
D FF USING OTHER FFPISO
PISOUntitled
Untitled4 bit synchronous down counter
4 bit synchronous down counterSISO
SISOsequence generator using counter
sequence generator using countermod-6 unit distance counter
mod-6 unit distance countercounter that counts 0,2,4,7,0
counter that counts 0,2,4,7,03 bit binary counter
3 bit binary counterPIPO
PIPOOR USING 2 TO 1 MUX
OR USING 2 TO 1 MUXUntitled
UntitledNOR USING 2 TO 1 MUX
NOR USING 2 TO 1 MUXAND GATE
AND GATENOT USING 2 TO 1 MUX
NOT USING 2 TO 1 MUXOR GATE
OR GATENOT GATE
NOT GATEEXP 8.2
EXP 8.2T FF USING D FF
T FF USING D FFT FF USING SR FF
T FF USING SR FFSR JK D T FF
SR JK D T FFSR JK D T FF
SR JK D T FFSR FF USING T FF
SR FF USING T FFSR FF USING JK FF
SR FF USING JK FFJK FF USING D FF
JK FF USING D FFSR FF USING DFF
SR FF USING DFFJK FF USING SR FF
JK FF USING SR FFJK FF USING T FF
JK FF USING T FFVERIFICATION OF BOOLEAN PROPERTY AND LAWS
VERIFICATION OF BOOLEAN PROPERTY AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSNAND GATE
NAND GATEBCD TO SEVEN SEGMENT DECODER
BCD TO SEVEN SEGMENT DECODERNOR GATE
NOR GATEXnor GATE
Xnor GATEBCD TO EXCESS-3 CONVERTER I
BCD TO EXCESS-3 CONVERTER IHALF ADDER USING NAND GATE
HALF ADDER USING NAND GATEFULL ADDER USING BASIC GATES
FULL ADDER USING BASIC GATESXor GATE
Xor GATEVERIFICATION OF BOOLEAN POSTULATES AND LAWS
VERIFICATION OF BOOLEAN POSTULATES AND LAWSCONSENSUS THEOREM
CONSENSUS THEOREMCONSENSUS THEOREM
CONSENSUS THEOREM4 bit bidirectional shift register
4 bit bidirectional shift register8:1 MUX IMPLEMENTATION
8:1 MUX IMPLEMENTATION8:3 ENCODER
8:3 ENCODER10:4 ENCODER
10:4 ENCODEREXCESS - 3 TO BCD CONVERTER I
EXCESS - 3 TO BCD CONVERTER I2 BIT MAGNITUDE COMPARATOR
2 BIT MAGNITUDE COMPARATORGRAY TO BINARY CODE I
GRAY TO BINARY CODE IFULL SUBTRACTOR USING BASIC GATES
FULL SUBTRACTOR USING BASIC GATESHALF ADDER USING XOR GATE
HALF ADDER USING XOR GATEBCD TO DECIMAL DECODER
BCD TO DECIMAL DECODER8 TO 3 PRIORITY ENCODER
8 TO 3 PRIORITY ENCODERFULL ADDER USING NAND GATES
FULL ADDER USING NAND GATEScircuit that counts (0,2,4...14)when input is 1 and counts (1,3...15)when input is 0
circuit that counts (0,2,4...14)when input is 1 and counts (1,3...15)when input is 03 BIT PARITY GENERATOR
3 BIT PARITY GENERATORFULL SUBTRACTOR USING NAND GATES
FULL SUBTRACTOR USING NAND GATES32:1 MUX USING 4:1 MUX
32:1 MUX USING 4:1 MUXFULL ADDER USING XOR GATES
FULL ADDER USING XOR GATESimplementation of full adder with mux and counter
implementation of full adder with mux and counterFULL SUBTRACTOR USING NOR GATES
FULL SUBTRACTOR USING NOR GATESAND USING 2 TO 1 MUX
AND USING 2 TO 1 MUXimplementation of full adder using counter
implementation of full adder using counterI BIT MAGNITUDE COMPARATOR
I BIT MAGNITUDE COMPARATOR2:1 IMPLEMENTATION
2:1 IMPLEMENTATIONEXP 8.1
EXP 8.1