| 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 # | |
| IT, RCS, SIP | 2023-01-24 10:25 |
Gunma | Maebashi Terrsa (Primary: On-site, Secondary: Online) |
An improved context tree switching method by dynamic expansion and pruning of context tree Masaya Ootsu, Hideki Yagi (UEC)  IT2022-36 SIP2022-87 RCS2022-215 |
The Context Tree Weighting (CTW) method is a sequential lossless universal coding algorithm for tree sources with good p... [more] | IT2022-36 SIP2022-87 RCS2022-215 pp.42-47 |
| IT, RCS, SIP | 2023-01-24 10:50 |
Gunma | Maebashi Terrsa (Primary: On-site, Secondary: Online) |
Lower Bound on Maximum Redundancy of Predictive Source Coding for Context Tree Source Shota Saito (Gunma Univ.) IT2022-37 SIP2022-88 RCS2022-216 |
In [Krichevskiy, IEEE Trans. Inf. Theory, vol.44, no.1, pp.296--303, 1998], a lower bound of the maximum redundancy of a... [more] | IT2022-37 SIP2022-88 RCS2022-216 pp.48-50 |
| SAT, KOSST | 2022-10-06 14:05 |
Fukuoka | (Primary: On-site, Secondary: Online) |
A Study on the Effect of Improving Traffic Accommodation Ratio by Adaptive Coding and Modulation for High Throughput Satellite in Time-Varying Communication Environments Takahiro Ebihara, Tetsushi Ikegami (Meiji Univ.) SAT2022-45 |
The effect of using ACM(Adaptive Coding and Modulation) on improving the traffic accommodation ratio in Ka-band High Thr... [more] | SAT2022-45 pp.6-11 |
| SAT, RCS (Joint) |
2022-08-26 16:10 |
Hokkaido | (Primary: On-site, Secondary: Online) |
A Study of Frequency Assignment for Adaptive Coding and Modulation Scheme on Flexible Satellite Communication System Mitsugu Ohkawa, Hiromitsu Wakana, Amane Miura (NICT) SAT2022-43 |
The resource control for frequency bandwidth and transmission power between beams is effective in Ka-band high capacity ... [more] | SAT2022-43 pp.76-81 |
| IT | 2022-07-21 14:05 |
Okayama | Okayama University of Science (Primary: On-site, Secondary: Online) |
New algorithms for computing the correct decoding probability exponent for lossy source coding Yutaka Jitsumatsu (Tokyo Tech.), Yasutada Oohama (UEC) IT2022-17 |
In a 1976 paper, Arimoto proposed an algorithm for computing the error exponent and the correct decoding probability exp... [more] | IT2022-17 pp.10-11 |
| IN, RCS, NV (Joint) |
2022-05-26 15:45 |
Kanagawa | Keio University (Hiyoshi Campus) (Primary: On-site, Secondary: Online) |
[Tutorial Lecture]
Distributed Lossy Multi-terminal Communications over Fading MAC and Decision Making (This tutorial is funded by IoTAD-CEO project under CominLab) Tad Matsumoto (IMT-Atlantique, Brest, France/Professor Emeritus, JAIST), Elsa Dupraz (IMT-Atlantique, Brest, France) RCS2022-18 |
Network Information Theory is an extension of Shannon’s Information Theory to Networks. We believe that the key to the s... [more] | RCS2022-18 pp.26-27 |
| RCC, WBS, SAT, MICT | 2022-05-27 11:00 |
Online | Online | A Study of The Effect of Improving Traffic Accommodation Ratio by ACM for High Throughput Satellite Communications System Takahiro Ebihara, Tetsushi Ikegami (Meiji Univ.) WBS2022-14 RCC2022-14 SAT2022-14 MICT2022-14 |
The effect of using ACM(Adaptive Coding and Modulation) on improving the traffic accommodation ratio in Ka-band High Thr... [more] | WBS2022-14 RCC2022-14 SAT2022-14 MICT2022-14 pp.65-70 |
| IT, ISEC, RCC, WBS | 2022-03-10 14:15 |
Online | Online | Lossy Source Coding of Binary Memoryless Source by Trained LDGM Encoder Kazuki Ogawa, Motohiko Isaka (Kwansei Gakuin Univ.) IT2021-101 ISEC2021-66 WBS2021-69 RCC2021-76 |
Use of low-density generator matrix codes with message-passing algorithm is an efficient approach for lossy coding of th... [more] | IT2021-101 ISEC2021-66 WBS2021-69 RCC2021-76 pp.111-115 |
| IT, ISEC, RCC, WBS | 2022-03-11 14:05 |
Online | Online | Achievable rate of multi-letter Ahlswede-Han scheme for modulo-sum problem Takuto Kakishima, Shun Watanabe (TUAT) IT2021-120 ISEC2021-85 WBS2021-88 RCC2021-95 |
The achievable sum-rate of modulo-sum problem for two sources according to i.i.d. is investigated. We calculate the sum-... [more] | IT2021-120 ISEC2021-85 WBS2021-88 RCC2021-95 pp.221-226 |
| IT, ISEC, RCC, WBS | 2022-03-11 14:55 |
Online | Online | On Strong Converse Theorem for Distributed Hypothesis Testing Yasutada Oohama (UEC) IT2021-122 ISEC2021-87 WBS2021-90 RCC2021-97 |
In this study, we consider a communication system in which data generated at two points with correlation is separatley... [more] |
IT2021-122 ISEC2021-87 WBS2021-90 RCC2021-97 pp.228-233 |
| RCS, SIP, IT | 2022-01-21 13:30 |
Online | Online | Slepian-Wolf Coding Theorems Considering Costs for Codewords Naoki Ueda, Tomohiko Uyematsu (Tokyo Tech) IT2021-81 SIP2021-89 RCS2021-249 |
Many codes used for source coding assume that the costs for transmitting and recording each symbol are uniform, and code... [more] | IT2021-81 SIP2021-89 RCS2021-249 pp.295-300 |
| RCS, SAT (Joint) |
2021-08-27 17:35 |
Online | Online | A Study of Adaptive Coding and Modulation Scheme suitable for Flexible Satellite Communication System Mitsugu Okawa, Hiromitsu Wakana, Amane Miura (NICT) SAT2021-40 |
The resource control for frequency bandwidth and transmission power between beams is effective in Ka-band high capacity ... [more] | SAT2021-40 pp.67-72 |
| ITE-ME, EMM, IE, LOIS, IEE-CMN, IPSJ-AVM [detail] | 2021-08-25 13:25 |
Online | Online | Extraction of watermarks from video frames by using BSS Akane Yokota, Masaki Kawamura (Yamaguchi Univ.) LOIS2021-17 IE2021-12 EMM2021-47 |
We propose a method for extracting watermarks additively embedded in video frames by using blind source separation (BS... [more] |
LOIS2021-17 IE2021-12 EMM2021-47 pp.7-12 |
| EMM, IT | 2021-05-20 13:25 |
Online | Online | The Achievable Rate Region of Wyner-Ahlswede-Korner Coding Problem for Mixed Sources Daisuke Takeuchi, Shun Watanabe (TUAT) IT2021-2 EMM2021-2 |
The achievable rate region of Wyner-Ahlswede-Körner coding problem for mixed sources is investigated.Wyner-Ahlswede-Körn... [more] | IT2021-2 EMM2021-2 pp.7-12 |
| WBS, IT, ISEC | 2021-03-04 10:55 |
Online | Online | An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section Koshi Shimada, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2020-115 ISEC2020-45 WBS2020-34 |
In this paper, we present an efficient coding algorithm for a non-stationary source based on context tree models that ve... [more] | IT2020-115 ISEC2020-45 WBS2020-34 pp.19-24 |
| NC, MBE (Joint) |
2021-03-04 09:50 |
Online | Online | Evaluation of effect of source noise on magnetoencephalography source estimation using a structured sparse model Kai Miyazaki, Shun Nirasawa, Kazuaki Akamatsu, Yoichi Miyawaki (UEC) NC2020-56 |
Magnetoencephalography (MEG) is a method to acquire human brain activity at a high temporal resolution, but its spatial ... [more] | NC2020-56 pp.77-82 |
| EA, US, SP, SIP, IPSJ-SLP [detail] | 2021-03-03 14:05 |
Online | Online | [Poster Presentation]
A unified source-filter network for neural vocoder Reo Yoneyama, Yi-Chiao Wu, Tomoki Toda (Nagoya Univ.) EA2020-69 SIP2020-100 SP2020-34 |
In this paper, we propose a method to develop a neural vocoder using a single network based on the source-filter theory.... [more] | EA2020-69 SIP2020-100 SP2020-34 pp.57-62 |
| SIP, IT, RCS | 2021-01-21 10:55 |
Online | Online | A counterexample to the conjecture that the maximum redundancy of the AIFV-m codes is 1/m and an improvement Yuta Nakamura, Ueda Daichi, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2020-73 SIP2020-51 RCS2020-164 |
Hu, Yamamoto, and Honda proposed the binary AIFV-m codes and proved that the redundancy of the optimal binary AIFV-m cod... [more] | IT2020-73 SIP2020-51 RCS2020-164 pp.58-63 |
| SIP, IT, RCS | 2021-01-21 13:10 |
Online | Online | A Study on the Joint Source-Channel Coding for Computing Functions
-- An Approach from a Dichotomy of Functions -- Naruki Joki, Shigeaki Kuzuoka (Wakayama Univ.) IT2020-82 SIP2020-60 RCS2020-173 |
In this paper，a problem of joint source-channel coding for computing functions of outputs from correlated sources is stu... [more] | IT2020-82 SIP2020-60 RCS2020-173 pp.101-106 |
| SIP, IT, RCS | 2021-01-21 15:45 |
Online | Online | [Special Invited Talk]
Turbo Equalization to Lossless/Lossy Distributed Multiterminal Source Coding: How are they connected?
-- Towards Distributed Hypothesis Testing over IoT Networks -- Tadashi Matsumoto (JAIST) IT2020-80 SIP2020-58 RCS2020-171 |
A goal of this talk is to provide the audience with the knowledge about how the presenter's research experiences and foo... [more] | IT2020-80 SIP2020-58 RCS2020-171 p.99 |
[Return to Top Page]