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 50  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CAS, CS 2024-03-14
15:10
Okinawa   [Special Invited Talk] Challenges and Future Direction in Message-Passing Demodulation
Keigo Takeuchi (TUT) CAS2023-121 CS2023-114
Message-passing demodulation is a promising method for demodulation in massive multiple-input multiple-output (MIMO) upl... [more] CAS2023-121 CS2023-114
pp.58-63
ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] 2024-02-19
13:30
Hokkaido Hokkaido Univ. Characteristic analysis to improve the performance of graph-based methods in approximate nearest neighbor search
Tomohiro Kanaumi, Yusuke Matsui (Univ. Tokyo) ITS2023-52 IE2023-41
Approximate nearest neighbor search (ANNS) is the problem of finding the nearest vector to a given query vector in a dat... [more] ITS2023-52 IE2023-41
pp.34-39
OCS, CS
(Joint)
2024-01-11
15:40
Kagoshima   [Special Invited Talk] Progress and Challenges in Quantum-Assisted Communication Systems
Naoki Ishikawa (Yokohama National Univ.) CS2023-96 OCS2023-60
Progress and challenges in quantum-assisted communication systems are reviewed in this presentation. Specifically, the f... [more] CS2023-96 OCS2023-60
p.13(CS), p.19(OCS)
IBISML 2023-09-08
10:55
Osaka Osaka Metropolitan University (Nakamozu Campus)
(Primary: On-site, Secondary: Online)
Langevin-type algorithm for approximate sampling from distributions under non-log-concavity and non-smoothness
Shogo Nakakita (Univ. of Tokyo) IBISML2023-26
This study proposes a Langevin-type algorithm for approximate sampling from non-log-concave non-smooth distributions wit... [more] IBISML2023-26
pp.8-11
MRIS, ITE-MMS 2023-06-08
14:20
Miyagi Tohoku Univ. (RIEC)
(Primary: On-site, Secondary: Online)
[Invited Talk] Computing in pursuit of energy efficiency -- From the perspective of non-volatile memory circuits using MTJ --
Kimiyoshi Usami (Shibaura IT) MRIS2023-3
From AlphaGo which defeated a professional human GO player up to automatic driving of cars and the very recent ChatGPT, ... [more] MRIS2023-3
pp.13-20
RCS, IN, NV
(Joint)
2023-05-25
11:55
Kanagawa Keio University (Hiyoshi Campus), and online
(Primary: On-site, Secondary: Online)
Blind Active User Detection for Grant-Free Access in the Presence of Timing Offsets
Takanori Hara (Tokyo Univ. of Science) RCS2023-18
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] RCS2023-18
pp.23-28
CAS, CS 2023-03-01
10:20
Fukuoka Kitakyushu International Conference Center
(Primary: On-site, Secondary: Online)
Approximate joint diagonalization for blind separation of superimposed images
Shinya Saito, Kunio Oishi (Tokyo University of Tech.) CAS2022-98 CS2022-75
This report presents blind separation of superimposed images. When we take a picture for panorama thought window glass a... [more] CAS2022-98 CS2022-75
pp.12-17
RCS, NS
(Joint)
2022-12-15
16:10
Aichi Nagoya Institute of Technology, and Online
(Primary: On-site, Secondary: Online)
A Study on Outer Loop Link Adaptation in Massive MIMO with Multi-user Detection via Generalized Approximate Message Passing
Takanobu Doi, Jun Shikida, Daichi Shirase, Kazushi Muraoka, Naoto Ishii (NEC), Takumi Takahashi (Osaka Univ.), Shinsuke Ibi (Doshisha Univ.) RCS2022-196
With the ever-growing demand for uplink communications in beyond fifth generation mobile communications (beyond 5G), mas... [more] RCS2022-196
pp.57-62
RCS, NS
(Joint)
2022-12-15
16:35
Aichi Nagoya Institute of Technology, and Online
(Primary: On-site, Secondary: Online)
Blind Multiple Measurement Vector Approximate Message Passing for Grant-Free Access
Takanori Hara (Tokyo Univ. of Science), Koji Ishibashi (The Univ. of Electro-Communications) RCS2022-197
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] RCS2022-197
pp.63-68
QIT
(2nd)
2022-12-09
18:00
Kanagawa Keio Univ.
(Primary: On-site, Secondary: Online)
Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform
Kento Oonishi (MELCO), Noboru Kunihiro (UTsukuba)
Shor's algorithm solves the integer factoring and the discrete logarithm problems in polynomial time. Therefore, the eva... [more]
SIP 2022-08-25
16:30
Okinawa Nobumoto Ohama Memorial Hall (Ishigaki Island)
(Primary: On-site, Secondary: Online)
[Invited Talk] Approximate Message Passing for Efficient Grant-Free Access
Takanori Hara (Tokyo Univ. of Science) SIP2022-59
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access has gained much attention.... [more] SIP2022-59
pp.50-55
RCS 2022-06-16
14:55
Okinawa University of the Ryukyus, Senbaru Campus and online
(Primary: On-site, Secondary: Online)
A study on model parameters for MIMO signal detection using learned AMP
Mari Miyoshi, Toshihiko Nishimura, Takanori Sato, Takeo Ohgane, Yasutaka Ogawa, Junichiro Hagiwara (Hokkaido Univ.) RCS2022-50
Approximate message passing (AMP) is applicable to massive MIMO signal detection and achieves a high detection performan... [more] RCS2022-50
pp.156-161
RCS 2022-04-22
11:20
Osaka Osaka University, and online
(Primary: On-site, Secondary: Online)
A Study on Parametric Bilinear Inference via Gaussian Belief Propagation
Kenta Ito, Takumi Takahashi, Koji Igarashi (Osaka Univ.), Shinsuke Ibi (Doshisha Univ.), Seiichi Sampei (Osaka Univ.) RCS2022-8
Parametric bilinear inference estimates two unknown varables (i.e., parameters) with a symmetric linear regression struc... [more] RCS2022-8
pp.35-40
VLD, HWS [detail] 2022-03-07
10:00
Online Online A Heuristic Scheduling Algorithm with Variable-Cycle Approximate Operations in High-Level Synthesis
Koyu Ohata, Hiroki Nishikawa, Xiangbo Kong, Hiroyuki Tomiyama (Ritsumeikan Univ.) VLD2021-78 HWS2021-55
This paper studies a scheduling algorithm for high-level synthesis that takes into account the difference in delay betwe... [more] VLD2021-78 HWS2021-55
pp.13-18
RCS, SIP, IT 2022-01-21
11:20
Online Online Deep-Unfolded Sparse Signal Recovery Algorithm using TopK Operator
Masanari Mizutani (NITech), Satoshi Takabe (TITech), Tadashi Wadayama (NITech) IT2021-72 SIP2021-80 RCS2021-240
Compressed sensing for estimating sparse signals is formulated as an NP-hard problem, where LASSO based on convex relax... [more] IT2021-72 SIP2021-80 RCS2021-240
pp.245-251
RCS, SIP, IT 2022-01-21
11:45
Online Online Simultaneous matrix diagonalization using alternating least-squares algorithm
Shinya Saito, Kunio Oishi (Tokyo University of Tech.) IT2021-73 SIP2021-81 RCS2021-241
This paper presents an approach for overdetermined blind source separation (BSS) using AJD. The approach is constructed ... [more] IT2021-73 SIP2021-81 RCS2021-241
pp.252-257
RCS 2021-06-25
10:10
Online Online A Study on Suppression of Self-noise Propagation in Gaussian BP and GAMP for Correlated MIMO Detection
Ryota Tamaki, Kenta Ito, Takumi Takahashi (Osaka Univ.), Shinsuke Ibi (Doushisya Univ.), Seiichi Sanpei (Osaka Univ.) RCS2021-67
Generalized approximate message passing (GAMP) is a strong framework to realize low-complexity and high-accuracy multi-u... [more] RCS2021-67
pp.220-225
RCS 2021-06-25
13:10
Online Online Multiple Measurement Vector Approximate Message Passing Without Prior Information of Channels for Grant-Free Non-Orthogonal Multiple Access
Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2021-71
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] RCS2021-71
pp.243-248
IE 2021-01-21
13:25
Online Online [Invited Talk] High-Performance Computing for Image Processing
Norishige Fukushima (NITech) IE2020-35
As cameras become higher resolution, the demand for high-performance image processing continues to increase.
In this ... [more]
IE2020-35
p.7
SIP, IT, RCS 2021-01-21
14:40
Online Online [Invited Talk] Message passing algorithms for nonconvex penalties
Ayaka Sakata (ISM) IT2020-79 SIP2020-57 RCS2020-170
We consider compressed sensing formulated as a minimization problem of nonconvex sparse penalties, Smoothly Clipped Abso... [more] IT2020-79 SIP2020-57 RCS2020-170
pp.93-98
 Results 1 - 20 of 50  /  [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