Full adder

Status
Not open for further replies.

rds1975

New Member
Hi

Can anyone suggest solution for this one:


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
 
Status
Not open for further replies.
Cookies are required to use this site. You must accept them to continue using the site. Learn more…