Convolutional-like LDPC codes achieving capacity on binary erasure channel with bounded complexity through spatial coupling. Chain-like coupling structure with threshold saturation to Shannon limit. Used in optical communications and 5G research.
| Property | Value |
|---|---|
| Category | Error Correction |
| Sub-category | Capacity-Achieving Code |
| Security status | 🧪 Experimental |
| Complexity | Expert |
| Inventor | Michael Lentmaier, Arvind Sridharan, Kamil Zigangirov |
| Year | 2010 |
| Origin | 🇸🇪 Sweden |
| Source | algorithms/ecc/spatially-coupled-ldpc.js |
Status: 🧪 Experimental
| Issue | Description | Mitigation |
|---|---|---|
| Windowed Decoding Complexity | Sliding window decoding requires careful management of window size and update strategy for practical implementation | — |
| Boundary Effects | Termination of finite-length chains can degrade performance at boundaries; requires proper termination strategy | — |
| Memory Requirements | Spatially coupled structure requires storage of multiple code sections for windowed processing | — |
4 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — SC-LDPC all-zero encoding test - L=3, w=2
| Field | Value |
|---|---|
input |
000000 |
expected |
000000000000 |
Vector 2 — SC-LDPC single-bit encoding test - (3,6) protograph
| Field | Value |
|---|---|
input |
010000 |
expected |
010000010001 |
Vector 3 — SC-LDPC pattern encoding test - threshold saturation
| Field | Value |
|---|---|
input |
010100 |
expected |
010100000101 |
Vector 4 — SC-LDPC alternating pattern test
| Field | Value |
|---|---|
input |
010001 |
expected |
010001000000 |