Enumeration of the Degree Distribution Space for Finite Block Length LDPC Codes
; Vilela, J.P.
; Santos, J. L. S.
; Harrison, W. K. Harrison
Enumeration of the Degree Distribution Space for Finite Block Length LDPC Codes, Proc IEEE Communications Society IEEE International Conference on Communications ICC, Conference Online, Vol. , pp. - , June, 2021.
Digital Object Identifier:
Current methods for optimization of low-density parity-check (LDPC) codes analyze the degree distribution pair asymptotically as block length approaches infinity. This effectively ignores the discrete nature of the space of valid degree distribution pairs for LDPC codes of finite block length. While large codes are likely to conform reasonably well to the infinite block length analysis, shorter codes have no such guarantee. We present and analyze an algorithm for completely enumerating the space of all valid degree distribution pairs for a given block length, code rate, maximum variable node degree, and maximum check node degree. We then demonstrate this algorithm on an example LDPC code of finite block length. Finally, we discuss how the result of this algorithm can be utilized by discrete optimization routines to form novel methods for the optimization of small block length LDPC codes.