Can anybody help me to solve this...............??????
A one-bit full adder is to be implemented using 8-to-1 multiplexers
(a) Write the t ruth table for sum (S) and carry to the next stage CN in terms of
the two bit (A, B) and carry from the previous stage (CP) . The t ruth table
should be in the ascending order of (A,B,CP).
(B) Implement S and CN using 8-to- 1 multiplexer.
Thanks & best regards,
Ramesh Raju
A one-bit full adder is to be implemented using 8-to-1 multiplexers
(a) Write the t ruth table for sum (S) and carry to the next stage CN in terms of
the two bit (A, B) and carry from the previous stage (CP) . The t ruth table
should be in the ascending order of (A,B,CP).
(B) Implement S and CN using 8-to- 1 multiplexer.
Thanks & best regards,
Ramesh Raju