How can i implement the full adder of two 1-bit numbers using only multiplexers 4/1? I created a truth table for a one-bit full adder, which looks like this:
A = first bit
B = second bit
Pu = bit from lower position (used to create an adder for multiple bit numbers)
S = sum
P = transfer to higher position (e.g. if A=1, B=1 and Pu=0, the sum is 0 and transfer 1)
I made K-maps and used AB as selection inputs of a multiplexer and Pu as information input.
And finally got to this solution:
Is it correct?