Member since: 4 years
Educational Institution: Not Entered
Country: Not Entered
FULL ADDER-NAND NAND IMPLEMENTATION
FULL ADDER-NAND NAND IMPLEMENTATION8 to 1 MUX
8 to 1 MUXBCD ADDER
BCD ADDERRipple carry Adder
Ripple carry AdderNAND USING 2 TO 1 MUX
NAND USING 2 TO 1 MUXJKFF Using TFF
JKFF Using TFF4 bit synchronous down counter
4 bit synchronous down counterJK FLIPFLOP
JK FLIPFLOPSRFF using DFF
SRFF using DFFTFF
TFFJK FLIPFLOP
JK FLIPFLOPSRFF USING JKFF
SRFF USING JKFFDFF USING TFF
DFF USING TFFTFF USING SRFF
TFF USING SRFFHALF SUBTRACTOR-NOR NOR IMPLEMENTATION
HALF SUBTRACTOR-NOR NOR IMPLEMENTATION2 to 4 Decoder
2 to 4 DecoderIMPLEMENTATION USING MUX(1)
IMPLEMENTATION USING MUX(1)Demorgans theprem-II
Demorgans theprem-IIDemorgans theorem
Demorgans theorem3 BIT PARALLEL MULTIPLIER
3 BIT PARALLEL MULTIPLIER3 BIT PARALLEL MULTIPLIER
3 BIT PARALLEL MULTIPLIEREX-NOR
EX-NORNAND
NANDNOR-gate
NOR-gate2 x 1 ENCODER
2 x 1 ENCODER4 bit ripple down counter
4 bit ripple down counterCOMMUTATIVE LAW OF MULTIPLICATION
COMMUTATIVE LAW OF MULTIPLICATIOND FLIPFLOP
D FLIPFLOPTFF USING DFF
TFF USING DFF1 to 2 DEMUX
1 to 2 DEMUXSRFF USING TFF
SRFF USING TFFJKFF USING DFF
JKFF USING DFFSRFF using DFF
SRFF using DFFSIPO
SIPO4 bit parity generator
4 bit parity generator4 bit ripple counter
4 bit ripple counter3 bit binary counter
3 bit binary countercounter that counts 0,2,4,7,0
counter that counts 0,2,4,7,0HALF SUBTRACTOR-NOR NOR IMPLEMENTATION
HALF SUBTRACTOR-NOR NOR IMPLEMENTATIONT FLIPFLOP
T FLIPFLOPOR USING 2 TO 1 MUX
OR USING 2 TO 1 MUXDISTRIBUTIVE PROPERTY
DISTRIBUTIVE PROPERTYJKFF using SRFF
JKFF using SRFFSR FLIPFLOP
SR FLIPFLOPASSOCIATIVE LAW OF MULTIPLICATION
ASSOCIATIVE LAW OF MULTIPLICATION4 x 2 ENCODER
4 x 2 ENCODER24 to 1 MUX using 8 to 1 MUX
24 to 1 MUX using 8 to 1 MUXOctal to Binary Encoder
Octal to Binary EncoderABSORPTION LAW 1
ABSORPTION LAW 1ABSORPTION LAW 3
ABSORPTION LAW 32 to 1 MUX
2 to 1 MUX4 to 1 MUX
4 to 1 MUX4 BIT ADDER /SUBTRACTOR
4 BIT ADDER /SUBTRACTOR4 BIT UP-DOWN COUNTER
4 BIT UP-DOWN COUNTERcircuit 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 0sequence generator using counter
sequence generator using counter1 bit Magnitude Comparator
1 bit Magnitude ComparatorIMPLEMENTATION USING MUX(1)
IMPLEMENTATION USING MUX(1)BCD ADDER
BCD ADDER16 to 1 mux
16 to 1 mux16 to 1 mux
16 to 1 muxUntitled
UntitledNAND BASED SR FLIPFLOP
NAND BASED SR FLIPFLOP3 bit parity generator
3 bit parity generatorFull subtractor using basic gates
Full subtractor using basic gates1 x 2 DECODER
1 x 2 DECODER4 bit ripple counter with decoded outputs
4 bit ripple counter with decoded outputsPISO
PISO4 bit ripple counter with decoded outputs
4 bit ripple counter with decoded outputs1 to 16 DEMUX
1 to 16 DEMUX8 TO 3 PRIORITY ENCODER
8 TO 3 PRIORITY ENCODER4 bit synchronous counter with ripple carry
4 bit synchronous counter with ripple carryBCD to 7 segment decoder
BCD to 7 segment decoderIMPLEMENTION USING MUX(2)
IMPLEMENTION USING MUX(2)SISO
SISO4 bit synchronous counter
4 bit synchronous counter4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counter4 BIT UP-DOWN COUNTER
4 BIT UP-DOWN COUNTERABSORPTION LAW 4
ABSORPTION LAW 4NOR USING 2 TO 1 MUX
NOR USING 2 TO 1 MUXABSORPTION LAW 2
ABSORPTION LAW 23 x 8 DECODER
3 x 8 DECODER2 x 4 DECODER
2 x 4 DECODERNOT gate
NOT gate32 to 1 MUX using 4 to 1 MUX
32 to 1 MUX using 4 to 1 MUX1 x 2 DECODER
1 x 2 DECODEREXCESS-3 TO BCD
EXCESS-3 TO BCDimplementation of full adder with mux and counter
implementation of full adder with mux and counterAND USING 2 TO 1 MUX
AND USING 2 TO 1 MUXDFF USING JKFF
DFF USING JKFFHALF SUBTRACTOR-NAND NAND IMPLEMENTATION
HALF SUBTRACTOR-NAND NAND IMPLEMENTATION4 BIT UNIVERSAL SHIFT REGISTER
4 BIT UNIVERSAL SHIFT REGISTER1 to 8 DEMUX
1 to 8 DEMUX3 bit Parity Checker
3 bit Parity Checker4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counterFULL SUBTRACTOR-NAND NAND IMPLEMENTATION
FULL SUBTRACTOR-NAND NAND IMPLEMENTATIONBCD TO EXCESS-3
BCD TO EXCESS-38 TO 3 PRIORITY ENCODER
8 TO 3 PRIORITY ENCODERFULL SUBRACTOR USING NOR GATES
FULL SUBRACTOR USING NOR GATESCOMMUTATIVE LAW OF ADDITION
COMMUTATIVE LAW OF ADDITIONOR gate
OR gateCONSENSUS THEROEM
CONSENSUS THEROEMFULL SUBTRACTOR
FULL SUBTRACTOREX-OR gate
EX-OR gateHALF SUBTRACTOR
HALF SUBTRACTORMOD 12 COUNTER
MOD 12 COUNTERFULL ADDER USING BASIC GATES
FULL ADDER USING BASIC GATESABSORPTION LAW 3
ABSORPTION LAW 3NOT USING 2 TO 1 MUX
NOT USING 2 TO 1 MUXDFF USING SRFF
DFF USING SRFFASSOCIATIVE LAW OF MULTIPLICATION
ASSOCIATIVE LAW OF MULTIPLICATIONNAND gate
NAND gateDecimal to BCD Encoder
Decimal to BCD EncoderVERFICATION OF BOOLEAN LAWS AND POSTULATES
VERFICATION OF BOOLEAN LAWS AND POSTULATESimplementation of full adder using counter
implementation of full adder using countermod-6 unit distance counter
mod-6 unit distance countercircuit 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 0RIPPLE CARRY SUBTRACTOR
RIPPLE CARRY SUBTRACTORFULL SUBTRACTOR-NAND NAND IMPLEMENTATION
FULL SUBTRACTOR-NAND NAND IMPLEMENTATION4 bit bidirectional shift register
4 bit bidirectional shift registerNOR BASED SR FLIPFLOP
NOR BASED SR FLIPFLOPTFF USING JKFF
TFF USING JKFF4 bit parity checker
4 bit parity checker2 bit Magnitude Comparator
2 bit Magnitude ComparatorPIPO
PIPO1 to 4 DEMUX
1 to 4 DEMUXHalf subtractor using basic gates
Half subtractor using basic gatesEXOR USING 2 TO 1 MUX
EXOR USING 2 TO 1 MUXBCD to Decimal Decoder
BCD to Decimal Decoder4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counterAND gate
AND gatecircuit 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 04 to 2 priority encoder
4 to 2 priority encoderimplementation of full adder using counter
implementation of full adder using counterMOD 7 COUNTER
MOD 7 COUNTERASSOCIATIVE LAW OF ADDITION
ASSOCIATIVE LAW OF ADDITION