SC decoding has strong data dependency in the sense that the decoding of each bit \(u_i\)  requires the estimation of all the previous bits \(\lbrace u_0,u_1,\ldots ,u_{i-1}\rbrace \) . In a fully-parallel implementation of the SC decoder [1]}, all the \(f\)  and \(g\)  functions that can be performed in parallel are grouped together. Thus, the latency is modeled as the number of times the groups of functions in (REF ) and () are performed to move from one level of the factor graph to another. This is due to the fact that the bit-wise calculations in (REF ) and () are of lower complexity than calculating the LLR values.
