Member since: 4 years
Educational Institution: Not Entered
Country: Not Entered
BCD to 7 segment decoder
BCD to 7 segment decoderMOD 12 COUNTER
MOD 12 COUNTERMUX with counter
MUX with counter2 x 4 DECODER
2 x 4 DECODER2 to 4 Decoder
2 to 4 Decoder3-bit parity Checker
3-bit parity CheckerNOR BASED SR FLIPFLOP
NOR BASED SR FLIPFLOPTFF USING SRFF
TFF USING SRFFHALF SUBTRACTOR
HALF SUBTRACTOR1 to 16 DEMUX
1 to 16 DEMUXFULL ADDER
FULL ADDERsequence generator using counter
sequence generator using counterFULL SUBTRACTOR-NAND NAND IMPLEMENTATION
FULL SUBTRACTOR-NAND NAND IMPLEMENTATIONGRAY TO BINARY CODE CONVERTER
GRAY TO BINARY CODE CONVERTERPISO
PISO8 to 1 MUX
8 to 1 MUX32 to 1 MUX using 4 to 1 MUX
32 to 1 MUX using 4 to 1 MUXOR USING 2 TO 1 MUX
OR USING 2 TO 1 MUXNAND USING 2 TO 1 MUX
NAND USING 2 TO 1 MUXNOT USING 2 TO 1 MUX
NOT USING 2 TO 1 MUXMOD 12 COUNTER
MOD 12 COUNTERHALF ADDER USING MINIMAL NUMBER OF NAND GATES
HALF ADDER USING MINIMAL NUMBER OF NAND GATESIMPLEMENTION USING MUX(2)
IMPLEMENTION USING MUX(2)NOR USING 2 TO 1 MUX
NOR USING 2 TO 1 MUXEXCESS-3 TO BCD
EXCESS-3 TO BCDABSORPTION LAW 1
ABSORPTION LAW 1BCD TO EXCESS-3
BCD TO EXCESS-3AND
ANDFULL SUBRACTOR USING TWO HALF SUBTRACTOR
FULL SUBRACTOR USING TWO HALF SUBTRACTORUntitled
UntitledDFF USING INBUILT
DFF USING INBUILTJK FF
JK FFD FLIPFLOP
D FLIPFLOPTFF USING JKFF
TFF USING JKFFCOMMUTATIVE LAW OF MULTIPLICATION
COMMUTATIVE LAW OF MULTIPLICATIONABSORPTION LAW 2
ABSORPTION LAW 2ABSORPTION LAW 3
ABSORPTION LAW 3DISTRIBUTIVE PROPERTY 2
DISTRIBUTIVE PROPERTY 2DE MORGANS THEORM 2
DE MORGANS THEORM 24 BIT SYNCHRONOUS UP COUNTER
4 BIT SYNCHRONOUS UP COUNTERHALF SUBTRACTOR-NOR NOR IMPLEMENTATION
HALF SUBTRACTOR-NOR NOR IMPLEMENTATIONNAND
NANDNOR
NORAND
ANDEX NOR
EX NORNOT
NOTEXOR
EXORHALF ADDER
HALF ADDERDISTRIBUTIVE PROPERTY
DISTRIBUTIVE PROPERTY1 x 2 DECODER
1 x 2 DECODER2 x 1 ENCODER
2 x 1 ENCODER16 to 1 MUX
16 to 1 MUXJK FLIPFLOP
JK FLIPFLOPJKFF Using TFF
JKFF Using TFFMOD 7 COUNTER
MOD 7 COUNTERHALF SUBTRACTOR USING BASIC GATES
HALF SUBTRACTOR USING BASIC GATESTFF
TFFFULL ADDER-NAND NAND IMPLEMENTATION
FULL ADDER-NAND NAND IMPLEMENTATION1 to 8 DEMUX
1 to 8 DEMUX4 bit bidirectional shift register
4 bit bidirectional shift register16 to 1 MUX
16 to 1 MUXCONSENSUS THEROEM
CONSENSUS THEROEMFULL SUBRACTOR USING NOR GATES
FULL SUBRACTOR USING NOR GATES4 x 2 ENCODER
4 x 2 ENCODERSRFF using DFF
SRFF using DFFJKFF USING DFF
JKFF USING DFFJKFF using SRFF
JKFF using SRFFSRFF USING TFF
SRFF USING TFFSRFF USING JKFF
SRFF USING JKFFABSORPTION LAW 4
ABSORPTION LAW 41 to 2 DEMUX
1 to 2 DEMUX4 bit parity generator
4 bit parity generator2 bit Magnitude Comparator
2 bit Magnitude Comparator1 to 4 DEMUX
1 to 4 DEMUXHALF ADDER USING BASIC GATES
HALF ADDER USING BASIC GATESHALF ADDER-NAND NAND IMPLEMENTATION
HALF ADDER-NAND NAND IMPLEMENTATIONOctal to Binary Encoder
Octal to Binary EncoderDecimal to BCD Encoder
Decimal to BCD EncoderFULL ADDER USING TWO HALF ADDERS
FULL ADDER USING TWO HALF ADDERS24 to 1 MUX using 8 to 1 MUX
24 to 1 MUX using 8 to 1 MUXimplementation of full adder with mux and counter
implementation of full adder with mux and counterHALF ADDER-NOR NOR IMPLEMENTATION
HALF ADDER-NOR NOR IMPLEMENTATIONAND USING 2 TO 1 MUX
AND USING 2 TO 1 MUXDE MORGANS THEORM 1
DE MORGANS THEORM 1TFF USING DFF
TFF USING DFF4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counter4 bit synchronous down counter
4 bit synchronous down counterSISO
SISO2 to 4 Decoder
2 to 4 Decoder4 bit ripple down counter
4 bit ripple down counterASSOCIATIVE LAW OF ADDITION
ASSOCIATIVE LAW OF ADDITIONFULL SUBRACTOR USING BASIC GATES
FULL SUBRACTOR USING BASIC GATESmod-6 unit distance counter
mod-6 unit distance counterSIPO
SIPOVERFICATION OF BOOLEAN LAWS AND POSTULATES
VERFICATION OF BOOLEAN LAWS AND POSTULATESMOD 7 COUNTER
MOD 7 COUNTERDFF USING JKFF
DFF USING JKFFPIPO
PIPONAND BASED SR FLIPFLOP
NAND BASED SR FLIPFLOPAND
ANDlab
labCOMMUTATIVE LAW OF ADDITION
COMMUTATIVE LAW OF ADDITION1 bit Magnitude Comparator
1 bit Magnitude Comparatorcircuit 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 01 bit Magnitude Comparator
1 bit Magnitude Comparator4 bit ripple counter
4 bit ripple counterEXOR USING 2 TO 1 MUX
EXOR USING 2 TO 1 MUX4 BIT UP-DOWN COUNTER
4 BIT UP-DOWN COUNTERimplementation of full adder using counter
implementation of full adder using counterDFF USING TFF
DFF USING TFFcounter that counts 0,2,4,7,0
counter that counts 0,2,4,7,04 bit parity checker
4 bit parity checker8 TO 3 PRIORITY ENCODER
8 TO 3 PRIORITY ENCODERDFF USING SRFF
DFF USING SRFF3 x 8 DECODER
3 x 8 DECODER4 bit ripple counter with decoded outputs
4 bit ripple counter with decoded outputs4 to 2 priority encoder
4 to 2 priority encoder3 bit binary counter
3 bit binary counterASSOCIATIVE LAW OF MULTIPLICATION
ASSOCIATIVE LAW OF MULTIPLICATION4 to 1 MUX
4 to 1 MUXIMPLEMENTATION USING MUX(1)
IMPLEMENTATION USING MUX(1)16 to 1 MUX
16 to 1 MUX4 BIT UNIVERSAL SHIFT REGISTER
4 BIT UNIVERSAL SHIFT REGISTER3 bit Parity Checker
3 bit Parity Checker3 bit parity generator
3 bit parity generatorBCD to Decimal Decoder
BCD to Decimal Decoder16 to 1 MUX
16 to 1 MUX4 TO 16
4 TO 164 bit synchronous counter
4 bit synchronous counterFULL SUBTRACTOR
FULL SUBTRACTOR2 to 1 MUX
2 to 1 MUXFULL ADDER USING NOR GATES
FULL ADDER USING NOR GATESOR
ORBINARY TO GRAY CODE CONVERTER
BINARY TO GRAY CODE CONVERTERHALF SUBTRACTOR-NAND NAND IMPLEMENTATION
HALF SUBTRACTOR-NAND NAND IMPLEMENTATION4 bit synchronous counter with ripple carry
4 bit synchronous counter with ripple carrycircuit 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 0FULL ADDER USING BASIC GATES
FULL ADDER USING BASIC GATESSR FLIPFLOP
SR FLIPFLOP