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
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences E89-A (10), 2510-2518, 2006-10-01
Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1050577309353450624
-
- NII Article ID
- 110007537719
-
- NII Book ID
- AA10826239
-
- ISSN
- 09168508
-
- HANDLE
- 10061/4982
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- CiNii Articles