| Presentation | 2017-01-19 A Study on Removing Four-Cycle in Tanner Graph for Convolutional Codes(2) Naoki Maekawa, Toshiyuki Shohon, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(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) |
| Keyword(in English) | Sum-Product Algorithm / Convolutional Code / Tanner Graph / Removing Four-Cycle / Parity Check Matrix |
| Paper # | IT2016-53,SIP2016-91,RCS2016-243 |
| Date of Issue | 2017-01-12 (IT, SIP, RCS) |
| Conference Information | |
| Committee | IT / SIP / RCS |
|---|---|
| Conference Date | 2017/1/19(2days) |
| 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. |
| Chair | Masayoshi Ohashi(Fukuoka Univ.) / Makoto Nakashizuka(Chiba Inst. of Tech.) / Hidekazu Murata(Kyoto Univ.) |
| Vice Chair | Jun Muramatsu(NTT) / Masahiro Okuda(Univ. of Kitakyushu) / Shogo Muramatsu(Niigata Univ.) / Satoshi Denno(Okayama Univ.) / Yukitoshi Sanada(Keio Univ.) / Eisuke Fukuda(Fujitsu Labs.) |
| Secretary | Jun Muramatsu(Wakayama Univ.) / Masahiro Okuda(Yokohama College of Commerce) / Shogo Muramatsu(Ritsumeikan Univ.) / Satoshi Denno(Chiba Inst. of Tech.) / Yukitoshi Sanada(Toshiba) / Eisuke Fukuda(NTT DoCoMo) |
| Assistant | Mitsugu Iwamoto(Univ. of Electro-Comm.) / Osamu Watanabe(Takushoku Univ.) / Tetsuya Yamamoto(Panasonic) / Toshihiko Nishimura(Hokkaido Univ.) / Koichi Ishihara(NTT) / Kazushi Muraoka(NEC) / Shinsuke Ibi(Osaka Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Information Theory / Technical Committee on Signal Processing / Technical Committee on Radio Communication Systems |
|---|---|
| Language | JPN |
| 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 |
| 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) |
| Date | 2017-01-19 |
| Paper # | IT2016-53,SIP2016-91,RCS2016-243 |
| Volume (vol) | vol.116 |
| Number (no) | IT-394,SIP-395,RCS-396 |
| Page | pp.pp.41-46(IT), pp.41-46(SIP), pp.41-46(RCS), |
| #Pages | 6 |
| Date of Issue | 2017-01-12 (IT, SIP, RCS) |