Paper Abstract and Keywords |
Presentation |
2016-01-18 11:00
A Study on Message Passing Algorithm for Counting Short Cycles in Sparse Bipartite Graphs Yuta Nakahara, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2015-50 SIP2015-64 RCS2015-282 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
In this paper, we propose an improvement of message passing algorithm for counting short cycles in sparse bipartite graphs. Let $g$ and $|E|$ denote the girth of the graph and number of edges respectively. In previous studies, algorithms are proposed for counting cycles of length $g, g+2,dots , 2g-2$ with complexity of $O(g|E|^2)$. Our proposed algorithm is able to count cycles of the same length of previous algorithm with lower complexity by limiting the nodes to process. Proposed algorithm have the complexity of $O(|E|d_u^{frac{g}{2}}d_w^{frac{g}{2}-1})$, where the node degrees of bipartite graph is constant $d_u, d_w$. Then computer simulation is provided to count the cycles of famous LDPC codes. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Bipartite graph / cycle / LDPC code / message passing / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 115, no. 394, IT2015-50, pp. 13-18, Jan. 2016. |
Paper # |
IT2015-50 |
Date of Issue |
2016-01-11 (IT, SIP, RCS) |
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 |
IT2015-50 SIP2015-64 RCS2015-282 |
Conference Information |
Committee |
RCS IT SIP |
Conference Date |
2016-01-18 - 2016-01-19 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Kwansei Gakuin Univ. Osaka Umeda Campus |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Signal Processing for Wireless Communications, Learning, Mathematical Science, Communication Theory, etc. |
Paper Information |
Registration To |
IT |
Conference Code |
2016-01-RCS-IT-SIP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
A Study on Message Passing Algorithm for Counting Short Cycles in Sparse Bipartite Graphs |
Sub Title (in English) |
|
Keyword(1) |
Bipartite graph |
Keyword(2) |
cycle |
Keyword(3) |
LDPC code |
Keyword(4) |
message passing |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yuta Nakahara |
1st Author's Affiliation |
Waseda University (Waseda Univ.) |
2nd Author's Name |
Shota Saito |
2nd Author's Affiliation |
Waseda University (Waseda Univ.) |
3rd Author's Name |
Toshiyasu Matsushima |
3rd Author's Affiliation |
Waseda University (Waseda 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 |
() |
Speaker |
Author-1 |
Date Time |
2016-01-18 11:00:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2015-50, SIP2015-64, RCS2015-282 |
Volume (vol) |
vol.115 |
Number (no) |
no.394(IT), no.395(SIP), no.396(RCS) |
Page |
pp.13-18 |
#Pages |
6 |
Date of Issue |
2016-01-11 (IT, SIP, RCS) |
|