More LDPC Codes
Standardized LDPC Codes
| Standard | N | K | rate | Parity Check Matrix |
|---|---|---|---|---|
| WiFi (802.11) | 648 | 540 | 5/6 | alist |
| ITU G.h | 336 | 168 | 1/2 | alist |
| WiGig (802.11ad) | 672 | 336 | 1/2 | alist |
| WiGig (802.11ad) | 672 | 420 | 5/8 | alist |
| WiGig (802.11ad) | 672 | 504 | 3/4 | alist |
| WiGig (802.11ad) | 672 | 546 | 13/16 | alist |
| WRAN (802.22) | 384 | 192 | 1/2 | alist |
| WRAN (802.22) | 384 | 256 | 2/3 | alist |
| WRAN (802.22) | 384 | 288 | 3/4 | alist |
| WRAN (802.22) | 384 | 320 | 5/6 | alist |
| WRAN (802.22) | 480 | 240 | 1/2 | alist |
| WRAN (802.22) | 480 | 320 | 2/3 | alist |
| WRAN (802.22) | 480 | 360 | 3/4 | alist |
| WRAN (802.22) | 480 | 400 | 5/6 | alist |
| CCSDS | 128 | 64 | 1/2 | alist |
| CCSDS | 256 | 128 | 1/2 | alist |
| CCSDS | 512 | 256 | 1/2 | alist |
Multi-Edge Type LDPC Codes
For basic information on multi-edge type LDPC codes see [4] and [5]. The codes are designed using a quasi cyclic approach, by lifting a small protograph matrix to create a parity check matrix.
In the alist format for multi-edge type codes the number of hidden variable nodes H is indicated by the 3rd number in the 1st row. The hidden nodes are positioned between bit position K and K+H. v0 and v1 correspond to different construction methods, i.e. different protograph.
Literature
[1] S. Abu-Surra, D. DeClercq, W. Ryan, and D. Divsalar: Trapping set enumerators for specific LDPC codes. Information Theory Applications Workshop (ITA), 2010
[2] These are codes using WiMAX (802.16) protograph, but permutations are set with a progressive edge growth technique to obtain shorter codes than specified in WiMAX.
[3] Tanner, R. M.; Sridhara, D. & Fuja, T.: A Class of Group-Structured LDPC Codes. International Symposium on Coding Theory and Applications, 2001
[4] T. Richardson and R. Urbanke: Modern Coding Theory. Cambrigde University Press, 2008.
[5] D. Divsalar, S. Dolinar and C. Jones: Construction of Protograph LDPC Codes with Lienar Minimum Distance. 2006 IEEE International Symposium on Information Theory, Seattle, 2006