| Presentation | 2005-05-25 Using Loosely Triangular Form in Encoding LDPC codes with the LU-decomposition Yuichi Kaji, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A permutation strategy for an encoding algorithm of LDPC codes is discussed. The encoding algorithm, proposed by the author, computes parity check symbols by making use of the LU-decomposition of a parity check matrix. To make the algorithm efficient, it is crucial to transform the parity check matrix so that its LU-factors become as sparse as possible. In this paper, we consider to transform the matrix to "loosely triangular" form, and observe how the complexity of the algorithm changes. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | LDPC code / encoding algorithm / LU-decomposition / sparse matrix / triangular matrix |
| Paper # | IT2005-1 |
| Date of Issue |
| Conference Information | |
| Committee | IT |
|---|---|
| Conference Date | 2005/5/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Theory (IT) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Using Loosely Triangular Form in Encoding LDPC codes with the LU-decomposition |
| Sub Title (in English) | |
| Keyword(1) | LDPC code |
| Keyword(2) | encoding algorithm |
| Keyword(3) | LU-decomposition |
| Keyword(4) | sparse matrix |
| Keyword(5) | triangular matrix |
| 1st Author's Name | Yuichi Kaji |
| 1st Author's Affiliation | Nara Institute of Science and Technology() |
| Date | 2005-05-25 |
| Paper # | IT2005-1 |
| Volume (vol) | vol.105 |
| Number (no) | 83 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |