Encoding LDPC codes using the triangular factorization

Search this article

Abstract

An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently. It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson's encoding algorithm if the code has a small gap.

Journal

Citations (4)*help

See more

References(9)*help

See more

Details 詳細情報について

Report a problem

Back to top