Ripple Adders:Time?Complexity
The equations for the sum and carry out for a full adder can be
cout0 = x0•y0 + x0•cin0 + y0•cin0
cout1 = x1•y1 + x1•x0•y0 + x1•x0•cin0 + x1•y0•cin0 + y1•x0•y0 + y1•x0•cin0 + y1•y0•cin0
cout2 = x2•y2 + x2•cout1 + y2•cout1
Could we have a tradeoff between time and complexity?