| 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 | 2017-01-19 10:50 A Study on Removing Four-Cycle in Tanner Graph for Convolutional Codes(2) Naoki Maekawa, Toshiyuki Shohon (NIT,Kagawa College)  IT2016-53 SIP2016-91 RCS2016-243 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | The removing four-cycle method in tanner graph has been proposed to improve sum-product decoding performance for convolutional codes. However, by that method, it is difficult to remove four-cycle(RmFC) in complicated tanner graph. This paper proposes a new RmFC method that uses parity check matrix instead of parity check polynomial that is used in ordinary method. The proposed method constructs the RmFC parity check matrix for any code length by the use of that for short code length. The proposed method constructs the parity check matrix that has no four-cycle for any code length by the use of that for short code length. The proposed method, at first, removes all four-cycles from the parity check matrix for short code length. By the use of that for short code length, the proposed method constructs the parity check matrix that has no four-cycle for any code length. For (155,117) code, the parity matrix for short code length obtained by the proposed method contained complicated time shift structure. I introduced two or more kinds of additional bits for this, and devised the methodology of deriving simple time shift structure by rearranging a parity check matrix. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | Sum-Product Algorithm / Convolutional Code / Tanner Graph / Removing Four-Cycle / Parity Check Matrix / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 116, no. 394, IT2016-53, pp. 41-46, Jan. 2017. | |
| Paper # | IT2016-53 | |
| Date of Issue | 2017-01-12 (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 | IT2016-53 SIP2016-91 RCS2016-243 |
|
| Conference Information | |
| Committee | IT SIP RCS |
| Conference Date | 2017-01-19 - 2017-01-20 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Osaka City Univ. |
| 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 | 2017-01-IT-SIP-RCS |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Study on Removing Four-Cycle in Tanner Graph for Convolutional Codes(2) |
| Sub Title (in English) | |
| Keyword(1) | Sum-Product Algorithm |
| Keyword(2) | Convolutional Code |
| Keyword(3) | Tanner Graph |
| Keyword(4) | Removing Four-Cycle |
| Keyword(5) | Parity Check Matrix |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Naoki Maekawa |
| 1st Author's Affiliation | National Institude of Technology Kagawa College (NIT,Kagawa College) |
| 2nd Author's Name | Toshiyuki Shohon |
| 2nd Author's Affiliation | National Institude of Technology Kagawa College (NIT,Kagawa College) |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2017-01-19 10:50:00 |
| Presentation Time | 25 minutes |
| Registration for | IT |
| Paper # | IT2016-53, SIP2016-91, RCS2016-243 |
| Volume (vol) | vol.116 |
| Number (no) | no.394(IT), no.395(SIP), no.396(RCS) |
| Page | pp.41-46 |
| #Pages | 6 |
| Date of Issue | 2017-01-12 (IT, SIP, RCS) |
[Return to Top Page]