| Presentation | 2009-03-10 Sufficient Conditions for Convergence of the Sum-Product Decoding Tomoharu Shibuya, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently, Mooij et al. proposed sufficient conditions for convergence of the sum-product algorithm, which was stated as the upper bound for the spectral radius of a matrix defined by a probability distribution under consideration. In this paper, we adapt Mooij's sufficient conditions to the decoding problem, and derive a sufficient condition for convergence of the sum-product decoding. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | sum-product decoding / LDPC codes / factor graph / convergence of sum-product algorithm |
| Paper # | IT2008-110,ISEC2008-168,WBS2008-123 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2009/3/2(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 Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Sufficient Conditions for Convergence of the Sum-Product Decoding |
| Sub Title (in English) | |
| Keyword(1) | sum-product decoding |
| Keyword(2) | LDPC codes |
| Keyword(3) | factor graph |
| Keyword(4) | convergence of sum-product algorithm |
| 1st Author's Name | Tomoharu Shibuya |
| 1st Author's Affiliation | Department of Mathematics, Sophia University() |
| Date | 2009-03-10 |
| Paper # | IT2008-110,ISEC2008-168,WBS2008-123 |
| Volume (vol) | vol.108 |
| Number (no) | 473 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |