Encoding LDPC Codes Using the Triangular Factorization

Yuichi KAJI

doi:10.1093/ietfec/e89-a.10.2510

Encoding LDPC Codes Using the Triangular Factorization

Yuichi KAJI

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.10 pp.2510-2518

Publication Date: 2006/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.10.2510

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Yuichi KAJI, "Encoding LDPC Codes Using the Triangular Factorization" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 10, pp. 2510-2518, October 2006, doi: 10.1093/ietfec/e89-a.10.2510.
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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.10.2510/_p

Copy

@ARTICLE{e89-a_10_2510,
author={Yuichi KAJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Encoding LDPC Codes Using the Triangular Factorization},
year={2006},
volume={E89-A},
number={10},
pages={2510-2518},
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.},
keywords={},
doi={10.1093/ietfec/e89-a.10.2510},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - Encoding LDPC Codes Using the Triangular Factorization
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2510
EP - 2518
AU - Yuichi KAJI
PY - 2006
DO - 10.1093/ietfec/e89-a.10.2510
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2006
AB - 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.
ER -