I've found many papers on tree adders like Sklansky, Kogge-Stone etc. The drawings never show how a carry-in that is non-zero is consumed so that it propagates to the other stages. The grey and black cells don't show a carry-in. Does someone have a link that shows a drawing or explanation of where in the 3 stage parallel prefix architecture the carry- in is used besides the calculation of the first sum bit like this:
assign sum[0] = can ^ P[0];
Thank you!
assign sum[0] = can ^ P[0];
Thank you!