Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2007-05-18 14:25
A Probabilistic Algorithm for Computing the Minimal Stopping Set of LDPC Codes
Yoshiho Konishi (Kobe Univ.), Masanori Hirotomo (Hyogo Inst. of Info. Edu. Found.), Masakatu Morii (Kobe Univ.) IT2007-2
Abstract (in Japanese) (See Japanese page) 
(in English) Over the binary erasure channel, the performance of LDPC codes under iterative decoding algorithms is estimated by small-size stopping sets (especially, minimum-size stopping sets).
However, it is very difficult to compute the minimum-size stopping set of LDPC codes, because the time complexity for finding the minimum-size stopping set of LDPC codes with long length is very large.
In this paper, we propose an efficient method for computing the minimum-size stopping set of LDPC codes.
It is an algorithm to generate small-size stopping sets with low complexity by using the relation between stopping sets and codewords.
Using the method iteratively, we can stochastically compute the minimum-size stopping set of LDPC codes.
Additionally, we could compute the minimum-size stopping set of several LDPC codes by using our method.
This means that our method is efficient as the method for computing the minimum-size stopping set of LDPC codes.
Keyword (in Japanese) (See Japanese page) 
(in English) LDPC code / stopping set / probabilistic algorithm / / / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 42, IT2007-2, pp. 7-12, May 2007.
Paper # IT2007-2 
Date of Issue 2007-05-11 (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 IT2007-2

Conference Information
Committee IT  
Conference Date 2007-05-18 - 2007-05-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Denkoku-No-Mori (Yonezawa) 
Topics (in Japanese) (See Japanese page) 
Topics (in English) general 
Paper Information
Registration To IT 
Conference Code 2007-05-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Probabilistic Algorithm for Computing the Minimal Stopping Set of LDPC Codes 
Sub Title (in English)  
Keyword(1) LDPC code  
Keyword(2) stopping set  
Keyword(3) probabilistic algorithm  
Keyword(4)  
Keyword(5)  
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 Hyogo Institute of Information Education Foundation (Hyogo Inst. of Info. Edu. Found.)
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 ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2007-05-18 14:25:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2007-2 
Volume (vol) vol.107 
Number (no) no.42 
Page pp.7-12 
#Pages 6 
Date of Issue 2007-05-11 (IT) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan