| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2008-09-12 10:25 An Algorithm for Computing the Stopping Redundancy of LDPC Codes Using the Probabilistic Method Yoshiho Konishi, Masanori Hirotomo, Masakatu Morii (Kobe Univ.)  IT2008-33 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | The performance of LDPC codes under iterative decoding algorithms over the binary erasure channel (BEC) is estimated by the minimum-size stopping sets in the code. The size of smallest stopping set is called the stopping distance. The stopping distance plays important role in understanding the performance of the code under iterative decoding over the BEC, akin to the role played by the minimum distance for maximum-likelihood decoding. Since the stopping distance depends on the structure of parity-check matrix, we can construct the parity-check matrix by adding linearly dependent rows to the matrix, so that the stopping distance is equal to the minimum distance. The stopping redundancy is defined as the minimum number of rows in such a parity-check matrix. Although upper and lower bounds on the stopping redundancy of binary linear codes have been derived, it is difficult to compute the stopping redundancy of long-length LDPC codes since the time complexity for computing the stopping redundancy is very large. In this paper, we propose an efficient method for computing the stopping redundancy of LDPC codes. It is an algorithm to compute the stopping redundancy using probabilistic algorithm. Additionally, we show numerical results of computing the stopping redundancy of (504,252) and (1008,504) LDPC codes. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | LDPC code / stopping set / stopping distance / stopping redundancy / probabilistic algorithm / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 108, no. 202, IT2008-33, pp. 79-84, Sept. 2008. | |
| Paper # | IT2008-33 | |
| Date of Issue | 2008-09-04 (IT) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | IT2008-33 |
|
| Conference Information | |
| Committee | IT |
| Conference Date | 2008-09-11 - 2008-09-12 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Culture Resort Festone (Okinawa) |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | IT |
| Conference Code | 2008-09-IT |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Algorithm for Computing the Stopping Redundancy of LDPC Codes Using the Probabilistic Method |
| Sub Title (in English) | |
| Keyword(1) | LDPC code |
| Keyword(2) | stopping set |
| Keyword(3) | stopping distance |
| Keyword(4) | stopping redundancy |
| Keyword(5) | probabilistic algorithm |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Yoshiho Konishi |
| 1st Author's Affiliation | Kobe University (Kobe Univ.) |
| 2nd Author's Name | Masanori Hirotomo |
| 2nd Author's Affiliation | Kobe University (Kobe Univ.) |
| 3rd Author's Name | Masakatu Morii |
| 3rd Author's Affiliation | Kobe University (Kobe Univ.) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2008-09-12 10:25:00 |
| Presentation Time | 25 minutes |
| Registration for | IT |
| Paper # | IT2008-33 |
| Volume (vol) | vol.108 |
| Number (no) | no.202 |
| Page | pp.79-84 |
| #Pages | 6 |
| Date of Issue | 2008-09-04 (IT) |
[Return to Top Page]