Paper Abstract and Keywords |
Presentation |
2011-03-03 10:25
Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs Kenya Sugihara, Hideo Yoshida (Mitsubishi Electric) IT2010-79 ISEC2010-83 WBS2010-58 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
It is known that the error floor performance of LDPC codes depends on the girth in the underlying Tanner graphs. In this paper, we first show the relation between the length of the shortest paths and that of cycles in the Tanner graphs. Next, we derive an algorithm that calculates the length of shortest path. By means of this algorithm, we show a method of
constructing LDPC codes with a desired girth. Moreover, we propose the developed method of constructing QC LDPC codes. We also present the comparison between our proposed method and known methods by computer experiment. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
LDPC code / parity-check matrix / girth / shortest path / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 110, no. 442, IT2010-79, pp. 69-74, March 2011. |
Paper # |
IT2010-79 |
Date of Issue |
2011-02-24 (IT, ISEC, WBS) |
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 |
IT2010-79 ISEC2010-83 WBS2010-58 |
Conference Information |
Committee |
ISEC IT WBS |
Conference Date |
2011-03-03 - 2011-03-04 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Osaka University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
IT |
Conference Code |
2011-03-ISEC-IT-WBS |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs |
Sub Title (in English) |
|
Keyword(1) |
LDPC code |
Keyword(2) |
parity-check matrix |
Keyword(3) |
girth |
Keyword(4) |
shortest path |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Kenya Sugihara |
1st Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
2nd Author's Name |
Hideo Yoshida |
2nd Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
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 |
2011-03-03 10:25:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2010-79, ISEC2010-83, WBS2010-58 |
Volume (vol) |
vol.110 |
Number (no) |
no.442(IT), no.443(ISEC), no.444(WBS) |
Page |
pp.69-74 |
#Pages |
6 |
Date of Issue |
2011-02-24 (IT, ISEC, WBS) |
|