The equivalence of peeling decoding and belief propagation for low-density parity-check (LDPC) codes over the binary erasure channel is examined. The error performance of structured spatially-coupled (SC)-LDPC code ensembles is shown to follow a scaling law similar to that of unstructured randomly-constructed SC-LDPC codes. The number of erased variable nodes (VNs) during the decoding process is then analyzed and compared to the number of resolvable equations. Finally, a scaling law using the number of VNs is established for SC-LDPC codes.
«
The equivalence of peeling decoding and belief propagation for low-density parity-check (LDPC) codes over the binary erasure channel is examined. The error performance of structured spatially-coupled (SC)-LDPC code ensembles is shown to follow a scaling law similar to that of unstructured randomly-constructed SC-LDPC codes. The number of erased variable nodes (VNs) during the decoding process is then analyzed and compared to the number of resolvable equations. Finally, a scaling law using the nu...
»