IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 80  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2024-03-14
11:00
Tokyo The University of Electro-Communications Proof of NP-completeness of Tasukuea
Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka) COMP2023-29
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] COMP2023-29
pp.6-13
RCC, ISEC, IT, WBS 2024-03-13
- 2024-03-14
Osaka Osaka Univ. (Suita Campus) A consideration on the generation of algebraic surfaces that can evaluate the computational complexity of section-finding problem
Kosuke Sakata (UTokyo), Koichiro Akiyama (Toshiba) IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80
We report that a method for generating algebraic surfaces, theoretically evaluable for the computational complexity of t... [more] IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80
pp.150-157
RCS, SR, SRW
(Joint)
2024-03-15
14:15
Tokyo The University of Tokyo (Hongo Campus), and online
(Primary: On-site, Secondary: Online)
[Encouragement Talk] Considerations on Computational Complexity Reduction in Channel Prediction Based on Multipath Separation for Sub-THz-Band Communications
Daigo Mochizuki, Toshihiko Nishimura, Takanori Sato, Yasutaka Ogawa (Hokkaido Univ.), Junichiro Hagiwara (Mukogawa Women's Univ.), Takeo Ohgane (Hokkaido Univ.) RCS2023-288
In sixth-generation mobile communications, a sub-THz band will be used for extreme high-data rate communication. Because... [more] RCS2023-288
pp.152-157
SeMI, RCS, RCC, NS, SR
(Joint)
2023-07-13
13:25
Osaka Osaka University Nakanoshima Center + Online
(Primary: On-site, Secondary: Online)
Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals under Frequency-Selective Fading Channel
Jun Saito, Kenichi Higuchi (Tokyo Univ. of Science) RCS2023-92
In this paper, we propose a parallel peak cancellation (PC) method in the peak-to-average power ratio (PAPR) reduction u... [more] RCS2023-92
pp.64-69
QIT
(2nd)
2023-05-29
10:10
Kyoto Katsura Campus, Kyoto University A computational complexity assumption necessary for pseudorandom quantum states generators
Yuki Shirakawa (Kyoto Univ.)
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more]
COMP, IPSJ-AL 2023-05-11
10:00
Hokkaido Hokkaido University A computational complexity assumption necessary for pseudorandom quantum states generators
Yuki Shirakawa (Kyoto Univ.) COMP2023-2
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] COMP2023-2
pp.2-7
RCC, ISEC, IT, WBS 2023-03-15
10:20
Yamaguchi
(Primary: On-site, Secondary: Online)
Efficient composition of encoding polynomial in distributed coded computing scheme
Daisuke Hibino, Tomoharu Shibuya (Sophia Univ.) IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116
Distributed computing is one of the powerful solutions for computational tasks that need the massive size of dataset. La... [more] IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116
pp.325-330
RCS, SR, SRW
(Joint)
2023-03-01
13:25
Tokyo Tokyo Institute of Technology, and Online
(Primary: On-site, Secondary: Online)
Interference Coordination in A Cellular Distributed MU-MIMO System -- Intra-cell Interference Coordination --
Ryo Takahashi, Hidenori Matsuo, Fumiyuki Adachi (Tohoku Univ.) RCS2022-256
Cellular distributed multiuser MIMO (MU-MIMO) is a cellular system in which a wide communication service area is divided... [more] RCS2022-256
pp.54-59
RCS, NS
(Joint)
2022-12-15
11:40
Aichi Nagoya Institute of Technology, and Online
(Primary: On-site, Secondary: Online)
Evaluation of MMSE Postcoding Schemes for Reducing Inter-cluster-interference in A Cellular Distributed MU-MIMO System
Ryo Takahashi, Hidenori Matsuo, Fumiyuki Adachi (Tohoku Univ.) RCS2022-189
Cellular distributed multi-user MIMO (MU-MIMO) is a system in which a large number of distributed antennas deployed over... [more] RCS2022-189
pp.25-30
COMP 2022-03-06
10:30
Online Online EXPTIME-Completeness of Generalized Tsume-Chushogi
Akihiro Uejima, Yuya Kiba, Junichi Omori, Masaaki Sato (Osaka Electro-Communication Univ.) COMP2021-32
We consider the `Tsume-ChuShogi' that restricted chushogi such that at every turn, the attack-side player (the first pla... [more] COMP2021-32
pp.8-15
AP, RCS
(Joint)
2021-11-10
14:55
Nagasaki NBC-Bekkan (Nagasaki)
(Primary: On-site, Secondary: Online)
Computational Complexity Reduction of High Accuracy Fingerprint Method by using Last Received Data on Time Series and correcting Receiving Performance deference
Takahiro Tsujino, Teruya Fujii (Tokyo Tech) RCS2021-151
As a location detection method without using GPS, there is a fingerprint method. It measures the received radio wave pow... [more] RCS2021-151
pp.40-45
RCS 2021-06-23
13:20
Online Online Investigation on Complexity Reduction in Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel
Kenta Hosoi (Tokyo Univ. of Science), Nobuhide Nonaka (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2021-38
In this paper, we propose an algorithm to further reduce the computational complexity of the peak-to-average power ratio... [more] RCS2021-38
pp.56-61
COMP, IPSJ-AL 2020-09-01
14:40
Online Online Complexity of Colored Token Shifting on Graphs
Sai Kwon Kham, Ryuhei Uehara (JAIST) COMP2020-6
Variations of reconfiguration problems are much of interest and important problems in theoretical computer science. The ... [more] COMP2020-6
pp.1-8
RCS 2020-06-25
13:25
Online Online PC-Signal-Based PAPR Reduction Using Null Space in MIMO Channel for MIMO-OFDM Signals under Frequency-Selective Fading Channel
Leon Yamaguchi (Tokyo Univ. of Science), Nobuhide Nonaka (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2020-36
In this paper, we propose a computational complexity-efficient algorithm for the adaptive peak-to-average power ratio (P... [more] RCS2020-36
pp.79-84
IT, SIP, RCS 2020-01-23
10:50
Hiroshima Hiroshima City Youth Center Parallelly Processed Adaptive PAPR Reduction Method Using Null Space in MIMO Channel based on Peak Cancellation Signal for MIMO-OFDM Signals
Taku Suzuki, Mikihito Suzuki, Kenichi Higuchi (Tokyo Univ. of Science) IT2019-42 SIP2019-55 RCS2019-272
In this paper,an algorithm to reduce the required iterations for the peak-to-average power ratio (PAPR) reduction is pro... [more] IT2019-42 SIP2019-55 RCS2019-272
pp.37-43
RCS 2019-06-20
09:40
Okinawa Miyakojima Hirara Port Terminal Building Investigation on Efficient Construction Scheme of Peak Cancellation Signals in Complexity-Reduced PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals
Taku Suzuki, Mikihito Suzuki (Tokyo Univ. of Science), Yoshihisa Kishiyama (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2019-64
In this paper, we investigate efficient construction schemes of the peak cancellation (PC) signals in the complexity-red... [more] RCS2019-64
pp.161-167
RCS 2019-06-21
15:25
Okinawa Miyakojima Hirara Port Terminal Building Complexity-Reduced Algorithm for Adaptive PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals
Mikihito Suzuki, Taku Suzuki (Tokyo Univ. of Science), Yoshihisa Kishiyama (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2019-97
In this paper, we propose a computational complexity-reduced algorithm for our previously reported adaptive peak-to-aver... [more] RCS2019-97
pp.353-358
RCS 2019-04-19
09:30
Hokkaido Noboribetsu Grand Hotel A Study on Low Complexity Fair User Scheduling Employing Spatial Orthogonality for MU-MIMO Systems
Ei Nandar Maung, Yukiko Shimbo, Hirofumi Suganuma, Fumiaki Maehara (Waseda Univ.) RCS2019-13
This report proposes a low complexity fair user scheduling method employing semiorthogonal user selection (SUS) for mult... [more] RCS2019-13
pp.55-59
COMP, IPSJ-AL 2018-05-26
13:30
Aichi Nagoya Institute of Technology Strip flat folding with parallel oblique mountain-valley-assigned creases
Hiro Ito (UEC), Chie Nara (Meiji Univ.), Izumi Shirahama (ECBEING), Mizuho Tomura (UEC) COMP2018-4
The flat foldability problem is a typical problem of origami mathematics, which asks whether or not a given paper with c... [more] COMP2018-4
pp.63-70
SS, MSS 2018-01-18
14:15
Hiroshima   Computational Complexity of Membership and Emptiness Problems for Register Context-Free Grammars
Ryoma Senda, Hiroyuki Seki (Nagoya Univ.) MSS2017-54 SS2017-41
Register context-free grammar (RCFG) is an extension of context-free grammar to handle data values. RCFGs can be applied... [more] MSS2017-54 SS2017-41
pp.41-46
 Results 1 - 20 of 80  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan