| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MIKA (2nd) |
2019-10-03 11:15 |
Hokkaido | Hokkaido Univ. | [Poster Presentation]
Error Probability Performance of a multiple access system using sparse superposition codes Hayato Tachiwana, Yutaka Jitsumatsu (Kyushu Univ.) |
Sparse Code Multiple Access (SCMA), which is one of the machine type communication methods in mobile communication, avoi... [more] | |
| IT | 2019-09-06 09:45 |
Oita | Yufuin Kenshujo, Nippon Bunri University | Encoding Algorithm of Binary and Non-binary Irregular LDPC Codes via Block Triangular Matrices with Low Weight Diagonal Submatrices Yuta Iketoh, Takayuki Nozaki (Yamaguchi Univ)  IT2019-26 |
In this report, we propose a low complexity encoding algorithm for the binary and non-binary irregular LDPC codes. This... [more] |
IT2019-26 pp.1-6 |
| IT | 2019-09-06 13:00 |
Oita | Yufuin Kenshujo, Nippon Bunri University | [Invited Talk]
Hadamard-type Matrices on Finite Fields and Some Open Problems Tetsuya Kojima (NIT, Tokyo College) IT2019-31 |
Hadamard matrix is defined as a square matrix where any components are $-1$ or $+1$, and where any pairs of rows are mut... [more] | IT2019-31 pp.29-34 |
| EA, SIP, SP | 2019-03-15 13:30 |
Nagasaki | i+Land nagasaki (Nagasaki-shi) | [Poster Presentation]
An Evaluation of Underdetermined Source Separation Based on Multichannel Variational Autoencoder Shogo Seki (Nagoya Univ.), Hirokazu Kameoka (NTT), Li Li (Univ. Tsukuba), Tomoki Toda, Kazuya Takeda (Nagoya Univ.) EA2018-154 SIP2018-160 SP2018-116 |
This paper deals with a multichannel audio source separation problem under underdetermined conditions. Multichannel Non-... [more] | EA2018-154 SIP2018-160 SP2018-116 pp.323-328 |
| IN, NS (Joint) |
2019-03-05 13:30 |
Okinawa | Okinawa Convention Center | A Study on Performance Evaluation of MIMO Channel with Multilevel Spreading Codes Tatsuya Motoki, Miyuki Hirose, Takehiko Kobayashi (Tokyo Denki Univ.) IN2018-135 |
To suppress the noise enhancement, a new spread spectrum communication system with Gold code had studied in our previous... [more] | IN2018-135 pp.307-312 |
| RCS, SIP, IT | 2019-02-01 11:40 |
Osaka | Osaka University | Linear Permutation Polynomial Codes Ryoichiro Yoshida, Kenta Kasai (Tokyo Tech) IT2018-63 SIP2018-93 RCS2018-270 |
Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They hav... [more] | IT2018-63 SIP2018-93 RCS2018-270 pp.161-166 |
| ICSS | 2018-11-22 10:50 |
Kagoshima | Identification Scheme Based on the Binary Syndrome Decoding Problem Using High Density Parity Check Codes Haruka Ito, Masanori Hirotomo (Saga Univ.), Youji Fukuta (Kindai Univ.), Masami Mohri (Gifu Univ.), Yoshiaki Shiraishi (Kobe Univ.) ICSS2018-62 |
Most of the currently used identification schemes can not be safely used if factoring factorization and discrete logarit... [more] | ICSS2018-62 pp.49-54 |
|
| IEE-CMN, EMM, LOIS, IE, ITE-ME [detail] | 2018-09-27 15:15 |
Oita | Beppu Int'l Convention Ctr. aka B-CON Plaza | [Special Talk]
Coded Acquistion of Light Fields
-- From Basis Representation to Deep Learning -- Keita Takahashi (Nagoya Univ.) LOIS2018-15 IE2018-35 EMM2018-54 |
A light field, which is often understood as a set of dense multi-view images, has been utilized in various 2D/3D applica... [more] | LOIS2018-15 IE2018-35 EMM2018-54 pp.29-30 |
| IT, EMM | 2018-05-18 10:50 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | Hadamard-type Matrices on Finite Fields and Complete Complementary Codes Tetsuya Kojima (NIT, Tokyo College) IT2018-7 EMM2018-7 |
Hadamard matrix is defined as a square matrix where any components are $-1$ or $+1$, and where any pairs of rows are mut... [more] | IT2018-7 EMM2018-7 pp.35-40 |
| WBS, IT, ISEC | 2018-03-09 13:55 |
Tokyo | Katsusika Campas, Tokyo University of Science | Influence of Channel Estimation Error on Noise Enhancement Suppression by Using Novel Multilevel Spreading Codes Tatsuya Motoki, Takehiko Kobayashi (Tokyo Denki Univ.) IT2017-146 ISEC2017-134 WBS2017-127 |
Zero-forcing frequency-domain equalization (ZF-FDE) has been used to combat frequency selective fading caused by multipa... [more] | IT2017-146 ISEC2017-134 WBS2017-127 pp.259-264 |
| ICSS, IPSJ-SPT | 2018-03-08 15:15 |
Hokkaido | Okinawa Hokubu Koyou Nouryoku Kaihatsu Sougou Center | On the Ring Signature Scheme Using LDPC Codes Haruka Ito, Masanori Hirotomo (Saga Univ.), Youji Fukuta (Kindai Univ.), Masami Mohri (Gifu Univ.), Yoshiaki Shiraishi (Kobe Univ.) ICSS2017-85 |
The ring signature is one of the group signature schemes that anyone can sign, if it is a group member and can guarantee... [more] | ICSS2017-85 pp.215-220 |
| IT | 2017-07-14 13:20 |
Chiba | Chiba University | Signature Design of Sparsely Spread CDMA Guanghui Song, Jun Cheng (Doshisha Univ.) IT2017-31 |
Sparsely spread code division multiple access (SCDMA) is a non-orthogonal superposition coding scheme that allows concu... [more] | IT2017-31 pp.85-90 |
| ISEC, WBS, IT | 2017-03-09 13:35 |
Tokyo | TOKAI University | On the Design of Locally Repairable Codes Based on Code Modification Hiroto Tamiya (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2016-106 ISEC2016-96 WBS2016-82 |
Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. Locality and Availa... [more] |
IT2016-106 ISEC2016-96 WBS2016-82 pp.49-53 |
| ISEC, WBS, IT | 2017-03-09 14:25 |
Tokyo | TOKAI University | Trellis Reduction for Tail-Biting Convolutional Codes Using Characteristic Matrices and Cyclically Shifted Code-Subsequences Masato Tajima IT2016-108 ISEC2016-98 WBS2016-84 |
Trellis reduction for tail-biting convolutional codes is investigated. A given tail-biting (TB) convolutional code is re... [more] | IT2016-108 ISEC2016-98 WBS2016-84 pp.61-66 |
| IT, SIP, RCS | 2017-01-19 10:50 |
Osaka | Osaka City Univ. | 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 |
The removing four-cycle method in tanner graph has been proposed to improve sum-product decoding performance for convolu... [more] | IT2016-53 SIP2016-91 RCS2016-243 pp.41-46 |
| DC, SS | 2016-10-27 13:40 |
Shiga | Hikone Kinro-Fukushi Kaikan Bldg. | Single Limited-Magnitude Error Correcting Codes Using Integer Residue Ring of Large Order Shohei Kotaki, Masato Kitakami (Chiba Univ.) SS2016-22 DC2016-24 |
Multilevel memories, which store multiple bit information within a memory cell, cause specific errors which mostly shif... [more] |
SS2016-22 DC2016-24 pp.25-29 |
| IT, ISEC, WBS | 2016-03-10 16:20 |
Tokyo | The University of Electro-Communications | Algebraic Construction of KV Trellises for Linear Block Codes Masato Tajima IT2015-120 ISEC2015-79 WBS2015-103 |
In this paper, we present an algebraic construction of Koetter-Vardy (KV) trellises. The proposed method is based on the... [more] | IT2015-120 ISEC2015-79 WBS2015-103 pp.119-124 |
| COMP | 2015-09-01 11:00 |
Nagano | Generalization of Efficient Implementation of Compression by Substring Enumeration
-- Finite Alphabet and Explicit Phase Awareness -- Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-18 |
CSE (Compression by Substring Enumeration), a lossless universal compression scheme was introduced by Dub'e and Beaudoin... [more] | COMP2015-18 pp.13-20 |
|
| IT | 2015-07-13 14:50 |
Tokyo | Tokyo Institute of Technology | Tail-Biting Trellises for a Tail-Biting Convolutional Code Masato Tajima IT2015-25 |
In this paper, we investigate the tail-biting trellis structure and its complexity of a linear block code derived from a... [more] | IT2015-25 pp.47-52 |
| RCS | 2015-06-26 10:21 |
Hokkaido | Hokkaido Univ. | Performance Comparison of Random Beamforming and Codebook-Based Beamforming in Cellular Downlink with Massive MIMO Takuya Hoshino, Kenichi Higuchi (Tokyo Univ. of Science) RCS2015-89 |
This paper compares the throughput levels of random beamforming (RB) and codebook-based beamforming (CBBF) in cellular d... [more] | RCS2015-89 pp.253-256 |
[Return to Top Page]